arXiv · 1803.11061
The smallest primitive root modulo a prime
Abstract
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$.
Explore related subjects
Keep this discovery
Jana Pretorius. 2018-03-27. The smallest primitive root modulo a prime. https://arxiv.org/abs/1803.11061
Cite the original work for its findings. Save a collection to share your selection of sources.