Vinogradov's conjecture on the least primitive root
Statement
Let be a prime, and let denote the least primitive root modulo , equivalently the smallest generator of the multiplicative group of integers modulo .
Vinogradov's conjecture. For every , for all sufficiently large primes , one has
This conjecture predicts that the least primitive root grows more slowly than every positive power of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.