This preview shows page 1. Sign up to view the full content.
Unformatted text preview: − 2 € Note: Some people skip F0 and start by setting both F1 and F2 to be 1. This does not change any values for the numbers. €
(a) Compute and write down the first 10 Fibonacci numbers. €
€
€
n
(b) Prove that this equation is true for integers n ≥ 0: ∑k = 0 Fk = Fn + 2 − 1. Problem 7
2: • Answer Gemignani, Section 7.3 #1 and € • Also find the images of the 8 functions fk in the same Example 9. Problem 7
3: • Answer Gemignani, Section 7.3 #2 for only (b), (c) and (d)....
View
Full
Document
This note was uploaded on 01/29/2014 for the course MATH 300A taught by Professor Jamesking during the Winter '11 term at University of Washington.
 Winter '11
 JamesKing
 Math

Click to edit the document details