8

$\newcommand{\lcm}{\operatorname{lcm}}$There is a nice property of Fibonacci numbers which says that:

$$\gcd(F_{a_1}, \ldots, F_{a_n}) = F_{\gcd(a_1, \ldots, a_n)}$$

I am curious is there anything similar with respect to $\lcm$?

Clearly $\lcm(F_{a_1}, \ldots, F_{a_n}) = F_{\lcm(a_1,\ldots, a_n)}$ is not true, but is there anything better then to use $\lcm(a, b) = \frac{ab}{\gcd(a, b)}$ and to use associative law of $\lcm$?

1 Answers1

2

The problem is already studied here (see Corollary 3.4). It is shown that the least common multiple of two Fibonacci numbers is a Fibonacci number if and only if one of them divides the other.