PreCalcP7 10.4 ­ Mathematical Induction.notebook
Mathematical Induction (The Domino Proof)
3n­1 is always a multiple of 2
How can I show that this is true?
Step 1: Is it true when n = 1?
Step 2: If it's true for n, is it also true for n + 1?
Mathematical Induction
Can we use induction to show that the sum of the first n odd numbers (2n ­ 1) is n2?
Step 1: Show it's true for n = 1.
Step 2: Show that if it's true for n, it must be true for n + 1.
PreCalcP7 10.4 ­ Mathematical Induction.notebook
Mathematical Induction
Use induction to show that 1 + 4 + 7 + ... + (3n ­ 2) = 3n ­ n 2
Step 1: Show it's true for n = 1.
2
Step 2: Show that if it's true for n, it must be true for n + 1.