A lower bound on the least common multiple of polynomial sequences

From MaRDI portal
(Redirected from Publication:5011870)



Abstract: Let f be a polynomial f of degree dge2 with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the values of the polynomial at the first N integers satisfies loglcm(f(1),dots,f(N))sim(d−1)NlogN as Noinfty. This is only known for degree d=2. In this note we give a simple lower bound for all degrees dgeq2 which is consistent with the conjecture: loglcm(f(1),dots,f(N))ggNlogN.












This page was built for publication: A lower bound on the least common multiple of polynomial sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011870)