Primes with small primitive roots
Kevin Ford, Mikhail R. Gabdullin, Andrew Granville

TL;DR
This paper constructs a large set of primes for which the smallest primitive root is significantly smaller than the prime itself, approaching a quarter power, with the set's density approaching that of all primes.
Contribution
It explicitly defines a set of primes with small primitive roots based on simple functions of their factors, extending understanding of primitive root distribution.
Findings
The set of primes has density approaching 1 as x increases.
For primes in this set, the least primitive root is at most p^{1/4 - δ(p)}.
The set is explicitly constructed using prime factor functions.
Abstract
Let tend to zero arbitrarily slowly as . We exhibit an explicit set of primes , defined in terms of simple functions of the prime factors of , for which the least primitive root of is for all , where as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and Theory of Mathematics · Analytic Number Theory Research · Mathematics and Applications
