The least square-free primitive root bound beyond 409
Statement
Let denote the least square-free primitive root modulo a prime . Least square-free primitive root conjecture. For all we have
The preceding explicit bound proves only that for every prime ; this conjecture proposes a substantially stronger square-root-scale bound, motivated by computational evidence and related work.
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.