The square-free values asymptotic conjecture for separable polynomials

Let f(X)Z[X]f(X)\in\mathbb{Z}[X] be a separable polynomial of degree g1g\geq 1, and suppose that gcd{f(n):nZ}\gcd\{f(n):n\in\mathbb{Z}\} is square-free. For N1N\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

{1nX: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.

Sources & referencesView supporting material

Primary source

Prem Prakash Pandey, “Square-free values of polynomials”, arXiv:2303.06610 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.