On Grosswald's conjecture on primitive roots

Grosswald's conjecture is that $g(p)$, the least primitive root modulo $p$, satisfies $g(p) \leq \sqrt{p} - 2$ for all $p>409$. We make progress towards this conjecture by proving that $g(p) \leq \sqrt{p} -2$ for all $409<p< 2.5\times 10^{15}$ and for all $p>3.67\times 10^{71}$.Comment: 7 page

On consecutive primitive elements in a finite field

For $q$ an odd prime power with $q>169$ we prove that there are always three consecutive primitive elements in the finite field $\mathbb{F}_{q}$. Indeed, there are precisely eleven values of $q \leq 169$ for which this is false. For $4\leq n \leq 8$ we present conjectures on the size of $q_{0}(n)$ such that $q>q_{0}(n)$ guarantees the existence of $n$ consecutive primitive elements in $\mathbb{F}_{q}$, provided that $\mathbb{F}_{q}$ has characteristic at least~$n$. Finally, we improve the upper bound on $q_{0}(n)$ for all $n\geq 3$.Comment: 10 pages, 2 table

A proof of the conjecture of Cohen and Mullen on sums of primitive roots

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.Comment: 8 pages; to appear in Mathematics of Computatio

Triples and quadruples of consecutive squares or non-squares in a finite field

\begin{abstract} Let \F be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples \{\al-1,\al,\al+1 \} of consecutive non-zero squares in \F and similarly for the number of triples of consecutive non-square elements. A key ingredient is the evaluation of Jacobsthal sums over general finite fields by Katre and Rajwade. This extends results of Monzingo(1985) to non-prime fields. Curiously, the same machinery alows the evaluation of the number of consecutive quadruples \{\al -1, \al,\al+1, \al +2\} of square and non-squares over \F, when $q$ is a power of 5. \end{abstract