Nontrivial upper bounds for the least common multiple of an arithmetic progression
From MaRDI portal
Publication:5164663
DOI10.1142/S1793557121501382zbMath1479.11006arXiv2004.07335OpenAlexW3092328718MaRDI QIDQ5164663
Publication date: 12 November 2021
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.07335
Arithmetic progressions (11B25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (1)
Cites Work
- Uniform lower bound for the least common multiple of a polynomial sequence
- New lower bounds for the least common multiple of polynomial sequences
- Explicit bounds for primes in arithmetic progressions
- Identities and estimations involving the least common multiple of strong divisibility sequences
- 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
- Note on the lower bound of least common multiple
- Nontrivial lower bounds for the least common multiple of some sequences of integers.
- Approximate formulas for some functions of prime numbers
- Asymptotic Improvements of Lower Bounds for the Least Common Multiples of Arithmetic Progressions
- Further improvements of lower bounds for the least common multiples of arithmetic progressions
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- On Chebyshev-Type Inequalities for Primes
- A New Formula for π
- The least common multiple of a quadratic sequence
- A Limit Involving Least Common Multiples: 10797
- On the Product of the Primes
This page was built for publication: Nontrivial upper bounds for the least common multiple of an arithmetic progression
