Fibonacci or Lucas numbers that are products of two Lucas numbers or two Fibonacci numbers
Abstract
This contribution presents all possible solutions to the Diophantine equations Fk=LmLn and Lk=FmFn. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two arbitrary Fibonacci numbers are determined herein. The results under consideration are proven by using Dujella-Peth\"o lemma in coordination with Matveev's theorem. All common terms of the Fibonacci and Lucas numbers are determined. Further, the Lucas-square Fibonacci and Fibonacci-square Lucas numbers are given.
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.