Least Consecutive Pair of Primitive Roots

Abstract

Let $p>1$ be a large prime number and let $x=O((\log p{)}^2(\log \log p{)}^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne \pm 1,v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field ${\mathbb{F}}_p$.

Seventeen Pages. Keywords: Primitive root mod $p$; Least prime Primitive root; Arithmetic progression; Complexity theory; Finite field