This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Chapter 2 MAT188H1F Lec03 Burbulla Chapter 2 Lecture Notes Fall 2007 Chapter 2 Lecture Notes MAT188H1F Lec03 Burbulla Chapter 2 Chapter 2 2.6: Linear Recurences Chapter 2 Lecture Notes MAT188H1F Lec03 Burbulla Chapter 2 2.6: Linear Recurences The Fibonacci Sequence These are a sequence of numbers, F k , defined recursively by F 1 = 1 , F 2 = 1 and F k +2 = F k +1 + F k , for k 1 . The first few terms are 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 85 , . . . The defining equation for the Fibonacci sequence is an example of a linear recurrence relation. Is there a formula for the k-th Fibonacci number? Yes; one can be found using matrices and diagonalization. I will illustrate the method for the Fibonacci sequence, but it can be applied to many other linear recurrence relations. Chapter 2 Lecture Notes MAT188H1F Lec03 Burbulla Chapter 2 2.6: Linear Recurences A Sequence of Matrices Define the matrix V k to be V k = F k F k +1 ....
View Full Document
This note was uploaded on 06/22/2008 for the course ENGINEERIN MAT188 taught by Professor Burbula during the Fall '07 term at University of Toronto- Toronto.
- Fall '07