Tell an identity from an equation, set out a proof from the left-hand side to the right-hand side, and prove simple results about even, odd and consecutive integers.
Each is in the Maths AA glossary, with every other term in the subject.
A statement that appears to be true, usually from a pattern in examples, but has not yet been proved. A conjecture becomes a theorem once it is proved and is discarded if a counterexample is found.
Integers that follow each other without gaps, each more than the one before, such as . In algebra they are written
A proof is an argument showing that a statement is true in every case it covers, not just in the cases someone has tried. Proof is what separates mathematics from the experimental sciences: a result checked a million times can still fail on the next case, while a proved result cannot. Every formula in this course, from the sum of an arithmetic series to the derivative of
36 exam-style questions on this subtopic, written in the style of the IB papers. The first has its markscheme open. Counted on
Let , for
One of 31 short multiple-choice questions on 1.6. Pick an answer to see why it's right or wrong.
The diagram shows a square of side , made of a square of side and an L-shaped strip of unit squares. How many unit squares are in the strip, for any positive integer ?

With a free account, Augment remembers where you stopped and what you have practiced.
A statement that two expressions are equal, which may be true for only some values of the variable. Solving an equation means finding those values; for example is true only when .
An integer that is divisible by , so it can be written as for some integer . Examples are , and .
An equality that is true for every value of the variable for which both sides are defined, such as . The symbol means "is identically equal to".
An integer that leaves remainder when divided by , so it can be written as for some integer . Examples are , and .
A chain of logical steps that starts from definitions, known facts or assumptions and shows that a statement must be true in every case it covers. Checking examples is not a proof.
A mathematical statement that has been proved to be true, such as Pythagoras' theorem or the binomial theorem.
Mathematics often begins with a pattern. Mark points on a circle and join every pair of points with a straight line (a chord), placing the points so that no three chords meet at one point. Count the regions the circle is divided into.

