DM
1999
13 years 4 months ago
1999
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...
CG
2004
Springer
13 years 4 months ago
2004
Springer
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
DM
2008
13 years 4 months ago
2008
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...
LCC
1994
13 years 9 months ago
1994
We demonstrate program extraction by the Light Dialectica Interpretation (LDI) on a minimal logic proof of the classical existence of Fibonacci numbers. This semi-classical proof ...