English

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

Number Theory 2021-08-10 v1 Probability

Abstract

Let (Ln)n1(L_n)_{n \geq 1} be the sequence of Lucas numbers, defined recursively by L1:=1L_1 := 1, L2:=3L_2 := 3, and Ln+2:=Ln+1+LnL_{n + 2} := L_{n + 1} + L_n, for every integer n1n \geq 1. We determine the asymptotic behavior of loglcm(L1+s1,L2+s2,,Ln+sn)\log \operatorname{lcm} (L_1 + s_1, L_2 + s_2, \dots, L_n + s_n) as n+n \to +\infty, for (sn)n1(s_n)_{n \geq 1} a periodic sequence in {1,+1}\{-1, +1\}. We also carry out the same analysis for (sn)n1(s_n)_{n \geq 1} a sequence of independent and uniformly distributed random variables in {1,+1}\{-1, +1\}. These results are Lucas numbers-analogs of previous results obtained by the author for the sequence of Fibonacci numbers.

Keywords

Cite

@article{arxiv.2108.03628,
  title  = {On the l.c.m. of shifted Lucas numbers},
  author = {Carlo Sanna},
  journal= {arXiv preprint arXiv:2108.03628},
  year   = {2021}
}