Hostname: page-component-7dd5485656-kp629 Total loading time: 0 Render date: 2025-10-30T15:05:50.297Z Has data issue: false hasContentIssue false
  • English
  • Français

Fibonacci properties by matrix methods

Published online by Cambridge University Press:  22 September 2016

J. R. Silvester
J. R. Silvester*
Affiliation:
Department of Mathematics, University of London, King’s College, Strand, London WC2R 2LS
Get access Rights & Permissions [Opens in a new window]

Extract

The Fibonacci sequence

0, 1, 1, 2, 3, 5, 8, 13, …

is defined by u 0 = 0, u 1 = 1, and un = u n−1 + u n−2 for . There are many elementary formulae relating the various un , most of which, since the sequence is defined inductively, are themselves usually proved by induction.

Information

Type
Research Article
Information
The Mathematical Gazette , Volume 63 , Issue 425 , October 1979 , pp. 188 - 191
Copyright
Copyright © Mathematical Association 1979

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

1. Hardy, G. H. and Wright, E. M., An introduction to the theory of numbers (4th edition). Oxford University Press (1960).Google Scholar