P P P P P: Mathematical Induction
P P P P P: Mathematical Induction
P P P P P: Mathematical Induction
PURWANTO 2014 1
In the above cases we only guess the conclusions. In the first case, it is true that
PURWANTO 2014 2
We need two steps to proof a statement by mathematical induction.
step 1 ( the basis step): we show that P(a) is true
step 2 (the inductive step): we show that all integers k a, if P(k ) is true then
P(k 1) is true.
In the inductive step, we suppose that for all integers k a, if P(k ) is true. Then
we show that P(k 1) is true.
= (k 1) 2 ,
1 + 3 + 5 + + (2k 1) k 2 .
Then, for n = k +1,
= (k 1) 2 .
PURWANTO 2014 3
Example 2. Prove that for all integers n 1, 22n 1 is divisible by 3.
22k 1 is divisible by 3.
Then, for n = k + 1,
22(k 1) 1 22k 2 1
= 22 k 2 2 1
= 22 k 4 1
= 3( 22k ) + 22k 1.
PURWANTO 2014 4
Exercises
Prove each statement in 1 10 by mathematical induction.
n(n 1)
1. 1 + 2 + 3 + + n = .
2
n(n 1)(2n 1)
2. 12 22 32 ... n2 .
6
3n1 3
3. 3 3 3 ... 3
2 3 n
.
2
2
n(n 1)
4. 13 23 33 ... n3 .
2
1 1 5 n 1 1 5 n
un ( ) ( )
5 2 5 2
12. Find the flaw (the mistake) in the following proof by mathematical induction.
3k1 2 = 3k 3 2
PURWANTO 2014 5
= 3k 2 3k 2 .
PURWANTO 2014 6