Asymptotic behavior of the least common multiple of consecutive reducible quadratic progression terms

2014/06/24 by Guoyou Qian, Qian, Guoyou, Shaofang Hong +1
Mathematics · #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1406.6123

13 pages

arxiv created 2014/06/24 · arxiv updated 2014/06/25

Abstract

Let l and m be two integers with l>m≥ 0, and let f(x) be the product of two linear polynomials with integer coefficients. In this paper, we show that log \rm lcm_{mn<i≤ ln}\f(i)\=An+o(n), where A is a constant depending only on l, m and f.

Related

• The least common multiple of consecutive quadratic progression terms
• The Least Common Multiple of a Bivariate Quadratic Sequence
• On the error term of the logarithm of the lcm of a quadratic sequence
• Nontrivial upper bounds for the least common multiple of an arithmetic progression
• Nontrivial effective lower bounds for the least common multiple of a q-arithmetic progression