Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms
From MaRDI portal
Publication:1949401
DOI10.1007/s00013-013-0510-7zbMath1290.11014arXiv1204.5415OpenAlexW2061130559MaRDI QIDQ1949401
Publication date: 7 May 2013
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.5415
Asymptotic results on arithmetic functions (11N37) Arithmetic progressions (11B25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (5)
The least common multiple of consecutive terms in a cubic progression ⋮ Newton representation of functions over natural integers having integral difference ratios ⋮ Integral Difference Ratio Functions on Integers ⋮ Uniform lower bound for the least common multiple of a polynomial sequence ⋮ New lower bounds for the least common multiple of polynomial sequences
Cites Work
- Unnamed Item
- On the periodicity of an arithmetical function
- Nontrivial lower bounds for the least common multiple of some finite sequences of integers
- The least common multiple of consecutive arithmetic progression terms
- THE LEAST COMMON MULTIPLE OF CONSECUTIVE TERMS IN A QUADRATIC PROGRESSION
- New results on the least common multiple of consecutive integers
- On Chebyshev-Type Inequalities for Primes
- A Limit Involving Least Common Multiples: 10797
- On the Product of the Primes
This page was built for publication: Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms