  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.

Number Theory;Discrete Mathematics