2000 character limit reached
An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers (2208.06989v1)
Published 15 Aug 2022 in math.NT and cs.DM
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.