Cilleruelo's 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

Lf(N)=lcm{f(n):1nN},L_f(N)=\operatorname{lcm}\{f(n):1\le n\le N\},

ignoring zero values and taking the least common multiple of an empty set to be 11. Cilleruelo's conjecture. As NN\to\infty,

logLf(N)(d1)NlogN.\log L_f(N)\sim(d-1)N\log N.

Cilleruelo proved the conjecture when d=2d=2. The paper gives the lower bound logLf(N)NlogN\log L_f(N)\gtrsim N\log N, while the conjectured asymptotic remains open for general degree d2d\ge 2.

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.