Mathematical Induction can be used, sometimes, STATEMENT 1

⇓
to prove a sequence of statements: STATEMENT 2
⇓
STATEMENT 3
⇓
First, prove STATEMENT 1. STATEMENT 4
⇓
STATEMENT 5
⇓
Then, show that each STATEMENT M STATEMENT 6
⇓
implies the next, STATEMENT M + 1. STATEMENT 7
⇓
STATEMENT 8
⇓
STATEMENT 9
⇓
···
⇓
STATEMENT n
⇓
···
 n
X n(n + 1)
To show by Mathematical Induction that k= :
k=1
2
1
X 1(1 + 1)
Show this first for n = 1 : k= , 1 = 1.
k=1
2
M
X M (M + 1)
Then show that STATEMENT M, k= ,
k=1
2
M +1
X (M + 1)(M + 2)
implies STATEMENT M +1, k= :
k=1
2
M +1 M
X X M (M + 1)
k= k + (M + 1) = + (M + 1)
k=1 k=1
2
(M + 1)(M + 2)
=
2
 n
X
To Show by Mathematical Induction that f (k) = g(n) :
k=a
Verify for the lowest n = a that f (a) = g(a) .
Show for n > a that g(n) − g(n − 1) = f (n) .
n−1
X
If we already knew f (k) = g(n − 1),
k=a
and if we added f (n) = g(n) − g(n − 1),
then we would also have
n−1
X
f (k) + f (n) = g(n − 1) + g(n) − g(n − 1),
k=a !
Xn
which simplifies to f (k) = g(n).
k=a
Example:
n
X n(n + 1)
To Show by Mathematical Induction that k= :
k=1
2
1(1 + 1)
Verify for n = 1 that f (1) = g(1) , i.e., that 1 = .
2
Show for n > 1 that g(n) − g(n − 1) = f (n) .
n(n + 1) (n − 1)((n − 1) + 1)
i.e., that −
2 2
n(n + 1) − (n − 1)n
=
2
n(n + 1 − n + 1)
=
2
n(1 + 1)
= = n.
2
Example
n
X n(n + 1)(n + 2)
To Show that k(k + 1) = :
k=1
3

1(1 + 1)(1 + 2)
Verify that 1(1 + 1) = .
3

Show for n > 1 that

n(n + 1)(n + 2) (n − 1) (n − 1) + 1 (n − 1) + 2
−
3 3
n(n + 1)(n + 2) − (n − 1)n(n + 1)
=
3
n(n + 1)(n + 2 − n + 1) n(n + 1)(3)
= = = n(n + 1).
3 3
Example
n
X 1 − xn+1
To Show that xk = , for x 6= 1 :
k=0
1−x

1 − x0+1
Verify for n = 0 that x0 = .
1−x
1 − xn+1 1 − x(n−1)+1
Show for n > 0 that −
1−x 1−x
1 − xn+1 − 1 + xn
=
1−x
xn − xn+1
=
1−x
xn(1 − x)
= = xn .
1−x