The smallest primitive root modulo a prime
In this paper we will consider new bounds on the smallest primitive root modulo a prime. We will make more judicious use of the P\`olya--Vinogradov and Burgess inequalities, and use them to prove that the smallest primitive root is smaller than $p^{0.68}$ for all primes $p$.