The proof of a conjecture concerning the intersection of k-generalized Fibonacci sequences
Author:
Preprint
Abstract
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured that the only solutions of Diophantine equation $F_m^{(k)}=F_n^{(\ell)}$, with $\ell>k>1, n>\ell+1, m>k+1$ are [(m,n,\ell,k)=(7,6,3,2) and (12,11,7,3).] In this paper, we confirm this conjecture.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- On the intersection of two distinct $k$-generalized Fibonacci sequencesMathematica Bohemica, 2012
- On the Intersections of Fibonacci, Pell, and Lucas NumbersIntegers, 2011
- On terms of linear recurrence sequences with only one distinct block of digitsColloquium Mathematicum, 2011
- Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powersAnnals of Mathematics, 2006
- An explicit lower bound for a homogeneous rational linear form in the logarithms of algebraic numbers. IIIzvestiya: Mathematics, 2000
- A Generalization of a Theorem of Baker and DavenportThe Quarterly Journal of Mathematics, 1998
- De Moivre-Type Identities for the Tribonacci NumbersThe Fibonacci Quarterly, 1988
- The intersection of Fibonacci sequences.The Michigan Mathematical Journal, 1962