With 1, 2, 3, 4 and 5 points the circle has 1, 2, 4, 8 and 16 regions. The numbers double each time, so a natural guess is that points always give regions. A statement like this, which fits the evidence but has not been proved, is a conjecture.
The conjecture fails at the very next step: six points give 31 regions, not 32. Five cases in a row agreed with the pattern, and the sixth did not. (The correct number of regions is given by a different formula, which happens to match for .) A single case where a statement fails is enough to show that it is false; disproof by counterexample is developed in 1.15.
Since examples cannot show that a statement holds in every case, a different kind of argument is needed. A deductive proof starts from facts that are already accepted (definitions, earlier theorems and the rules of algebra) and moves forward in logical steps, each one following from the steps before. If every step is valid, the conclusion must be true in every case the starting facts cover.
The difference is easy to see with a simple statement such as "the sum of two odd numbers is even". Checking , and shows that the statement is plausible. It does not show that it is true for the infinitely many pairs that have not been checked. A proof covers all of them at once by working with general odd numbers written in algebra, as shown later in the section on integers.
Not every statement with an equals sign has the same meaning. The equation is true only when . The statement is true for every value of , because one side is just a rearrangement of the other. Statements of the second kind are called identities.
Equation | Identity | |
|---|---|---|
Example | ||
True for | some values only () | every value of |
Symbol | (or when the context makes it clear) | |
What to do with it | solve it | prove it, or use it to rewrite an expression |
Many identities are written with an ordinary sign when it is clear from the context that they hold for all values, such as the laws of exponents in 1.5. The symbol is used when the difference matters, for example when finding unknown constants or when a question asks for an identity to be proved.
Part (a) is based on a common expansion error: is not . The two expressions are equal only at , so substituting one value cannot tell an equation from an identity. Substituting several values can show quickly that a statement is not an identity, which is a useful check, but it can never prove that it is one.
If two polynomials are identically equal, they must have the same coefficient for every power of . Otherwise their difference would be a non-zero polynomial, which can be zero for only a few values of , not all of them. This principle, called comparing (or equating) coefficients, gives a way to find unknown constants.
To prove that , start with one side, usually the more complicated one, and transform it step by step, using only valid algebra, until it becomes the other side. The proof is written as a chain of equalities:
where LHS and RHS stand for the left-hand side and the right-hand side. Each line must equal the line before it for every value of the variable, so the chain shows that the two sides are always equal.
A clear proof has three parts:
A starting point: "LHS " followed by the left-hand side (or the right-hand side, if it is easier to start there).
A sequence of steps, one change per line, with a short reason where it is not obvious ("expanding", "common denominator", "factorising").
An ending that reaches the other side exactly, followed by a statement such as " RHS, so the identity is proved" or "which is the right-hand side".
Sometimes neither side is clearly simpler. Then both sides can be simplified separately until they reach the same expression. The working must still be kept as two separate chains, one starting from each side, so that no step assumes the result being proved.
A common but invalid way to "prove" is to write down , do the same thing to both sides, and arrive at something true, such as . The trouble is that a true conclusion can be reached from a false starting point. For example, start from the false statement and square both sides: the result is true. Working from the statement to be proved assumes the very thing the proof is meant to establish, and some steps (like squaring) cannot be reversed.
The same method works for any algebraic identity. Choosing which side to start from is part of the skill: expanding brackets is usually easier than factorising, so starting with the side that has brackets is often the better choice.
A numerical proof shows that a statement about specific numbers is true using exact arithmetic, never a calculator approximation. A calculator display such as cannot prove that two irrational numbers are equal, because it shows only finitely many digits. The laws of exponents and the rules for simplifying surds are the usual tools.
To prove a statement about all integers of a certain kind, write a general integer of that kind in algebraic form. Every even number is times an integer, every odd number is more than an even number, and consecutive integers follow one another without gaps.
Integer | Algebraic form () |
|---|---|
An even number | |
An odd number | (or ) |
Two consecutive integers | and |
Three consecutive integers | , , (or , |
Two consecutive even numbers | and |
Two consecutive odd numbers | and |
A multiple of | |
Two different odd numbers | and |
A number one more than a multiple of |
To show that a result is even, write it as . To show that it is a multiple of , write it as . To show that it is odd, write it as . In each case the expression in the bracket must be shown to be an integer, which is usually true because sums and products of integers are integers.
The proof has a simple picture. An odd number is a set of pairs with one left over. When two odd numbers are added, the two left-over items form a new pair, so nothing is left over.

Some proofs need cases. An integer is either even or odd, and if a statement can be proved for each case separately, it is true for all integers. This is still a deductive proof, because the two cases together cover every integer.
The identity says that the gap between consecutive square numbers is always odd and increases by 2 each time: have gaps The algebra is short:
The same fact can be seen geometrically. A square of side is a square of side with an L-shaped strip added along two edges. The strip contains unit squares.

Read the other way, the identity proves that every odd number (with ) is the difference of two consecutive squares. For example, .
A proved result can be used as a step in later proofs. This is how mathematics builds up: each theorem becomes a tool for the next.
Proof questions use the command terms "show that" and "prove". Both need every step written out, starting from one side or from a general case, and ending with a clear conclusion. They often come in two or three linked parts, where a "hence" part uses an identity proved earlier.
Further points that earn or lose marks on proof questions:
Define every letter used: "Let ", "where and are integers".
Substituting numbers is never a proof. Numerical checks may be written at the end, but they earn no proof marks.
Never start from the statement to be proved and work on both sides at once.
Use when the question uses it, and keep it in the final line.
I can explain the difference between an equation and an identity, and use correctly.
I can explain why checking examples, however many, does not prove a general statement.
I can prove an identity by starting from one side and transforming it into the other.
I can find unknown constants in an identity by comparing coefficients.
I can write even numbers, odd numbers, consecutive integers and multiples in algebraic form, using different letters for numbers that can differ.
I can prove that a sum, difference or product of integers is even, odd or a multiple of a given number.
I can split a proof into cases when an integer may be even or odd.
I can finish a proof with a clear statement of what has been proved.
Show that .
2 marks
M1
A1
AG
Note: Award M1 for a correct expansion, A1 for using both and
Hence, solve , for .
Consider the expression , where .
Show that .
3 marks
Hence, find the exact value of
Let , for .
Show that .
2 marks
Hence, show that
Find the exact value of .
Find the range of .
2 marks
Solve the equation , for .
(b) Expanding the left side gives exactly the right side, so this is an identity: .
(c) Expanding gives , so , which is never true. This is an equation with no solutions.
(d) For , factorise the numerator: . The statement is true for every for which the left side is defined, so it is an identity (for ).
The identity is . Compare coefficients.
Coefficient of : , so .
Constant term: , so and .
Check with any value, for example : the left side is and the right side is .
So . This is the completed square form, used for quadratics in 2.6.
The condition is there because both sides involve division by zero at and . An identity only needs to hold where both sides are defined.
Hence . This is the factorisation of a difference of two cubes.
which is the result to be shown.
(b) Use (a law of exponents from 1.5) and take out the common factor .
Since is an integer when is a positive integer, is times an integer, so it is a multiple of 8.
Check with : .
(b) Any two consecutive even numbers can be written and with . By part (a), the difference between their cubes is . Since is an integer, the difference is a multiple of 8.
(c) Write . The product of two consecutive integers is even, say with , so
which is odd. The difference is therefore . A multiple of 16 is , so the difference is never a multiple of 16.
Check: , and is odd.
Coefficient of : , so .
Constant term: , so .
(b) By part (a), . The square of a real number is never negative, so for all real . Therefore
for all real .
(c) The minimum value is , reached when .
M1 A1
(for
A1 A1
Note: Award A1A0 if any additional values are given.
3 marks
4 marks