The least common multiple of a sequence of products of linear polynomials. (English) Zbl 1265.11093

Let \(f(x)\) be the product of linear polynomials with integer coefficients. Extending several earlier results, the authors prove that \(\log\text{lcm}(f(1),\dots,f(n))\sim An\) as \(n\to\infty\), where \(A\) is a constant depending only on \(f\).


11N37 Asymptotic results on arithmetic functions
11A05 Multiplicative structure; Euclidean algorithm; greatest common divisors
11B25 Arithmetic progressions
Full Text: DOI arXiv


[1] P. Bateman, J. Kalb and A. Stenger, A limit involving least common multiples, Amer. Math. Monthly, 109 (2002), 393–394. · Zbl 1124.11300
[2] P. L. Chebyshev, Memoire sur les nombres premiers, J. Math. Pures Appl., 17 (1852), 366–390.
[3] B. Farhi, Nontrivial lower bounds for the least common multiple of some finite sequences of integers, J. Number Theory, 125 (2007), 393–411. · Zbl 1124.11005
[4] B. Farhi and D. Kane, New results on the least common multiple of consecutive integers, Proc. Amer. Math. Soc., 137 (2009), 1933–1939. · Zbl 1229.11007
[5] H. Davenport, Multiplicative Number Theory, 2nd ed., Springer-Verlag (New York, 1980). · Zbl 0453.10002
[6] D. Hanson, On the product of the primes, Canad. Math. Bull., 15 (1972), 33–37. · Zbl 0231.10008
[7] S. Hong and G. Qian, The least common multiple of consecutive arithmetic progression terms, Proc. Edinburgh Math. Soc., 54 (2011), 431–441. · Zbl 1304.11008
[8] S. Hong and Y. Yang, On the periodicity of an arithmetical function, C.R. Acad. Sci. Paris, Ser. I, 346 (2008), 717–721. · Zbl 1213.11014
[9] M. Nair, On Chebyshev-type inequalities for primes, Amer. Math. Monthly, 89 (1982), 126–129. · Zbl 0494.10004
[10] A. Selberg, An elementary proof of the prime-number theorem for arithmetic progressions, Canad. J. Math., 2 (1950), 66–78. · Zbl 0036.30605
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.