Exam s 3-4 Solutions

# Exam s 3-4 Solutions - MATH 290 EXAM 3 SOLUTIONS n 1(16 pts...

This preview shows pages 1–2. Sign up to view the full content.

MATH 290 – EXAM 3 – SOLUTIONS 1. (16 pts.) Prove by induction that for all natural numbers n , n X k =1 ( k · k !) = ( n + 1)! - 1. Solution: Assume that n = 1. Then 1 X k =1 ( k · k !) = 1 · 1! = 1 = 2! - 1. Hence the result holds for n = 1. Let n be any natural number and assume that n X k =1 ( k · k !) = ( n + 1)! - 1. We must show that n +1 X k =1 ( k · k !) = ( n + 2)! - 1. By the induction hypothesis, n +1 X k =1 ( k · k !) = n X k =1 ( k · k !) + ( n + 1)( n + 1)! = ( n + 1)! - 1 + ( n + 1)( n + 1)! . Also, ( n +1)! - 1+( n +1)( n +1)! = ( n +1)![1+( n +1)] - 1 = ( n +1)!( n +2) - 1 = ( n +2)! - 1 . This is what we wanted to prove. Therefore by the Principle of Mathematical Induction, for all natural numbers n , n X k =1 ( k · k !) = ( n + 1)! - 1. 2. (16 pts.) Prove by induction that for all natural numbers n 4, 2 n < n !. Solution: Assume that n = 4. Then 2 n = 2 4 = 16 < 24 = 4!. Hence the result holds for n = 4. Let

This preview has intentionally blurred sections. Sign up to view the full version.

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

{[ snackBarMessage ]}

### Page1 / 3

Exam s 3-4 Solutions - MATH 290 EXAM 3 SOLUTIONS n 1(16 pts...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online