An improved bound on the least common multiple of polynomial sequences

Sah, Ashwin

Journal de théorie des nombres de Bordeaux, Tome 32 (2020) no. 3, pp. 891-899.

Cilleruelo a conjecturé que si $f\in \mathbb{Z}\left[x\right]$ de degré $d\ge 2$ est irréductible sur les rationnels, alors $log\mathrm{lcm}\left(f\right(1),...,f(N\left)\right)\sim (d-1)NlogN$ quand $N\to \infty$. Il l’a prouvé dans le cas $d=2$. Très récemment, Maynard et Rudnick ont prouvé qu’il existe $c_d>0$ tel que $log\mathrm{lcm}(f\left(1\right),...,f\left(N\right))\gtrsim c_{d}NlogN$, et ont montré qu’on peut prendre $c_d=\frac{d-1}{d^2}$. Nous donnons une preuve alternative de ce résultat avec la constante améliorée $c_d=1$. De plus, nous prouvons la minoration $log\mathrm{rad}\mathrm{lcm}(f\left(1\right),...,f\left(N\right))\gtrsim \frac{2}{d}NlogN$ et proposons une conjecture plus forte affirmant que $log\mathrm{rad}\mathrm{lcm}\left(f\right(1),...,f(N\left)\right)\sim (d-1)NlogN$ quand $N\to \infty$.

Cilleruelo conjectured that if $f\in \mathbb{Z}\left[x\right]$ of degree $d\ge 2$ is irreducible over the rationals, then $log\mathrm{lcm}\left(f\right(1),...,f(N\left)\right)\sim (d-1)NlogN$ as $N\to \infty$. He proved it for the case $d=2$. Very recently, Maynard and Rudnick proved there exists $c_d>0$ with $log\mathrm{lcm}(f\left(1\right),...,f\left(N\right))\gtrsim c_{d}NlogN$, and showed one can take $c_d=\frac{d-1}{d^2}$. We give an alternative proof of this result with the improved constant $c_d=1$. We additionally prove the bound $log\mathrm{rad}\mathrm{lcm}(f\left(1\right),...,f\left(N\right))\gtrsim \frac{2}{d}NlogN$ and make the stronger conjecture that $log\mathrm{rad}\mathrm{lcm}\left(f\right(1),...,f(N\left)\right)\sim (d-1)NlogN$ as $N\to \infty$.

Classification : 11N32
Mots clés : Least common multiple, polynomial sequence

[1] Candela, Pablo; Rué, Juanjo; Serra, Oriol Memorial to Javier Cilleruelo: a problem list, Integers, Volume 18 (2018), A28, 9 pages | MR | Zbl

[2] Cilleruelo, Javier The least common multiple of a quadratic sequence, Compos. Math., Volume 147 (2011) no. 4, pp. 1129-1150 | DOI | MR | Zbl

[3] Hong, Shaofang; Luo, Yuanyuan; Qian, Guoyou; Wang, Chunlin Uniform lower bound for the least common multiple of a polynomial sequence, C. R. Math. Acad. Sci. Paris, Volume 351 (2013) no. 21-22, pp. 781-785 | DOI | MR | Zbl

[4] Hong, Shaofang; Qian, Guoyou; Tan, Qianrong The least common multiple of a sequence of products of linear polynomials, Acta Math. Hung., Volume 135 (2012) no. 1-2, pp. 160-167 | DOI | MR | Zbl

[5] Maynard, James; Rudnick, Ze’ev A lower bound on the least common multiple of polynomial sequences (to appear in Riv. Mat. Univ. Parma)

[6] Nagel, Trygve Généralisation d’un théorème de Tchebycheff, Journ. de Math., Volume 8 (1921) no. 4, pp. 343-356 | Zbl

[7] Rudnick, Ze’ev; Zehavi, Sa’ar On Cilleruelo’s conjecture for the least common multiple of polynomial sequences (2019) (https://arxiv.org/abs/1902.01102)