Note on the lower bound of least common multiple
From MaRDI portal
Publication:1949436
DOI10.1155/2013/218125zbMath1267.11004WikidataQ58915591 ScholiaQ58915591MaRDI QIDQ1949436
Publication date: 8 May 2013
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/218125
11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors
Related Items
Nontrivial upper bounds for the least common multiple of an arithmetic progression, Nontrivial effective lower bounds for the least common multiple of some quadratic sequences, Uniform lower bound for the least common multiple of a polynomial sequence, New lower bounds for the least common multiple of polynomial sequences, The least common multiple of consecutive terms in a cubic progression
Cites Work
- 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
- The primes contain arbitrarily long arithmetic progressions
- Nontrivial lower bounds for the least common multiple of some sequences of integers.
- The least common multiple of consecutive arithmetic progression terms
- THE LEAST COMMON MULTIPLE OF CONSECUTIVE TERMS IN A QUADRATIC PROGRESSION
- Improvements of lower bounds for the least common multiple of finite arithmetic progressions
- Further improvements of lower bounds for the least common multiples of arithmetic progressions
- New results on the least common multiple of consecutive integers
- On Chebyshev-Type Inequalities for Primes
- On the Product of the Primes
- On the Number of Primes Less Than or Equal x