On the least common multiple of binary linear recurrence sequences
From MaRDI portal
Publication:2135965
DOI10.1216/RMJ.2021.51.1583zbMath1487.11004arXiv2011.03858OpenAlexW3103913058MaRDI QIDQ2135965
Publication date: 10 May 2022
Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.03858
Binomial coefficients; factorials; (q)-identities (11B65) Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Cites Work
- Uniform lower bound for the least common multiple of a polynomial sequence
- Identities and estimations involving the least common multiple of strong divisibility sequences
- Lehmer numbers and an asymptotic formula for \(\pi\)
- Nontrivial lower bounds for the least common multiple of some finite sequences of integers
- An asymptotic formula for \(\pi\)
- On the least common multiple of Lucas subsequences
- The power of a prime that divides a generalized binomial coefficient.
- On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
- On Chebyshev-Type Inequalities for Primes
- My Numbers, My Friends
- A New Formula for π
- Nontrivial effective lower bounds for the least common multiple of some quadratic sequences
- Nontrivial upper bounds for the least common multiple of an arithmetic progression
- The least common multiple of a quadratic sequence
- A Limit Involving Least Common Multiples: 10797
- On the Product of the Primes
- A sharpening of the bounds for linear forms in logarithms II
- Nontrivial effective lower bounds for the least common multiple of a $q$-arithmetic progression
This page was built for publication: On the least common multiple of binary linear recurrence sequences
