# L8 - Induction Review When using Mathematical Induction to...

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

Induction: Review When using Mathematical Induction to prove that a property P(n) holds for all positive integers n, we must do the following two steps: 1)Basis step: Show that P(1) is true. 2)Demonstrate that if P(k) is true for arbitrary k, then P(k+1) is also true. (This is done by assuming that P(k) is true, and using it to prove that P(k+1) is also true.)

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

View Full Document
Sum of Evens Prove that the sum of the first n even numbers is n 2 +n. 2 11 Proof: First we can write the sum of the first n positve even numbers as 2 . So P(n): 2 nn ii i i n n    1 2 1 Basis: P(1): 2 2 1 1 i i 2 1 Inductive: Assume P(k) is true, i.e. 2 4 ... 2 2 .(*) k i k i k k   1 2 1 We will show P(k+1) is true, i.e. 2 4 ... 2 2 2 2 ( 1) ( 1). k i k k i k k     2 Adding 2k+2 to both sides of (*), 2 4 . .. 2 2 2 2 2. k k k k k       2 ( 2 1) ( k k k 2 ( ( kk We have now shown P(k+1) is true so the proof is complete.
Example Prove that 1+2+2

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.

## This note was uploaded on 06/01/2010 for the course MATH 1P66 taught by Professor Jeffharoutunian during the Spring '10 term at Brock University.

### Page1 / 10

L8 - Induction Review When using Mathematical Induction to...

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

View Full Document
Ask a homework question - tutors are online