An Elementary Proof of the Generalization of the Binet Formula for k-bonacci Numbers
Abstract
We present an elementary proof of the generalization of the k-bonacci Binet formula, a closed form calculation of the k-bonacci numbers using the roots of the characteristic polynomial of the k-bonacci recursion.
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.