Random Approaches to Fibonacci Identities

DOI10.2307/2589346MaRDI QIDQ2757486zbMATH OpenOpenAlexFDO

Authors Arthur T. Benjamin, Gregory M. Levin, Karl Mahlburg, Jennifer J. Quinn

Publication date 26 November 2001

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1525&context=hmc_fac_pub

zbMATH Keywords

Binet formulacounting argumentsFibonacci identities

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• scientific article; zbMATH DE number 2145125
• scientific article; zbMATH DE number 2145126
• scientific article; zbMATH DE number 6713350
• Tiling approach to obtain identities for generalized Fibonacci and Lucas numbers
• scientific article; zbMATH DE number 1404131

Cited in

(6)

• A probabilistic approach to the Fibonacci sequence
• A transfer operator approach to random Fibonacci sequences
• Randomly generated identities
• A combinatorial development of Fibonacci numbers in graph spectra
• Combinatorialization of Sury and McLaughlin identities and general linear recurrences by a unified approach
• The random Fibonacci recurrence and the visible points of the plane

This page was built for publication: Random Approaches to Fibonacci Identities

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