Such a formula is called a closed formula various

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a1 = 5. We see from the recurrence relation that a2 = a1 - a0 = 5 – 3 = 2 a3 = a2 – a1 = 2 – 5 = –3 a4 = a3 – a2 = - 3 – 2 = –5 … Fibonacci Sequence Definition: define the Fibonacci sequence, f0 , f1 , f2 , … by: —༉  Initial conditions: f0 = 0, f1 = 1 —༉  Recurrence relation: fn = fn- 1 + fn- 2 Example: find f2 , f3 , f4 , f5 and f6 . Solution: f2 = f1 + f0 = 1 + 0 = 1, f3 = f2 + f1 = 1 + 1 = 2, f4 = f3 + f2 = 2 + 1 = 3, f5 = f4 + f3 = 3 + 2 = 5, f6 = f5 + f4 = 5 + 3 = 8. Solving...
View Full Document

Ask a homework question - tutors are online