On Concatenations of Fibonacci and Lucas Numbers

Abstract

Let (F-n)(n >= 0) and (L-n)(n >= 0) be the Fibonacci and Lucas sequences. In this paper we determine all Fibonacci and Lucas numbers which are concatenations of two terms of the other sequence. This problem is identical to solve the Diophantine equations F-n = 10(d) L-m + L-k and L-n = 10(d) F-m + F-k in non-negative integers (n, m, k), where d denotes the number of digits of L-k and F-k, respectively. We use lower bounds for linear forms in logarithms and reduction method in Diophantine approximation to get the results.