The smallest primitive root modulo a prime
Number Theory
2018-03-30 v1
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 for all primes .
Cite
@article{arxiv.1803.11061,
title = {The smallest primitive root modulo a prime},
author = {Jana Pretorius},
journal= {arXiv preprint arXiv:1803.11061},
year = {2018}
}
Comments
8 pages