On the l.c.m. of random terms of binary recurrence sequences

DOI10.1016/j.jnt.2019.12.004zbMath1471.11038arXiv1909.04342OpenAlexW2972865391WikidataQ126324863 ScholiaQ126324863MaRDI QIDQ2182158

Carlo Sanna

Publication date: 21 May 2020

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

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

zbMATH Keywords

random sequenceLehmer sequencebinary recurrence sequencelowest common multiple

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Recurrences (11B37)

Related Items

On the l.c.m. of shifted Lucas numbers, On the least common multiple of random \(q\)-integers, On the least common multiple of shifted powers, A note on product sets of random sets, On the l.c.m. of shifted Fibonacci numbers, Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers, Membership in random ratio sets

Cites Work

• The least common multiple of random sets of positive integers
• 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)\)
• Ratio sets of random sets
• A note on product sets of random sets
• Quotient and product sets of thin subsets of the positive integers
• On the least common multiple of Lucas subsequences
• The Dilogarithm Function
• On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
• A New Formula for &#960
• Limit theorems for the least common multiple of a random set of integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item