On Pell numbers representable as product of two generalized Fibonacci numbers
Abstract
A generalization of the well-known Fibonacci sequence is the k-Fibonacci sequence with some fixed integer k 2. The first k terms of this sequence are 0,0, …, 1, and each term afterwards is the sum of the preceding k terms. In this paper, we find all Pell numbers that can be written as a product of two k-Fibonacci numbers. The proof of our main theorem uses lower bounds for linear forms in logarithms, properties of continued fractions, and a variation of a result of Dujella and Petho in Diophantine approximation. This work generalizes a prior result of Alekseyev which dealt with determining the intersection of the Fibonacci and Pell sequences, a work of Ddamulira, Luca and Rakotomalala who searched for Pell numbers which are products of two Fibonacci numbers, and a result of Bravo, G\'omez, and Herrera, who found all Pell numbers appearing in the k-Fibonacci sequence.
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.