Algebraic Proof AA SL

A proof is a chain of algebra that shows a statement is true for every case it covers, not just the cases you tried. This page shows how to lay out a proof from the left-hand side to the right-hand side, how to write even, odd and consecutive integers with letters, and how to prove divisibility.

Formulas at a glance

Proof has no formulas in the formula booklet: writing even, odd and consecutive integers algebraically is a convention you are expected to know.

A general even number

2n2n, n∈Zn\in\mathbb{Z}

Not in the booklet

A general odd number

2n+12n+1, n∈Zn\in\mathbb{Z}

Not in the booklet

Consecutive integers

n, n+1, n+2,…n,\ n+1,\ n+2,\ldots

Not in the booklet

"aa is divisible by bb"

a=bqa=bq, q∈Zq\in\mathbb{Z}

Not in the booklet

Which approach to use

The wording of the question usually tells you the kind of proof.

The question saysApproachHow it starts
Show that or prove that two expressions are equalStart from the more complicated side and simplify until it matches the other sideDo not work on both sides at once
Prove a result about even, odd or consecutive integersRepresent the integers with letters, for example 2k2k, 2k+12k+1, nn, n+1n+1Then simplify and state why the result has the required form
Prove that a number is divisible by kkWrite it as k×k\times (an integer expression)Factorise to show the factor kk
Hence prove, or use your answer to part (a)Use the result you have just found as a step in the proofQuote it, then continue the algebra

SL1.6

Algebraic proof

A direct proof starts from a general case, such as writing an even integer as 2n2n, and uses algebra to reach the required result, giving a reason for each step. A proof ends with a clear concluding statement, and the correct symbols separate an equation from an identity.

Setting a proof out correctly

There's no formula to memorise here - the skill is in the algebraic set-up and the logic that closes the proof.

LHS to RHS layout

Start → manipulate → state the conclusion

Work from the given side of the statement towards the side you're trying to reach, showing each algebraic step. Finish with a sentence that explicitly states why the result follows - the algebra alone is not the proof.

Key terms

How do you represent even and odd integers in a proof?

Use 2n2n for an even integer and 2n+12n+1 for an odd integer, where nn is an integer. When two different integers are needed, use different letters.

e.g. Two even integers 2m2m and 2n2n have sum 2m+2n=2(m+n)2m+2n=2(m+n), which is even.

What is the difference between an equation and an identity?

An equation is true only for certain values of the variable, while an identity, written with ≡\equiv, is true for every value.

e.g. x+3=7x+3=7 is true only when x=4x=4, but (x+1)2≡x2+2x+1(x+1)^{2}\equiv x^{2}+2x+1 is true for all xx.

How do you set out an LHS to RHS proof?

Start with the left-hand side only and simplify it step by step, giving a reason for each step, until it matches the right-hand side. Do not work on both sides at the same time.

e.g. To show (n+1)2−n2≡2n+1(n+1)^{2}-n^{2}\equiv2n+1: LHS=n2+2n+1−n2=2n+1=RHS\text{LHS}=n^{2}+2n+1-n^{2}=2n+1=\text{RHS}.

Worked example, step by step

The question No calculator needed [5 marks]

Two consecutive odd integers are 2k−12k-1 and 2k+12k+1, where kk is an integer. Prove that the sum of the squares of two consecutive odd integers is always 2 more than a multiple of 8.

Worked solution: worked example

Answer: (2k−1)2+(2k+1)2=8k2+2(2k-1)^2+(2k+1)^2=8k^2+2, which is 2 more than a multiple of 8 because k2k^2 is an integer.

Step 1 - Start with the general case.

The two numbers are given as 2k−12k-1 and 2k+12k+1. The sum of their squares is (2k−1)2+(2k+1)2.(2k-1)^2+(2k+1)^2. M1 - Write the sum of the squares of the two integers as (2k−1)2+(2k+1)2(2k-1)^2+(2k+1)^2

Why? A proof has to cover every pair of consecutive odd integers at once, so you start from letters, not from numbers such as 33 and 55. Writing the expression down first fixes exactly what you have to simplify.

Step 2 - Expand each square.

(2k−1)2=4k2−4k+1,(2k+1)2=4k2+4k+1.(2k-1)^2=4k^2-4k+1,\qquad (2k+1)^2=4k^2+4k+1. M1 - Expand both squares A1 - 4k2−4k+14k^2-4k+1 and 4k2+4k+14k^2+4k+1

Why? Expand the brackets one at a time, because each square has a middle term that is easy to get wrong. Writing both lines shows the examiner each step.

Step 3 - Add and simplify.

(2k−1)2+(2k+1)2=4k2−4k+1+4k2+4k+1=8k2+2.(2k-1)^2+(2k+1)^2=4k^2-4k+1+4k^2+4k+1=8k^2+2. A1 - Simplify to 8k2+28k^2+2

Why? The −4k-4k and +4k+4k terms cancel and the rest collects. The result 8k2+28k^2+2 already looks like "a multiple of 8, plus 2", which is the form the question asks for.

Step 4 - Conclude in words.

Since kk is an integer, k2k^2 is an integer, so 8k28k^2 is a multiple of 8. Therefore 8k2+28k^2+2 is 2 more than a multiple of 8, for every integer kk. R1 - State that k2k^2 is an integer, so 8k28k^2 is a multiple of 8 and the result is 2 more than a multiple of 8

Why? The algebra alone is not the proof: you must say why the result has the required form. Here the reason is that k2k^2 is an integer, so 8k28k^2 is a multiple of 8. This sentence is a separate reasoning mark.

Step 5 - Check with numbers.

