The smallest primitive root modulo a prime

Published 27 Mar 2018 in math.NT | (1803.11061v1)

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$.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Jana Pretorius

Collections

Sign up for free to add this paper to one or more collections.