This preview shows pages 1–2. 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: (c) Suppose we only require that each of the ﬁve people gets at least one jellybean (of some color) but that no CSE major gets more than two blue jellybeans? Now how many ways are possible? 3.4 Solve the following linear recurrences: (a) x n +1 = 3 x n2 , x 1 = 2; (b) x n +1 = 3 x n2 , x 1 = 1; 3.5 Deﬁne the usual Fibonacci numbers by: F = 0 , F 1 = 1, and F n +2 = F n +1 + F n , n ≥ 0. Prove by induction that: (a) ∑ n k =1 F 2 k = F 2 n +11; (b) F n +1 F n1 = F 2 n + (1) n . 1 3.6 Solve the second order linear recurrences: (a) y n +2 = 2 y n +1 + y n , y = 0 , y 1 = 1; (b) y n +2 = 2 y n +1y n , y = 0 , y 1 = 1 . 2...
View
Full
Document
This note was uploaded on 02/02/2012 for the course CSE 21 taught by Professor Graham during the Fall '07 term at UCSD.
 Fall '07
 Graham

Click to edit the document details