The pair 1,31,3 has k=1k=1: 12+32=10=8×1+21^2+3^2=10=8\times1+2, and 8(1)2+2=108(1)^2+2=10. The pair 3,53,5 has k=2k=2: 32+52=34=8×4+23^2+5^2=34=8\times4+2, and 8(2)2+2=348(2)^2+2=34.

Why? A check is not a proof, but it catches slips in the algebra.

Marks (5):
M1 Write the sum of the squares of the two integers as (2k−1)2+(2k+1)2(2k-1)^2+(2k+1)^2
M1 Expand both squares
A1 4k2−4k+14k^2-4k+1 and 4k2+4k+14k^2+4k+1
A1 Simplify to 8k2+28k^2+2
R1 State that k2k^2 is an integer, so 8k28k^2 is a multiple of 8 and the result is 2 more than a multiple of 8

Now you try: enter your answers to be marked

These are real practice questions. Type your answer in each box and press Mark it. The worked solution and mark scheme appear straight away, and your first attempt is the one that counts. Use the keyboard for powers, roots and trig, and the working box for your notes.

1
Easy
No calc
[3 marks]
Prove that the sum of three consecutive integers is divisible by 3.

Let nn be the smallest of the three integers, and write their sum as 3k3k. Find kk in terms of nn.
[3]
Fractions & powers
Other

Worked solution: practice question 1

2
Medium
No calc
[4 marks]
Prove that the sum of the squares of two consecutive integers is odd.

The two consecutive integers are nn and n+1n+1, where nn is a positive integer. Given that the sum of their squares is 313, find the value of nn.
[4]
Fractions & powers
Other

Worked solution: practice question 2

3
Hard
No calc
[5 marks]
Three consecutive even integers are 2n−22n-2, 2n2n and 2n+22n+2, where nn is an integer. Let SS be the sum of their squares.
(a) It can be shown that S=4(3n2+c)S=4(3n^2+c), where cc is a constant. Find the value of cc.
[2]
(b) Hence prove that, when SS is divided by 12, the remainder is the same for every integer nn. Find this remainder.
[3]
Fractions & powers
Other

Worked solution: practice question 3

Your score so far: 0 out of 12 marks

Common mistakes

  • Forgetting the reasoning line at the end. Reaching 4(2n+1)4(2n+1) isn't itself a proof of divisibility by 4 - you also need to state that 2n+12n+1 is an integer, so the whole expression is a multiple of 4.
  • Assuming the result to prove it. Starting from the equation you're trying to establish and working backwards to something true is circular unless every step is shown to be reversible - it's safer to start from the given facts and work forwards to the conclusion.

Try some questions on algebraic proof

Using your GDC

The exact key presses for the TI-84 Plus CE, Casio fx-CG50, Casio fx-CG100 and TI-Nspire CX, with what the screen shows. Pick your calculator.

Make a table of values

Used in: Algebraic proof

How to make a table of values on a TI-84 Plus CE

Table with a start value and a step

Press Y= and type the function in Y1: X,T,θ,n ^ 3 − 3 X,T,θ,n − 1. Only a function with its = sign highlighted appears in the table.

Y1=X^3-3X-1

Press 2nd window (TBLSET). Type 1 enter for TblStart, the first x-value, and 1 enter for ΔTbl, the step between x-values. Leave Indpnt and Depend on Auto.

TblStart=1
ΔTbl=1
Indpnt: Auto
Depend: Auto

Press 2nd graph (TABLE). Press ▼ to scroll down and ▲ to scroll up.

−3 is followed by 1, so the sign of Y1 changes between x=1x = 1 and x=2x = 2.

X    Y1
1   -3
2   1
3   17

To zoom in on the change, press 2nd window (TBLSET) again and set TblStart to 1 . 8 and ΔTbl to 0 . 1, then press 2nd graph (TABLE).

f(1.8)=−0.568f(1.8) = -0.568 and f(1.9)=0.159f(1.9) = 0.159: the sign changes between x=1.8x = 1.8 and x=1.9x = 1.9.

X    Y1
1.8 -0.568
1.9 0.159
2   1
Value for chosen x-values: Indpnt Ask

In 2nd window (TBLSET) choose Ask on the Indpnt line and press enter. Open the table with 2nd graph (TABLE). It starts empty: type an x-value and press enter, and the calculator fills in the value of Y1. Use this when you only need a few particular x-values.

Press + on the table (the message Press + for ΔTbl shows when it opens) to change the step without going back to TBLSET.

The full guide: Make a table of values

See the full list of GDC guides for every calculator task.

Syllabus content covered

CodeSyllabus content
SL1.6Simple deductive proof, numerical and algebraic; how to lay out a left-hand side to right-hand side (LHS to RHS) proof. The symbols and notation for equality and identity.

Official IB source: Mathematics: analysis and approaches subject brief (PDF, ibo.org).

Quick questions

What is a direct proof in IB Maths?

A direct proof starts from a general algebraic statement of the given facts (for example, letting an even integer be 2n2n) and manipulates it step by step until the required result is reached, with each step justified.

Why is checking a few numbers not a proof?

A few examples only show that the statement works for those values, and the next value might fail. A proof must work for every value that meets the conditions, which is why algebra with a general integer such as nn is used.

How do I prove that the product of two odd integers is odd?

Write them as 2m+12m+1 and 2n+12n+1. Then (2m+1)(2n+1)=4mn+2m+2n+1=2(2mn+m+n)+1(2m+1)(2n+1)=4mn+2m+2n+1=2(2mn+m+n)+1, which has the form 2k+12k+1 with kk an integer, so it is odd.

What should I write at the end of a proof?

Finish with a sentence that links your final expression back to the claim. For example: this has the form 2k2k with kk an integer, so the result is even.

Ready to practise properly?

Practice questions on every section, marked instantly like the real exam.