English

Explicit upper bounds on the least primitive root

Number Theory 2019-04-30 v1

Abstract

We give a method for producing explicit bounds on g(p)g(p), the least primitive root modulo pp. Using our method we show that g(p)<2r2rω(p1)p14+14rg(p)<2r\,2^{r\omega(p-1)}\,p^{\frac{1}{4}+\frac{1}{4r}} for p>1056p>10^{56} where r2r\geq 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 pp. For example, our method also allows us to show that g(p)<p5/8g(p)<p^{5/8} for all p1022p\geq 10^{22} and g(p)<p1/2g(p)<p^{1/2} for p1056p\geq 10^{56}.

Keywords

Cite

@article{arxiv.1904.12373,
  title  = {Explicit upper bounds on the least primitive root},
  author = {Kevin J. McGown and Tim Trudgian},
  journal= {arXiv preprint arXiv:1904.12373},
  year   = {2019}
}
R2 v1 2026-06-23T08:51:40.309Z