ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(X)∈Z[X]f(X)\in\mathbb{Z}[X] be a separable polynomial of degree g≥1g\geq 1, and suppose that gcd⁡{f(n):n∈Z}\gcd\{f(n):n\in\mathbb{Z}\} is square-free. For N≥1N\geq 1, define

δf(N)=∣{a(modN):f(a)≡0(modN)}∣.\delta_f(N)=\left|\{a\pmod N:f(a)\equiv 0\pmod N\}\right|.

Square-free values asymptotic conjecture. There is a positive constant

Cf=∏p(1−δf(p2)p2)C_f=\prod_p\left(1-\frac{\delta_f(p^2)}{p^2}\right)

such that

∣{1≤n≤X:f(n) is square-free}∣∼CfXas X⟶∞.\left|\{1\leq n\leq X:f(n)\text{ is square-free}\}\right|\sim C_fX\quad\text{as }X\longrightarrow\infty.

In particular, infinitely many values of f(n)f(n) are square-free, and a positive proportion are square-free. The conjecture is known for degrees at most 33 and, conditionally, in broader settings under the abc conjecture; degree at least 44 remains unresolved in general.

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.