Step by step
The question
Question: prove by induction that n² + n is divisible by 2, for every whole number n.
Like dominoes: show it for n = 1, then show that k passes it on to k + 1.
1 Check n = 1
For n = 1: 2, and that is 2 × 1.
Divisible by 2: the first domino falls.
2 Assume it works for k
Suppose it works for k: k² + k is a multiple of 2.
So it is 2 times some whole number.
Call it m.
3 What we must show
We must show the same for k + 1: every n becomes k + 1.
Careful!
A bracket to a power is the bracket times itself.
Every part times every part.
4 Use the assumption
Each power of the bracket is the bracket times itself.
Open the brackets.
Like terms together.
Look for the old one inside: k² + k.
The rest is left over.
By our assumption, the old one is 2m.
5 Take out 2
Every term has a 2 in it.
Take out 2: 2(k + m + 1).
So it works for k + 1 too.
True for n = 1, and passed on each time: true for every whole number n.
The proof is done.
6 Check
Let's check n = 3: it gives 12.
12 is 2 times 6.
Divisible by 2.
Right!
Let's look back.
First: check n = 1.
Then: assume it works for k.
Then: what we must show.
Then: use the assumption.
Then: take out 2.
Last: check.