Mathematical Induction Example and Questions

Worked Example.

Prove the following by induction:

4𝑛 − 1 is divisible by 3 for all 𝑛 ≥ 1.

Proof:

Let 𝑃(𝑛) stand for the proposition ‘4𝑛 − 1 is divisible by 3’ for all 𝑛.

(1) With 𝑛 = 1, 4𝑛 − 1 = 4 − 1 = 3 which is divisible by 3.

Hence 𝑃(1) is true.

(2) Assume that 𝑃(𝑘) is true for some 𝑘 ≥ 1.

Then 4𝑘 − 1 is divisible by 3.

Now consider 4𝑘+1 − 1. This can be written as follows

4𝑘+1 − 1 = 4𝑘+1 − 4 + 3
= 4(4𝑘 − 1) + 3

By assumption, 4𝑘 − 1 = 3𝑚 for some 𝑚 ∈ ℤ, and so 4(4𝑘 − 1) + 3 = 4(3𝑚) + 3 =

3(4𝑚 + 1), and so 4𝑘+1 − 1 is divisible by 3. Hence 𝑃(𝑘 + 1) is also true.

We have shown that 𝑃(1) is true, and that if 𝑃(𝑘) is true for some 𝑘 ≥ 1 then 𝑃(𝑘 + 1) is also
true. Hence, by the principle of mathematical induction, the statement is true for all 𝑛 ≥ 1.
Questions
1. Prove, by induction, that:

𝑛3 + 2𝑛 is divisible by 3 for all 𝑛 ∈ ℤ+

Proof:

Let 𝑃(𝑛) stand for the proposition ‘𝑛3 + 2𝑛 is divisible by 3’ for all 𝑛.

(1) [First prove that 𝑃(1) is true.]

(2) [Now prove that if 𝑃(𝑘) is true for some 𝑘, then 𝑃(𝑘 + 1) must also be true.]

(3) [Conclude that, by the principle of mathematical induction, 𝑃(𝑛) is true for all 𝑛.]

2. Prove, by induction, that 6𝑛 − 1 is divisible by 5 for all 𝑛 ∈ ℤ+ .

3. Prove, by induction, that 3𝑛 ≥ 1 + 2𝑛 for all 𝑛 ∈ ℤ+ .