A bijective proof of Cassini's Fibonacci identity

DOI10.1016/0012-365X(86)90194-9MaRDI QIDQ1066146zbMATH OpenWikidataFDO

Authors Michael Werman, Doron Zeilberger

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(86)90194-9

zbMATH Keywords

combinatorial proofFibonacci number

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37)

Review text

The authors provide a short combinatorial proof of the identity \(F^ 2_{n+1}-F_{n+2}F_ n=(-1)^{n+1}\), where \(F_ n\) denotes the n-th Fibonacci number.

Cited in

(13)

• A bijective proof of Riordan's theorem on powers of Fibonacci numbers
• Set partition statistics and q-Fibonacci numbers
• scientific article; zbMATH DE number 4132181 (Why is no real title available?)
• scientific article; zbMATH DE number 5014508 (Why is no real title available?)
• scientific article; zbMATH DE number 5542628 (Why is no real title available?)
• scientific article; zbMATH DE number 7534319 (Why is no real title available?)
• Generalized hyper-Fibonacci numbers and applications
• scientific article; zbMATH DE number 5663730 (Why is no real title available?)
• Applications of graphical condensation for enumerating matchings and tilings
• A translation method for finding combinatorial bijections
• Some Generalized Cassini Identities
• A 2-regular sequence that counts the divisors of n^2 + 1
• Dissection proofs of Melham's product-sum identities

This page was built for publication: A bijective proof of Cassini's Fibonacci identity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066146)