On the l.c.m. of shifted Fibonacci numbers
Abstract
Let (Fn)n ≥ 1 be the sequence of Fibonacci numbers. Guy and Matiyasevich proved that equation* lcm (F1, F2, …, Fn) 3 απ2 · n2 as n +∞, equation* where lcm is the least common multiple and α := (1 + 5) / 2 is the golden ratio. We prove that for every periodic sequence s = (sn)n ≥ 1 in \-1,+1\ there exists an effectively computable rational number Cs > 0 such that equation* lcm (F3 + s3, F4 + s4, …, Fn + sn) 3 απ2 · Cs · n2 , as n +∞ . equation* Moreover, we show that if (sn)n ≥ 1 is a sequence of independent uniformly distributed random variables in \-1,+1\ then equation* E[ lcm (F3 + s3, F4 + s4, …, Fn + sn)] 3 απ2 · 15 Li2(1 / 16)2 · n2 , as n +∞ , equation* where Li2 is the dilogarithm function.
0