MATHEMATICAL INDUCTION
Learning Objectives
1. illustrate the Principle of Mathematical Induction
2. apply mathematical induction in proving identities
3. solve problems using mathematical induction
Mathematical Induction
1=1
1+3=4
1+3+5=9
1 + 3 + 5 + 7 = 16
1 + 3 + 5 + 7 + 9 = 25
1 + 3 + … + (2n – 1) = n2
Principle of Mathematical Induction
For each n ∈ N suppose Pn
is some statement involving n. If
1. P1 is true, and
2. for any k ∈ N, if Pk is true, then Pk+1 is also true,
then Pn is true for all n ∈ N
Prove that for any positive integer n,
1 + 3 + … + (2n – 1) = n2
Basis step: When n = 1, 1 = 1 is true
Inductive step: Assume statement true when n = k
1 + 3 + … + (2k – 1) = k2
Show that the statement is also true when n = k + 1
1 + 3 + … + (2k – 1) + [2(k+1) – 1] = (k+1)2
1 + 3 + … + (2k – 1) + [2(k+1) – 1] = k2 + (2k+1) = (k+1)2
End of proof
Prove that for any positive integer n
and any real numbers a and b, (ab)2 = anbn
Basis step: When n = 1, (ab)1 = ab = anbn
Inductive step: Assume statement true when n = k
(ab)k = akbk
Show that the statement is also true when n = k + 1
(ab)k+1 = ak+1bk+1
(ab)k+1 = (ab)k(ab)1 = akbkab = ak+1bk+1
End of proof
Prove that for any positive integer n
n < 2n
Basis step: When n = 1, 2n = 2, we have 1 < 2
Inductive step: Assume statement true when n = k
k < 2k
Show that the statement is also true when n = k + 1
k + 1 < 2k+1
Since k ≥ 1, 2k ≥ 2 > 1. Thus
k + 1 < 2k + 1 < 2k + 2k = 2(2k ) = 2k+1
End of proof
Extended Principle of Mathematical Induction
Let m ∈ N and for each n ≥ m, suppose Pn
is some statement involving n. If
1. Pm is true, and
2. for any k ≥ m, if Pk is true, then Pk+1 is also true,
then Pn is true for all positive integers n ≥ m
Prove that 2n < n! for all positive integers n ≥ 4.
Basis step: When n = 4, 2n = 16 < 24 = n!
Inductive step: Assume statement true when n = k
2k < k! for some positive integer k ≥ 4
Show that the statement is also true when n = k + 1
2k+1 < k + 1 !
2k+1 = 2(2k ) < 2(k!)
Since k ≥ 4, k + 1 ≥ 5 > 2. Thus
2(k!) < (k+1)k! = (k+1)!
End of proof
Exercises
Rewrite the sums in sigma notation:
1 1 1 1 1
1. − + − + 2. a3 + a9 + a27 + a81
4 9 16 25 36
Evaluate the sums:
5 5
3. k=1 −k k
σ 4. k=1 2k
σ
Prove using mathematical induction:
n(1+n)
5. 1 + 2 + 3 + 4 + 5 + ⋯ + n =
2
