On concatenations of Fibonacci and Lucas numbers (Q2081669)

Let \( (F_n)_{n\ge 0} \) and \( (L_n)_{n\ge 0} \) be the usual Fibonacci and Lucas sequences defined respectively by the linear recurrence relations: \( F_0=0 \), \( F_1=1 \), \( F_{n+2}=F_{n+1}+F_n \) and \( L_0=2 \), \( L_1=1 \), \( L_{n+2}=L_{n+1}+L_n \) for all \( n\ge 0 \). It is well-known that the Lucas sequence is a companion sequence of the Fibonacci sequence. In the paper under review, the authors investigate all Fibonacci numbers which are concatenations of two Lucas numbers as well as all Lucas numbers which are concatenations of two Fibonacci numbers. In other words they solve the Diophantine equations \begin{align*} F_n=10^{d}L_m+L_k\text{ and }L_n=10^{d}F_m+F_k, \end{align*} in nonnegative integers \( (n,m,k) \), where \( d \) denotes the number of digits of \( L_k \) and \( F_k \), respectively. Their main results are the following. Theorem 1. \(13\), \(21\), and \(34\) are the only Fibonacci numbers which are concatenations of two Lucas numbers. Theorem 2. \(1\), \(2\), \(3\), \(11\), \(18\), and \(521\) are the only Lucas numbers which are concatenations of two Fibonacci numbers. The proofs of Theorem 1 and Theorem 2 follow from a clever combination of techniques in Diophantine number theory, the usual properties of Fibonacci and Lucas sequences, Baker's theory of nonzero linear forms in logarithms of algebraic numbers, as well as reduction techniques involving the theory of continued fractions. All computations are done with the aid of a computer program in \texttt{Maple}.