Pure: Proof
Mathematical proof is a logical, rigorous argument that shows a mathematical statement is true for every case it covers, using algebra and accepted facts rather than a handful of examples. A Level Maths requires four methods: proof by deduction, proof by exhaustion, disproof by counter-example, and proof by contradiction, examined throughout the Pure papers.
Before you start
No prerequisites. You can start here.
Method
- Identify which proof method the question needs: deduction (direct algebra), exhaustion (check every case in a finite set), counter-example (find one case that fails), or contradiction (assume the opposite and find a contradiction).
- For deduction, represent the numbers algebraically (e.g. 2n for even, 2n+1 for odd) and manipulate the expression until the required property is obvious.
- For exhaustion, list every case in the finite set and verify the statement holds in each one, with no case skipped.
- For counter-example, test small or unusual values (0, negative numbers, non-integers) until one breaks the statement, then state clearly why it fails.
- For contradiction, assume the negation of the statement is true, follow logical steps to reach an impossible conclusion, then conclude the original statement must be true.
- Always finish with a clear concluding sentence linking the algebra back to the original claim.
Common mistakes
MistakeChecking several numerical cases and treating the pattern as a proof that the statement holds for every permitted value.
InsteadIntroduce a general integer or exhaust every possible case in a finite set. Numerical examples can suggest a claim, but they cannot prove an infinite statement.
MistakeGiving a counter-example that does not satisfy the domain or conditions stated in the original claim.
InsteadCheck that the chosen value meets every hypothesis, then show explicitly which part of the conclusion fails for that value.
MistakeIn a proof by contradiction, assuming the original statement and then trying to derive the same statement again.
InsteadAssume the logical negation of the claim, derive an impossibility from that assumption, and then state why the original claim follows.
Worked examples
Example 1
Prove that the sum of any two even integers is always even.
- Let the two even integers be 2m and 2n, where m and n are integers.
- Form the sum: 2m + 2n.
- Factorise: 2m + 2n = 2(m + n).
- Since m + n is an integer, 2(m + n) is a multiple of 2, so it is even.
- Final answer: the sum of any two even integers is always even (proved).
Example 2
Prove by exhaustion of residue classes that n^5 - n is divisible by 30 for every integer n.
- Modulo 2, every integer has residue 0 or 1, and r^5 - r is 0 for both residues. Therefore n^5 - n is divisible by 2.
- Modulo 3, the residues 0, 1 and 2 give r^5 - r equal to 0, 0 and 30 respectively, so n^5 - n is divisible by 3.
- Modulo 5, the residues 0, 1, 2, 3 and 4 give r^5 - r equal to 0, 0, 30, 240 and 1020 respectively. Each is divisible by 5.
- Thus n^5 - n is divisible by 2, by 3 and by 5 for every integer n.
- The integers 2, 3 and 5 are pairwise coprime, so a number divisible by all three is divisible by 2 x 3 x 5 = 30.
- Final answer: n^5 - n is divisible by 30 for every integer n.
Example 3
For integers a and b, consider the claim: if a+b is odd, then a^2+b^2 is not divisible by 4. Prove the claim algebraically, write its converse, and decide whether the converse is true.
- Assume a+b is odd. If a and b were both even, their sum would be 2(r+s); if both were odd, it would be 2(r+s+1), where r and s are integers. Both sums are even, so a and b must have opposite parity.
- The expression a^2+b^2 is unchanged when a and b are interchanged. We may therefore label the even integer a = 2r and the odd integer b = 2s+1, with r and s integers.
- Substitute and expand: a^2+b^2 = (2r)^2+(2s+1)^2 = 4r^2+4s^2+4s+1 = 4(r^2+s^2+s)+1.
- Since r^2+s^2+s is an integer, the sum of the squares leaves remainder 1 on division by 4, so it is not divisible by 4. This proves the original implication for every permitted pair.
- The converse reverses the hypothesis and conclusion: if a^2+b^2 is not divisible by 4, then a+b is odd. The proof above does not establish this reversed claim.
- Test a = 3 and b = 5. Then a^2+b^2 = 9+25 = 34 = 4 x 8+2, so the converse hypothesis holds, but a+b = 8 is even. This permitted pair has a true hypothesis and a false conclusion, disproving the converse.
- Final answer: the original claim is true, but its converse is false, as a = 3, b = 5 shows. Not being divisible by 4 is insufficient to conclude that a+b is odd.
Practice questions
Q1[3 marks]Prove that the difference between any two odd integers is always even.Show answer
Answer: Difference = (2m+1) - (2n+1) = 2m - 2n = 2(m-n), a multiple of 2, so always even.
Q2[3 marks]Prove that the square of any even integer is always even.Show answer
Answer: (2n)^2 = 4n^2 = 2(2n^2), a multiple of 2, so always even.
Q3[3 marks]Find a counter-example to disprove the statement: for every positive integer n, 2^n > n^3.Show answer
Answer: n = 9: 2^9 = 512, 9^3 = 729, and 512 < 729, so the statement is false.
Q4[4 marks]Prove by contradiction that there is no smallest positive real number.Show answer
Answer: Assume q is the smallest positive real number; q/2 is also positive and q/2 < q, contradicting q being smallest, so no such number exists.
Q5[4 marks]Prove that if n^2 is divisible by 3 (n an integer), then n is divisible by 3.Show answer
Answer: If n = 3k+1 or 3k+2, n^2 leaves remainder 1 when divided by 3 in both cases, so by the contrapositive n must be divisible by 3 whenever n^2 is.
Q6[6 marks]Prove by contradiction that sqrt(3) is irrational.Show answer
Answer: Assume sqrt(3) = a/b in lowest terms; then a^2 = 3b^2 forces a and then b to both be divisible by 3, contradicting lowest terms, so sqrt(3) is irrational.
Exam-style questions
Written in the style of a A Level Maths exam paper, with a full mark scheme.
Exam tips
- Define every algebraic variable and its domain before manipulating it, such as stating that an introduced variable is an integer.
- For divisibility proofs, finish by displaying the expression as the required divisor times an integer and identify why the remaining factor is an integer.
- In proof by exhaustion, state the complete set of cases or residue classes so it is clear that none has been omitted.
Q1[4 marks]Prove that the product of any two consecutive even integers is divisible by 8.Show mark scheme
Tick each line you got.
Nothing ticked yet - 4 available
Q2[3 marks]Disprove the statement: for every positive integer n, n^2 + n + 41 is prime.Show mark scheme
Tick each line you got.
Nothing ticked yet - 3 available
Q3[6 marks]Prove by contradiction that there are no two positive integers x and y for which x^2 - y^2 = 1.Show mark scheme
Tick each line you got.
Nothing ticked yet - 6 available
See real past-paper questions on Pure: Proof, organised by topic with official mark schemes
This topic in real past papers
We have tagged some boards' past papers question by question (not every board or year yet). This topic comes up in:
- AQA A Level Maths past papers: 15 questions across 13 papers, latest tagged June 2023
- OCR A Level Maths past papers: 12 questions across 10 papers, latest tagged June 2024
- WJEC A Level Maths past papers: 7 questions across 6 papers, latest tagged Summer 2024
- OCR AS Level Maths past papers: 6 questions across 6 papers, latest tagged June 2023
Free printable worksheet
Want more practice on paper? Download the Pure: Proof worksheet pack - 7 pages of exam-style questions with a full mark scheme. Free to download, no card or account. Print it for personal and classroom use.
This topic is chapter 1 of A Level Maths Pure Essentials, the whole course as one free printable PDF. Its worksheet is also chapter 1 of A Level Maths Pure Topic Workbook 1 and chapter 1 of A Level Maths 10-Minute Tests 1, free printable practice books.
Other versions of this worksheet: