Cilleruelo's LCM growth conjecture for irreducible polynomial sequences

From papers

Let fZ[X]f\in\mathbb Z[X] be an irreducible polynomial with degree degf2\deg f\geq 2, and define

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

Cilleruelo's conjecture. As NN\to\infty,

logLf(N)(degf1)NlogN.\log L_f(N)\sim (\deg f-1)N\log N.

This conjecture predicts that the least common multiple of the first NN values of an irreducible polynomial of degree at least two grows faster than linearly. It is known for degree 22, while the general case remains open; the paper proves the lower bound logLf(N)NlogN\log L_f(N)\gg N\log N for all degrees degf2\deg f\geq 2.

Progress summary

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

Sources & referencesView supporting material

Primary source

James Maynard and Zeev Rudnick, “A lower bound on the LCM of polynomial sequences”, arXiv:1910.13218 (2020).

Solutions 0

No solutions have been posted yet.