Abstract
In [1], Benjamin and Quinn offer several nontrivial Fibonacci identities which are, in their words, 'in need of combinatorial proof . In this article, we give a combinatorial proof of one of these identities. Our combinatorial proof offers insight as to how to produce a q-Fibonacci generalization of this result as well.
Original language | English (US) |
---|---|
Pages (from-to) | 73-78 |
Number of pages | 6 |
Journal | Fibonacci Quarterly |
Volume | 46-47 |
Issue number | 1 |
State | Published - Feb 2008 |
ASJC Scopus subject areas
- Algebra and Number Theory