The smallest primitive root modulo a prime

2018/03/27 by Pretorius, Jana
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1803.11061

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òlya--Vinogradov and Burgess inequalities, and use them to prove that the smallest primitive root is smaller than p^0.68 for all primes p.

Related

• Topics In Primitive Roots
• The least primitive root modulo p²
• The Least Square-free Primitive Root Modulo a Prime
• Least Prime Primitive Roots
• Explicit upper bounds on the least primitive root