arXiv · 2208.06989
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.
Explore related subjects
Keep this discovery
Harold R. Parks, Dean C. Wills. 2022-08-15. An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers. https://doi.org/10.4171/em%2F502
Cite the original work for its findings. Save a collection to share your selection of sources.