Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-15T19:44:04.447Z Has data issue: false hasContentIssue false
  • English
  • Français

An identity for the Fibonacci and Lucas numbers

Published online by Cambridge University Press:  18 May 2009

Derek Jennings
Derek Jennings
Affiliation:
4 Barford CloseNorth Millers DaleChandlers FordHampshire 505 1TH England
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we prove an identity between sums of reciprocals of Fibonacci and Lucas numbers. The Fibonacci numbers are defined for all n ≥ 0 by the recurrence relation Fn + 1 = Fn + Fn-1 for n ≥ 1, where F0 = 0 and F1 = 0. The Lucas numbers Ln are defined for all n ≥ 0 by the same recurrence relation, where L0 = 2 and L1 = 1 We prove the following identify.

Type
Research Article
Information
Glasgow Mathematical Journal , Volume 35 , Issue 3 , September 1993 , pp. 381 - 384
Copyright
Copyright © Glasgow Mathematical Journal Trust 1993

References

REFERENCES

1.Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers (Clarendon Press, Oxford, 1938).Google Scholar
2.Landau, E., Sur la Serie des Invers de Nombres de Fibonacci. Bull. Soc. Math. France, 27 (1899), 298–300.Google Scholar
3.Borwein, J. M. and Borwein, P. B., Pi and the AGM (Wiley 1987)Google Scholar