The radical least-common-multiple conjecture for polynomial sequences

Let fZ[x]f\in\mathbb Z[x] be irreducible over Q\mathbb Q of degree d2d\ge 2, and define

f(N)=radlcm(f(1),,f(N)),\ell_f(N)=\operatorname{rad}\operatorname{lcm}(f(1),\ldots,f(N)),

where rad(n)\operatorname{rad}(n) is the product of the distinct primes dividing nn. Radical LCM conjecture. As NN\to\infty,

logf(N)(d1)NlogN.\log\ell_f(N)\sim(d-1)N\log N.

The paper proves the lower bound logf(N)2dNlogN\log\ell_f(N)\gtrsim\frac{2}{d}N\log N. The conjecture asserts that the radical of the least common multiple has the same leading asymptotic as the least common multiple itself, but this remains open.

Sources & referencesView supporting material

Primary source

Ashwin Sah, “An improved bound on the least common multiple of polynomial sequences”, arXiv:1911.00168 (2019).

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.