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

08/15/2022
by   Harold R. Parks, et al.
0

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

page 1

page 2

page 3

page 4

research
08/02/2022

Sums of k-bonacci Numbers

We give a combinatorial proof of a formula giving the partial sums of th...
research
05/18/2022

Kac-Rice formula: A contemporary overview of the main results and applications

The book develops the fundamental ideas of the famous Kac-Rice formula f...
research
08/09/2020

Representative elementary volume via averaged scalar Minkowski functionals

Representative Elementary Volume (REV) at which the material properties ...
research
09/05/2018

An Elementary Proof of a Classical Information-Theoretic Formula

A renowned information-theoretic formula by Shannon expresses the mutual...
research
10/29/2018

An Optimal Construction for the Barthelmann-Schwentick Normal Form on Classes of Structures of Bounded Degree

Building on the locality conditions for first-order logic by Hanf and Ga...
research
04/06/2022

The Challenge of Sixfold Integrals: The Closed-Form Evaluation of Newton Potentials between Two Cubes

The challenge of explicitly evaluating, in elementary closed form, the w...
research
09/24/2019

Completely uniformly distributed sequences based on de Bruijn sequences

We study a construction published by Donald Knuth in 1965 yielding a com...

Please sign up or login with your details

Forgot password? Click here to reset