The proof of a conjecture concerning the intersection of k-generalized Fibonacci sequences

Abstract

For k≥ 2, the k-generalized Fibonacci sequence (Fn(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 Fm(k)=Fn(), with >k>1, n>+1, m>k+1 are [(m,n,,k)=(7,6,3,2) and (12,11,7,3).] In this paper, we confirm this conjecture.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…