Conjecture on the least stationary primitive root modulo p
Statement
Let be a prime, and let denote the least stationary primitive root in . Let be a small number. Least stationary primitive root conjecture. The least stationary primitive root satisfies
as . The preceding result gives the weaker bound , while the least stationary primitive root is bounded above by the least primitive root modulo ; the conjectured logarithmic bound would substantially improve the available estimates.
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.