×

Nontrivial lower bounds for the least common multiple of some finite sequences of integers. (English) Zbl 1124.11005

Given a finite sequence of nonzero integers \(u_0,\dots,u_n\), the author gives effective bounds for their least common multiple. For example, Theorem 3 shows that if \(u_0,\dots,u_n\) is a strictly increasing arithmetic progression of nonzero integers, then for any non-negative integer \(n\), \(\text{lcm}\{u_0,\dots,u_n\}\) is a multiple of the rational number \({{u_0u_1\ldots u_n}\over {n!(\text{gcd}\{u_0,u_1\})^n}}\). The author also shows that this lower bound is optimal in some cases. When \(u_0\) and the difference of the progression \(r\) are coprime he shows that this number is \(\geq u_0(r+1)^{n-1}\). He also gives lower bounds for the case when \((u_n)_{n}\) is a quadratic sequence; i.e., is the set of the consecutive values of a quadratic polynomial. For example, he shows that \(\text{lcm}\{1^2+1,2^2+1,\dots,n^2+1\}\geq .32(1.442)^n\). The proofs are elementary.
Reviewer’s remark. An asymptotic formula for \(\log \text{lcm}\{u_0,\dots,u_n\}\) when \(u_0,\dots,u_n\) is an arithmetic progression is due to [P. Bateman, A limit involving least common multiples, Am. Math. Mon. 109, 393–394 (2002; Zbl 1124.11300)]. For the case of quadratic irreducible polynomials \(f(X)\in {\mathbb Z}[X]\), J. Cilleruelo has recently shown that \(\log \text{lcm}\{f(1),\dots,f(n)\}\sim n\log n\) as \(n\) tends to infinity. When \(f(X)=X^2+1\), he showed that the next term of the asymptotic expansion is \(Bn+o(n)\) and computed the constant \(B\). According to these results, the author’s lower bounds are ‘effective’ but of a much smaller order than the actual size of these numbers.

MSC:

11A05 Multiplicative structure; Euclidean algorithm; greatest common divisors
11B83 Special sequences and polynomials

Citations:

Zbl 1124.11300
PDFBibTeX XMLCite
Full Text: DOI arXiv

Online Encyclopedia of Integer Sequences:

a(n) = lcm(f(1),f(2),...,f(n)) with f(x) = x^2+1.

References:

[1] Hanson, D., On the product of the primes, Canad. Math. Bull., 15, 33-37 (1972) · Zbl 0231.10008
[2] Hardy, G. H.; Wright, E. M., The Theory of Numbers (1979), Oxford Univ. Press: Oxford Univ. Press London · Zbl 0423.10001
[3] Nair, M., On Chebyshev-type inequalities for primes, Amer. Math. Monthly, 89, 2, 126-129 (1982) · Zbl 0494.10004
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.