On Pell numbers representable as product of two generalized Fibonacci numbers
Jhon J. Bravo, Pranabesh Das, Jose L. Herrera, and John C. Saunders

TL;DR
This paper characterizes all Pell numbers that can be expressed as the product of two generalized Fibonacci numbers, extending previous results on Fibonacci and Pell sequence intersections.
Contribution
It provides a complete classification of Pell numbers that are products of two k-Fibonacci numbers, generalizing earlier specific cases.
Findings
Identifies all Pell numbers as products of two k-Fibonacci numbers.
Uses advanced number theory techniques including bounds for linear forms in logarithms.
Generalizes previous results on Fibonacci and Pell sequence intersections.
Abstract
A generalization of the well-known Fibonacci sequence is the -Fibonacci sequence with some fixed integer . The first terms of this sequence are , and each term afterwards is the sum of the preceding terms. In this paper, we find all Pell numbers that can be written as a product of two -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 Peth\H{o} 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 -Fibonacci…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Combinatorial Mathematics · semigroups and automata theory
