An Elementary Proof of the Generalization of the Binet Formula for k-bonacci Numbers
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.
READ FULL TEXT