On the l.c.m. of shifted Fibonacci numbers

DOI10.1142/S1793042121500743zbMath1484.11060arXiv2007.13330OpenAlexW3157829338WikidataQ114071932 ScholiaQ114071932MaRDI QIDQ5155869

Carlo Sanna

Publication date: 8 October 2021

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.13330

zbMATH Keywords

randomasymptotic formulaleast common multipleFibonacci number

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

On the l.c.m. of shifted Lucas numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The least common multiple of random sets of positive integers
• Lehmer numbers and an asymptotic formula for \(\pi\)
• Fibonacci numbers at most one away from a perfect power
• 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 &#960
• 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 Fibonacci numbers