ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f∈Z[x]f\in\mathbb Z[x] be a polynomial with no repeated factor. Assume that for every prime pp there is an integer npn_p such that p2p^2 does not divide f(np)f(n_p). Let ρf(d)\rho_f(d) denote the number of invertible residue classes xx modulo dd satisfying f(x)≡0(modd)f(x)\equiv 0\pmod d, and let Pf,2(x)\mathcal P_{f,2}(x) be the set of primes p≤xp\leq x for which f(p)f(p) is square-free. Write π(x)\pi(x) for the number of primes at most xx.

Square-free values density conjecture. As x→∞x\to\infty,

∣Pf,2(x)∣∼cf,2π(x),|\mathcal P_{f,2}(x)|\sim c_{f,2}\pi(x),

where the positive density is

cf,2=∏p(1−ρf(p2)p2−p).c_{f,2}=\prod_p\left(1-\frac{\rho_f(p^2)}{p^2-p}\right).

This refines the assertion that infinitely many square-free values occur at primes by predicting their natural density. The source presents it as conjectural; the supplied text gives no resolution for the full statement.

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.