Explicit upper bounds on the least primitive root
Abstract
We give a method for producing explicit bounds on g(p), the least primitive root modulo p. Using our method we show that g(p)<2r\,2rω(p-1)\,p14+14r for p>1056 where r≥ 2 is an integer parameter. This result beats existing bounds that rely on explicit versions of the Burgess inequality. Our main result allows one to derive bounds of differing shapes for various ranges of p. For example, our method also allows us to show that g(p)<p5/8 for all p≥ 1022 and g(p)<p1/2 for p≥ 1056.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.