The structure of proof and proof by deduction
A proof is an argument that starts from facts you are given or already know, moves through steps that each follow from the one before, and ends at the statement you were asked to establish.
Checking a few numbers is not a proof: it only shows that the statement holds for those numbers.
This section sets out how a proof is built, then teaches the method used most often across the course, proof by deduction.
Proof is examined on both Paper 1 and Paper 2, either as a short question of its own or as the last part of a longer question, and the deduction style you learn here is the same one you use for a show-that in every other topic.
What a proof is made of
Every proof has the same three parts.
- The starting point. What you are given, written in symbols. "Let be an integer" or "Given that " fixes the objects the proof talks about. If the statement is about any integer, you must work with a general one, , never a particular one such as .
- The chain. Each line follows from the line before it by algebra, a known result or a definition. The symbol ("implies") links a line to the next one; means each line implies the other. Write words where they help: "so", "since", "which is even because".
- The conclusion. A sentence that states the result in the question's words: "so the sum of any four consecutive integers is never a multiple of 4". On 9MA0 papers the closing statement is a mark of its own, and it is the mark lost most often.
Writing numbers in general form
Most deduction proofs about integers rely on writing a number in a form that shows its property.
Number
General form ()
any even number
any odd number
(or )
a multiple of
two consecutive integers
and
two consecutive odd numbers
and
any two odd numbers (not necessarily consecutive)
and
The last row matters.
If two odd numbers are unrelated, they need different letters: writing both as makes them the same number, and the proof then covers only that special case.
To show a number is a multiple of , factorise out of the whole expression and say that the bracket is an integer.
Proof by deduction
In a proof by deduction you start from what is known and reason forwards.
You need to know that this is the most commonly used method of proof throughout the course.
The two examples you need to recognise are:
- using completion of the square to prove that a quadratic is positive for all values of the variable, for example that is positive for all values of , since and a square is never negative;
- differentiation from first principles for small positive integer powers of , where the gradient of a chord is simplified and the limit taken. That proof is taught in full in the differentiation unit; it is a deduction because every line follows from the definition of the derivative.
The completing-the-square idea works because of one fact about real numbers: a square is never negative.
For every real , , with only when .
So if you can write an expression as (a square) (a positive number), it is positive for every real value.
Write the square as , never "": is zero when .
The sketch below shows what the algebra says for : the lowest point of the curve is , so the curve never reaches the -axis.
Deduction with inequalities
The same forward reasoning works with inequalities, with one rule that catches people out.
Adding or subtracting the same quantity, or multiplying or dividing by a positive quantity, keeps the inequality sign.
Multiplying or dividing by a negative quantity reverses it: , but multiplying by gives .
When you divide by a letter, you must know its sign, and you must say in the proof where the sign reverses and why.
A line such as "dividing by , which is negative since , reverses the inequality" earns the reasoning mark.
Why it works (not examined): a proof is permanent
A statement checked for many values could still fail at the next one.
Pierre de Fermat believed that every number of the form is prime.
The first five, and , are prime, but Leonhard Euler later showed that the next one, , equals .
A deduction from a general covers every case at once, which is why it is the standard of evidence in mathematics.
- Proof: a logical argument that proceeds from given assumptions through a series of logical steps to a conclusion.
- Proof by deduction: a proof that starts from known facts or definitions and reasons forwards, each step following from the previous one, until the required statement is reached.
- Implies (): means that if is true then is true.
- If and only if (): means and .
- Integers: the set ; means is an integer.
- Every mark is worth one. M1 is for a correct method applied to this problem: a formula quoted and then used with your values keeps the M even after a slip.
- A1 is for an accurate answer or line and needs the M before it. B1 is an independent mark: a value, a feature of a sketch, a reason, a statement or a piece of notation.
- dM1 depends on the M mark before it, and ddM1 on the two before it. A1* is the last mark of a "show that" or a proof: earned only with no errors, the printed result written out in full and, for a proof, the closing statement.
- cso means correct solution only; ft means a wrong earlier value carried forward correctly still earns marks; oe means any equivalent form; awrt means "answers which round to"; isw means ignore subsequent working. A special case (SC) gives partial credit for a recognised wrong route.
- Under the calculator banner ("In this question you must show all stages of your working. Solutions relying entirely on calculator technology are not acceptable.") or a named method such as "using algebra", a correct answer with no working, or an argument in words where algebra was asked for, scores 0 or a special case.
- Elsewhere on the pure papers, write the method anyway: a wrong answer on its own scores nothing, but a correct method with a slip keeps its M marks.
- On the Statistics part of Paper 3 a bare correct answer usually scores full marks unless the part says "show" or asks for working, but the distribution written before the number is often a mark of its own.
- If you make two attempts and cross neither out, the examiner marks the most complete final answer, which may not be the one you want: cross out the other.
Prove that the sum of any four consecutive integers is never a multiple of 4.
(3)
Let the integers be , , and , where .
B1 (a general set of four consecutive integers)
M1 (sum written as a multiple of 4 plus a remainder)
is a multiple of 4, so the sum leaves remainder 2 when divided by 4.
Hence the sum of any four consecutive integers is never a multiple of 4.
A1* (reason and closing statement)
Answer: the sum is always 2 more than a multiple of 4.
A candidate who stops at "" without explaining why it is not a multiple of 4 scores B1 M1 A0: " is not divisible by 4" needs the reason, the remainder of 2.
(a) Express in the form , where and are constants to be found. (2)
(b) Hence prove that for all real values of . (2)
(a) M1 (half the coefficient of , and its square subtracted)
, so , A1
(b) for all real M1 (the square stated to be non-negative, with )
so .
Hence for all real values of .
A1* (closing statement)
Answer: the least value of the expression is , at , which is the turning point in the sketch above.
Writing "" is false at and loses the A1*; "squares are always positive" is not accepted either.
Given that and are real numbers such that
show that .
(2)
M1 (expanded and simplified correctly)
Dividing both sides by , which is negative because , reverses the inequality: A1* (the reversal stated with its reason)
Answer: .
A candidate who writes from dividing, then "so " to match the printed answer, scores M1 A0: the printed answer must follow from your lines, not be written after them.
Prove that for all positive real numbers and ,
Plan: a square is never negative, and since and are positive, and are real.
Start from the square of their difference.
for all positive and B1 (a true starting statement)
M1 (expanded, using and )
Dividing by 2 (positive, so the sign is kept): for all positive and .
A1*
Answer: the mean of two positive numbers is at least the square root of their product, with equality only when .
Notice the direction of the argument: a proof that starts from the printed inequality and works down to "" has the logic back to front.
If you find the idea that way in rough, write the final proof starting from the true statement.
Prove that the difference between the squares of any two consecutive odd numbers is a multiple of 8.
(3)
Plan: write two consecutive odd numbers with one letter, expand both squares, subtract, and take out a factor of 8.
Let the numbers be and , where .
B1
M1 (both squares expanded, three terms each)
, and is an integer, so the difference is a multiple of 8.
A1*
Answer: the difference is .
Here one letter is right, because consecutive odd numbers are linked.
For two odd numbers that are not linked you would need and .
Finish every proof with a sentence that repeats the statement you were asked to prove, in the question's own words ("so ...
is a multiple of 8 for all integers ").
The examiners give this closing statement its own mark, and it is the mark that candidates lose most often on proof questions, even after correct algebra.
- Checking examples instead of proving. Substituting shows nothing about . It is tempting because it feels convincing; use a general letter instead.
- The same letter for unrelated numbers. "Let the odd numbers be and " proves the result only when the numbers are equal. Use and .
- "" for a square. can be zero, so write . The strict sign looks harmless, but it is false at .
- A reversal hidden or missed. When you divide by a quantity that is negative, the inequality reverses, and you must say so where it happens. Writing the right final sign without the reason loses the last mark.
- No closing statement. A proof that stops at "" is unfinished. Say what the line shows.
Check your understanding
1. Prove, using algebra, that the sum of any three consecutive even numbers is a multiple of 6. (3) Total [3]
2. (a) Express in the form , where and are constants to be found. (2)
(b) Hence prove that for all real values of . (2)
(c) Write down the minimum value of . (1)
Total [5]
3. A student wants to prove that is a prime number for every positive integer . The student works out the value for and , finds that each is prime, and writes "so the statement is proved".
(a) Give a reason why the student's argument is not a proof. (1)
(b) Show that the statement is not true when . (2)
Total [3]
4. Given that and are real numbers such that
show that .
(2) Total [2]
5. (a) Prove that for all real numbers and . (2)
(b) Hence prove that for all positive real numbers . (2)
Total [4]
6. Prove that, for all integers , is a multiple of 12. (3) Total [3]
Answers
1. Let the numbers be , and , where B1; sum M1; , and is an integer, so the sum is a multiple of 6 A1* (closing statement needed). An argument in words only ("even plus even is even ...") ignores "using algebra" and scores at most a special case.
2. (a) M1; , , A1
(b) for all real M1; so , hence for all real A1* ("" loses this mark)
(c) B1ft (their )
3. (a) Checking particular values does not show that the statement holds for every positive integer B1
(b) M1; , so it is not prime and the statement is not true A1 (the factorisation and the conclusion are both needed)
4. M1; dividing by , which is negative since , reverses the inequality, so A1* (the reversal and its reason must be stated)
5. (a) for all real , M1; A1*
(b) Let and , real since M1; then A1* (Allow a direct proof from or from divided by , with the sign of stated.)
6. M1; A1; , and is an integer, so it is a multiple of 12 for all integers A1*