ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.