Unified tiling proofs of a family of Fibonacci identities

Arthur T. Benjamin; Joshua Crouch; James A. Sellers

Unified tiling proofs of a family of Fibonacci identities

Arthur T. Benjamin, Joshua Crouch, James A. Sellers

Mathematics

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

In a recent work, Baxter and Pudwell mentioned the following identity for the Fibonacci numbers Fn and noted that it can be proven via induction: For all n ≥ 1, F2n = 1 · F2n−2 + 2 · F2n−4 + · · · + (n − 1) · F2 + n. We give a combinatorial proof of this identity and a companion identity. This leads to an infinite family of identities, which are also given combinatorial proofs.

Original language	English (US)
Pages (from-to)	29-31
Number of pages	3
Journal	Fibonacci Quarterly
Volume	57
Issue number	1
State	Published - Feb 2019

All Science Journal Classification (ASJC) codes

Algebra and Number Theory

Cite this

@article{5a544a1d4ae2413db0f97e3cb96e3ec8,

title = "Unified tiling proofs of a family of Fibonacci identities",

abstract = "In a recent work, Baxter and Pudwell mentioned the following identity for the Fibonacci numbers Fn and noted that it can be proven via induction: For all n ≥ 1, F2n = 1 · F2n−2 + 2 · F2n−4 + · · · + (n − 1) · F2 + n. We give a combinatorial proof of this identity and a companion identity. This leads to an infinite family of identities, which are also given combinatorial proofs.",

author = "Benjamin, {Arthur T.} and Joshua Crouch and Sellers, {James A.}",

year = "2019",

month = feb,

language = "English (US)",

volume = "57",

pages = "29--31",

journal = "Fibonacci Quarterly",

issn = "0015-0517",

publisher = "Fibonacci Association",

number = "1",

}

TY - JOUR

T1 - Unified tiling proofs of a family of Fibonacci identities

AU - Benjamin, Arthur T.

AU - Crouch, Joshua

AU - Sellers, James A.

PY - 2019/2

Y1 - 2019/2

N2 - In a recent work, Baxter and Pudwell mentioned the following identity for the Fibonacci numbers Fn and noted that it can be proven via induction: For all n ≥ 1, F2n = 1 · F2n−2 + 2 · F2n−4 + · · · + (n − 1) · F2 + n. We give a combinatorial proof of this identity and a companion identity. This leads to an infinite family of identities, which are also given combinatorial proofs.

AB - In a recent work, Baxter and Pudwell mentioned the following identity for the Fibonacci numbers Fn and noted that it can be proven via induction: For all n ≥ 1, F2n = 1 · F2n−2 + 2 · F2n−4 + · · · + (n − 1) · F2 + n. We give a combinatorial proof of this identity and a companion identity. This leads to an infinite family of identities, which are also given combinatorial proofs.

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

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

M3 - Article

AN - SCOPUS:85063125281

SN - 0015-0517

VL - 57

SP - 29

EP - 31

JO - Fibonacci Quarterly

JF - Fibonacci Quarterly

IS - 1

ER -

Unified tiling proofs of a family of Fibonacci identities

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this