On the l.c.m. of shifted Lucas numbers
Abstract
Let (Ln)n ≥ 1 be the sequence of Lucas numbers, defined recursively by L1 := 1, L2 := 3, and Ln + 2 := Ln + 1 + Ln, for every integer n ≥ 1. We determine the asymptotic behavior of lcm (L1 + s1, L2 + s2, …, Ln + sn) as n +∞, for (sn)n ≥ 1 a periodic sequence in \-1, +1\. We also carry out the same analysis for (sn)n ≥ 1 a sequence of independent and uniformly distributed random variables in \-1, +1\. These results are Lucas numbers-analogs of previous results obtained by the author for the sequence of Fibonacci numbers.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.