Improvements of lower bounds for the least common multiple of finite arithmetic progressions

DOI10.1090/S0002-9939-08-09565-8zbMath1157.11001MaRDI QIDQ3542026

YuJuan Yang, Shao-Fang Hong

Publication date: 27 November 2008

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

arithmetic progressionlower boundleast common multiple

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (8)

The least common multiple of consecutive terms in a cubic progression ⋮ Note on the lower bound of least common multiple ⋮ New lower bounds for the least common multiples of arithmetic progressions ⋮ On the periodicity of an arithmetical function ⋮ Further improvements of lower bounds for the least common multiples of arithmetic progressions ⋮ The least common multiple of consecutive arithmetic progression terms ⋮ New lower bounds for the least common multiple of polynomial sequences ⋮ New results on the least common multiple of consecutive integers

Cites Work

• What the least common multiple divides. II
• 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
• On divisibility properties of certain multinomial coefficients. II
• The primes contain arbitrarily long arithmetic progressions
• Nontrivial lower bounds for the least common multiple of some sequences of integers.
• On Chebyshev-Type Inequalities for Primes
• ASYMPTOTIC BEHAVIOR OF EIGENVALUES OF GREATEST COMMON DIVISOR MATRICES
• On the Product of the Primes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvements of lower bounds for the least common multiple of finite arithmetic progressions