Fibonacci numbers | Sciweavers

37

DM
1999

79views more DM 1999»

A bijective proof of Riordan's theorem on powers of Fibonacci numbers

13 years 11 months ago

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...

Andrej Dujella

claim paper

Read More »

31

click to vote

CG
2004
Springer

131views Computer Graphics» more CG 2004»

Views of Fibonacci dynamics

13 years 11 months ago

Download webbox.lafayette.edu

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...

Clifford A. Reiter

claim paper

Read More »

49

click to vote

DM
2008

105views more DM 2008»

Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope

13 years 11 months ago

Download www.mat.uc.pt

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...

C. M. da Fonseca, E. Marques De Sá

claim paper

Read More »

40

click to vote

LCC
1994

200views Algorithms» more LCC 1994»

Program Extraction from Classical Proofs

14 years 3 months ago

Download www.brics.dk

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 ...

Ulrich Berger, Helmut Schwichtenberg

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers