On the l.c.m. of shifted Lucas numbers
From MaRDI portal
Publication:2166104
DOI10.1016/j.indag.2022.04.006zbMath1498.11058arXiv2108.03628OpenAlexW3192582264MaRDI QIDQ2166104
Publication date: 23 August 2022
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.03628
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The least common multiple of random sets of positive integers
- Plus petit commun multiple des termes consécutifs d'une suite récurrente linéaire. (Least common multiple of consecutive terms of a linear recurrent sequence)
- Lehmer numbers and an asymptotic formula for \(\pi\)
- An asymptotic formula for \(\pi\)
- A new type of inclusion exclusion principle for sequences and asymptotic formulas for \(\zeta(k)\)
- On the l.c.m. of random terms of binary recurrence sequences
- On the least common multiple of random \(q\)-integers
- On the least common multiple of Lucas subsequences
- On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
- A New Formula for π
- On the least common multiple of shifted powers
- On the l.c.m. of shifted Fibonacci numbers
- Practical numbers in Lucas sequences
- Limit theorems for the least common multiple of a random set of integers
This page was built for publication: On the l.c.m. of shifted Lucas numbers