On mixed b-concatenations of Fibonacci and Lucas numbers that are Lucas numbers
Abstract
Let (Fn)n0 and (Ln)n0 denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base b mixed concatenations of a Fibonacci number and a Lucas number. Mathematically, we study of two Diophantine equations Ln=bdLm+Fk and Ln=bdFm+Lk, where d is the number of digits of Fk or Lk in base b. To tackle these equations, we combine tools from Diophantine approximation on non-zero linear forms in logarithms and reduction methods based on continued fractions. This allows us to prove that only finitely many such Lucas numbers exist.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.