This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2n+1 + 2 n+2 ) for all integers n 0. 7) Using induction, show the following: = +-n i i i i 1 ) 1 )( 1 ( = (n-1)n(n+1)(n+2)/4 8) Use induction to show that 3 n < n! for all integers n > 6. 9) The Fibonacci numbers are defined as follows: F 1 = F 2 = 1, and F n = F n-1 + F n-2 , for all integers n > 2. Prove the following closed summation closed form using induction: = n i i F 1 = F n+2 1, for integers n > 0....
View Full Document
This document was uploaded on 07/14/2011.
- Spring '09