Proof by Induction

How proof by induction works:

Check the statement for the lowest integer (usually n = 1 )

Assume that the statement is true when n = k

Write down the statement for n = k + 1 and prove that the statement is true
for n = k + 1

This proves the statement is true for all integers greater than or equal to
your starting value

There are 4 types of proof by induction problem that we need to look at:

Summation of Series

Divisibility

Finding General Terms in a Sequence

Matrix Products

Exam Hint:

Set out your proof very clearly with 5 separate paragraphs for each of the stages
below. Leave a blank line between paragraphs. It always pays off to make the
examiner’s job easy!

Showing S(1) is true: substitute n = 1 in to statement

Assuming S(k) is true: write down statement with n = k

We want to prove S(k + 1) is true: write down statement with n = k + 1, and

simplify if necessary. This is what you are trying to prove

Proof of S(k + 1): the trick to this is always to write S(k + 1) in terms of S(k). It
will normally be S(k) plus an extra bit, or S(k) multiplied by an extra bit

Final sentence: “Therefore the statement is true”, or something similar

 Type 1: Summation of Series

These questions start with a sigma sign.

In these problems, the sum with n = k + 1 can always be written

as the sum with n = k plus the n = k + 1 term.

Example

Prove by induction that

Proof

Show that statement

is true for n = 1

Assume statement is
true for n = k

Write down what

you are trying to
prove, the statement
for n = k+1

Proof of statement
for n = k + 1

Final sentence

Type 2: Divisibility
 2
r  4r  5n  5
Example

Prove by induction that is divisible by 4

Proof

Show that statement

is true for n = 1

Assume statement is
true for n = k

Write down what

you are trying to
prove, the statement
for n = k+1

Proof of statement
for n = k + 1

Final sentence

Type 3: Finding general terms in a sequence

 These questions use a recurrence relation and starting point to
prove a general term

Example

Prove by induction that if and , then

Proof

Show that statement

is true for n = 1

Assume statement is
true for n = k

Write down what

you are trying to
prove, the statement
for n = k+1

Proof of statement
for n = k + 1

Final sentence

Type 4: Matrix Products

 In these problems, the product with n = k + 1 can always be
written as the product with n = k multiplied by the n = k + 1 term.

Example

Prove by induction that

Proof

Show that statement

is true for n = 1

Assume statement is
true for n = k

Write down what

you are trying to
prove, the statement
for n = k+1

Proof of statement
for n = k + 1

Final sentence
 Proof by Induction Exam Questions

1. Prove by induction that, for n  ℤ+,

n
1 n
∑ r(r+1 )
r=1 = n+1 .

(5)

2.

3.
 Solutions to Proof by Induction Exam Questions

1.
1
B1
When n = 1, LHS = , RHS = . So LHS = RHS and result true for n = 1

M1

Assume true for n = k; and so

M1 A1

= =

B1
and so result is true for n = k + 1 (and by induction true for ) [5]

(a 2. B1

If n = 1, = 1, =1
true for n = 1

M1 A1

M1

=
A1

=
true for n = k + 1 if true for n = k,
true for n  ℤ+ by induction

A1 cso
(6)
3. (a) (i) f(k + 1) – f(k)
= k3 + 3k2 + 3k + 1 – 10k – 10 + 15 – (k3 – 10k + 15) M1
= 3k + 3k – 9
2
A2, 1, 0 (3)
(b) f(1) = 6 = 3×2 true for n = 1 B1
f(k + 1) – f(k) = 3k + 3k – 9 = 3(k + k – 3)
2 2
M1 A1
true for n = k + 1 if true for n = k, A1 cso (4)
true for n  ℤ+ by induction

(ii) When n = 1, LHS = 1(2)1 = 2; RHS = 2{1 + 0} = 2 B1

⇒ true for n = 1

M1 A1

= 2 + k 2k + 1 – 2 k + 1 + k 2k + 1 + 2 k + 1
= 2(1 + k 2k + 1)

M1 A1
=
true for n = k + 1 if true for n = k, A1 cso (6)
true for n  ℤ+ by induction (13 marks)