An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Parks, Harold R., Wills, Dean C.
Formato: Preprint
Publicado: 2022
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910570324688896
author Parks, Harold R.
Wills, Dean C.
author_facet Parks, Harold R.
Wills, Dean C.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2208_06989
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
Parks, Harold R.
Wills, Dean C.
Number Theory
Discrete Mathematics
15A15, 11B39
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.
title An Elementary Proof of the Generalization of the Binet Formula for $k$-bonacci Numbers
topic Number Theory
Discrete Mathematics
15A15, 11B39
url https://arxiv.org/abs/2208.06989