An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
Number Theory
2024-08-20 v1 Discrete Mathematics
Abstract
We present an elementary proof of the generalization of the -bonacci Binet formula, a closed form calculation of the -bonacci numbers using the roots of the characteristic polynomial of the -bonacci recursion.
Cite
@article{arxiv.2208.06989,
title = {An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers},
author = {Harold R. Parks and Dean C. Wills},
journal= {arXiv preprint arXiv:2208.06989},
year = {2024}
}
Comments
4 pages