Results 111 to 120 of about 2,057 (213)

Determinants of Toeplitz–Hessenberg Matrices with Generalized Leonardo Number Entries

open access: yesAnnales Mathematicae Silesianae
Let un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers.
Goy Taras, Shattuck Mark
doaj   +1 more source

Fibonacci Sums Modulo 5

open access: yesAnnales Mathematicae Silesianae
We develop closed form expressions for various finite binomial Fibonacci and Lucas sums depending on the modulo 5 nature of the upper summation limit. Our expressions are inferred from some trigonometric identities.
Adegoke Kunle   +2 more
doaj   +1 more source

The role of spreadsheets in an investigation of Fibonacci Numbers

open access: yesSpreadsheets in Education, 2014
We introduce a function Z(k) which measures the number of distinct ways in which a number can be expressed as the sum of Fibonacci numbers. Using a binary table and other devices, we explore the values that Z(k) can take and reveal a surprising ...
John E Baker, Steve Sugden
doaj  

Home - About - Disclaimer - Privacy