A bijective proof of Cassini's fibonacci
✍
M. Werman; D. Zeilberger
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 42 KB
can be easily proved by either induction, Binet's formula, or ([1, p. 80]) by taking determinants in In this paper we give a bijective proof, based upon the following combinatorial interpretation of the Fibonacci numbers. Proposition. Let A(n) = {(al, • • • , at); r >I O, ai = 1 or 2, a I +''' + a~