Further improvements of lower bounds for the least common multiples of arithmetic progressions
From MaRDI portal
Publication:3550554
DOI10.1090/S0002-9939-09-10083-7zbMATH Open1196.11007arXiv0811.4769OpenAlexW2092160372MaRDI QIDQ3550554FDOQ3550554
Scott Duke Kominers, Shaofang Hong
Publication date: 31 March 2010
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Abstract: For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} 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 L_n >= u_0*r^{alpha+a-2}*(r+1)^n. In particular, letting a = 2 yields an improvement to the best previous lower bound on L_n (obtained by Hong and Yang) for all but three choices of alpha,r >= 2.
Full work available at URL: https://arxiv.org/abs/0811.4769
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Arithmetic progressions (11B25)
Cites Work
- On Chebyshev-Type Inequalities for Primes
- Nontrivial lower bounds for the least common multiple of some sequences of integers.
- New results on the least common multiple of consecutive integers
- A Limit Involving Least Common Multiples: 10797
- On the Product of the Primes
- Lower bounds for the least common multiple of finite arithmetic progressions
- Nontrivial lower bounds for the least common multiple of some finite sequences of integers
- Improvements of lower bounds for the least common multiple of finite arithmetic progressions
- On the periodicity of an arithmetical function
Cited In (10)
- Lower bounds for the least common multiple of finite arithmetic progressions
- 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
- Note on the lower bound of least common multiple
- New lower bounds for the least common multiples of arithmetic progressions
- The least common multiple of consecutive arithmetic progression terms
- Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
- The exact upper bound for the sum of reciprocals of least common multiples
- Uniform lower bound for the least common multiple of a polynomial sequence
- New lower bounds for the least common multiple of polynomial sequences
Recommendations
- New lower bounds for the least common multiples of arithmetic progressions 👍 👎
- Improvements of lower bounds for the least common multiple of finite arithmetic progressions 👍 👎
- Asymptotic improvements of lower bounds for the least common multiples of arithmetic pro\-gressions 👍 👎
- Nontrivial lower bounds for the least common multiple of some sequences of integers. 👍 👎
- Nontrivial upper bounds for the least common multiple of an arithmetic progression 👍 👎
This page was built for publication: Further improvements of 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 Q3550554)
