Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 8 Aug 2021 in math.NT and math.PR | (2108.03628v1)

Abstract: Let $(L_n){n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1 + s_1, L_2 + s_2, \dots, L_n + s_n)$ as $n \to +\infty$, for $(s_n){n \geq 1}$ a periodic sequence in ${-1, +1}$. We also carry out the same analysis for $(s_n){n \geq 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.