ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g□(p)g^{\square}(p) denote the least square-free primitive root modulo a prime pp. Least square-free primitive root conjecture. For all p>409p>409 we have

g□(p)<p−2.g^{\square}(p)<\sqrt{p}-2.

The preceding explicit bound proves only that g□(p)<p0.96g^{\square}(p)<p^{0.96} for every prime pp; 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 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.