On an 'uncounted' fibonacci identity and its q-analogue

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish (US)
Pages (from-to)73-78
Number of pages6
JournalFibonacci Quarterly
Volume46-47
Issue number1
StatePublished - Feb 1 2008

Fingerprint

Q-analogue

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

On an 'uncounted' fibonacci identity and its q-analogue. / Smith, Neal O.

In: Fibonacci Quarterly, Vol. 46-47, No. 1, 01.02.2008, p. 73-78.

Research output: Contribution to journalArticle

@article{c0c3b8cebc774d46b5fbb89c3cb53a43,
title = "On an 'uncounted' fibonacci identity and its q-analogue",
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.",
author = "Smith, {Neal O}",
year = "2008",
month = "2",
day = "1",
language = "English (US)",
volume = "46-47",
pages = "73--78",
journal = "Fibonacci Quarterly",
issn = "0015-0517",
publisher = "Fibonacci Association",
number = "1",

}

TY - JOUR

T1 - On an 'uncounted' fibonacci identity and its q-analogue

AU - Smith, Neal O

PY - 2008/2/1

Y1 - 2008/2/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=62649168697&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62649168697&partnerID=8YFLogxK

M3 - Article

VL - 46-47

SP - 73

EP - 78

JO - Fibonacci Quarterly

JF - Fibonacci Quarterly

SN - 0015-0517

IS - 1

ER -