New lower bounds for the least common multiples of arithmetic progressions

From MaRDI portal
Publication:2448447



Abstract: For relatively prime positive integers u0 and r and for 0leklen, define uk:=u0+kr. Let Ln:=mlcm(u0,u1,...,un) and let a,lge2 be any integers. In this paper, we show that, for integers alphageqa and rgeqmax(a,l−1) and ngeqlalphar, we have L_ngeq u_0r^{(l-1)alpha +a-l}(r+1)^n. Particularly, letting l=3 yields an improvement to the best previous lower bound on Ln obtained by Hong and Kominers.












This page was built for publication: New lower bounds for the least common multiples of arithmetic progressions

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