← All problems

Vinogradov's conjecture on the least primitive root

8 years old · traced to

Let pp be a prime, and let g(p)g(p) denote the least primitive root modulo pp, equivalently the smallest generator of the multiplicative group of integers modulo pp.

Vinogradov's conjecture. For every ϵ>0\epsilon>0, for all sufficiently large primes pp, one has

g(p)≪pϵ.g(p)\ll p^{\epsilon}.

This conjecture predicts that the least primitive root grows more slowly than every positive power of pp. The supplied text does not state whether it has been resolved.

References
  1. Andrea Sartori, “Least primitive root and simultaneous power-non residues”, arXiv:1801.06110 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.