Steply

Prove if n is odd, then n^2 is odd

Step by step, with the reason for every step · Direct proof · Discrete Math

Step by step

The question

Question: prove that if n is odd, then n² is odd.

1 Write it with letters

n is odd, so n = 2a + 1, where a is a whole number.

n = 2a + 1

That is what odd means.

odd = 2 × a whole number + 1

Careful!

An example shows one number.

The letters show every number at once.

Careful: one example is not a proof

2 Put them in

Now put them in: n² becomes (2a + 1)².

n2 = (2a + 1)2

3 Work it out

(2a + 1)² means the bracket times itself.

= (2a + 1)(2a + 1)

Every part times every part: 4a² + 2a + 2a + 1.

= 4a2 + 2a + 2a + 1

Like terms together: 4a² + 4a + 1.

= 4a2 + 4a + 1

4 Show the form

We take out 2 from all but the 1: 2(2a² + 2a) + 1.

= 2(2a2 + 2a) + 1

2a² + 2a is a whole number, because whole numbers added and multiplied stay whole.

2a² + 2a is a whole number

2 times a whole number, plus 1: that is the form of an odd number.

So n² is odd.

So n² is odd. ∎

The square at the end means: the proof is done.

5 Check

An example: n = 3.

It gives 9.

n = 3: 3² = 9

9 is 2 times 4, plus 1: odd, as the proof says.

Right!

9 = 2 × 4 + 1

Let's look back.

First: write it with letters.

Then: put them in.

Then: work it out.

Then: show the form.

Last: check.

Answer
2a² + 2a is a whole number

Your turn

Try this one yourself, then check:

Show the answer
n2 = 2 × 2a2

More from Direct proof

The whole lesson: Direct proof →