2000 character limit reached
An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
Published 15 Aug 2022 in math.NT and cs.DM | (2208.06989v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.