In , 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)|
|Number of pages||6|
|Publication status||Published - Feb 1 2008|
ASJC Scopus subject areas
- Algebra and Number Theory