A Fibonacci-counting proof begged by Benjamin and Quinn (Q2883417)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6032423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fibonacci-counting proof begged by Benjamin and Quinn |
scientific article; zbMATH DE number 6032423 |
Statements
10 May 2012
0 references
A Fibonacci-counting proof begged by Benjamin and Quinn (English)
0 references
A bijective proof is given here for the identity NEWLINE\[NEWLINE\sum_i\binom{2n}{i} f_{2i-\varepsilon}=5^n f_{2n-\varepsilon}, \quad (\varepsilon\in\{0,1\})NEWLINE\]NEWLINE as asked for by \textit{A. T. Benjamin} and \textit{J. J. Quinn} in their text [Proofs that really count. The art of combinatorial proof. The Dolciani Mathematical Expositions 27. Washington, DC: The Mathematical Association of America (2003; Zbl 1044.11001)].
0 references
0.8465449810028076
0 references
0.798997700214386
0 references
