Hostname: page-component-7dd5485656-wxk4p Total loading time: 0 Render date: 2025-10-22T22:19:00.680Z Has data issue: false hasContentIssue false
  • English
  • Français

109.49 A double-counting proof of Fn+1 + Fn-1 = Ln for n ≥ 2

Published online by Cambridge University Press:  15 October 2025

Li Zhou
Li Zhou*
Affiliation:
Polk State College, 999 Ave. H NE, Winter Haven, FL 33881, USA e-mail: lzhou@polk.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Notes
Information
The Mathematical Gazette , Volume 109 , Issue 576 , November 2025 , pp. 557 - 558
Check for updates
Copyright
© The Authors, 2025 Published by Cambridge University Press on behalf of The Mathematical Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Honsberger, R., Mathematical Gems III, MAA (1985) pp. 120–122.Google Scholar
Koshy, T., Fibonacci and Lucas Numbers with Applications, John Wiley & Sons, Inc., (2001) pp. 28–29.Google Scholar