2008/11/28 by Shaofang Hong, Hong, Shaofang, Scott D. Kominers +1
Mathematics · #11A05 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11A05
paper · pdf · doi:10.48550/arxiv.0811.4769
5 pages; v3: improved results and updated references
arxiv created 2009/06/16 · arxiv updated 2009/12/01
For relatively prime positive integers u0 and r, we consider the arithmetic progression uk := u0+k*r (0 <= k <= n). Define Ln := lcmu0,u1,...,un and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >= a and n >= 2*alpha*r, we have Ln >= u0*ralpha+a-2*(r+1)n. In particular, letting a = 2 yields an improvement to the best previous lower bound on Ln (obtained by Hong and Yang) for all but three choices of alpha,r >= 2.