English

Least primitive root and simultaneous power-non residues

Number Theory 2018-01-23 v2

Abstract

Let pp be a prime and let g(p)g(p) be the least primitive root modulo pp. We prove that for any ϵ>0\epsilon>0 and pp large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime pp such that p1p-1 does not have small prime factors, but 22. We also give an explicit description of the exceptional set.

Keywords

Cite

@article{arxiv.1801.06110,
  title  = {Least primitive root and simultaneous power-non residues},
  author = {Andrea Sartori},
  journal= {arXiv preprint arXiv:1801.06110},
  year   = {2018}
}

Comments

Extended Theorem 1.3 and more details added throughout the work

R2 v1 2026-06-22T23:49:00.060Z