1 Proof — notes on one page
Every Edexcel A-level Maths 9MA0 specification point in 1, read straight through: 1 point with definitions, explanations, mark-scheme wording and worked examples. Practice questions are in the printable question pack.
Checked against Edexcel 9MA0 section 1. Review basis: the qualification registry sourced from the Pearson Edexcel Level 3 Advanced GCE in Mathematics (9MA0) specification; registry verification recorded 11 July 2026.
1.1 · Understand and use the structure of mathematical proof, from assumptions through logical steps to a conclusion; use proof by deduction, exhaustion, disproof by counter example, and contradiction (irrationality of √2, infinity of primes).
- A proof begins with stated assumptions, uses valid implications at every step and ends with a conclusion that matches the claim.
- Choose the proof form deliberately: deduction for a general algebraic chain, exhaustion for finitely many cases, a counterexample to disprove a universal claim, or contradiction by assuming the opposite.
- In the classic contradiction for , writing in lowest terms leads to both and being even, contradicting the lowest-terms assumption.
- Checking several examples is not a proof of a universal statement; in contradiction proofs, also make clear exactly why the derived result conflicts with the assumption.
- To prove there are infinitely many primes, assume a finite list, form their product plus one, and note that its prime divisor is not on the list, giving a contradiction.
Worked example
Prove by exhaustion that is even whenever is an integer.
- 1.Every integer is even or odd.
- 2.If , then .
- 3.If , then .
- 4.Both forms are divisible by , so the result holds for every integer .
Answer: The expression is even in both the even and odd cases for .
Common mistakes
- Don't attempt proof by exhaustion over a pattern with infinitely many possible cases.
- Don't assume the desired conclusion inside the argument instead of deriving it from stated assumptions.
Exam tip. For an exhaustion proof, identify the finite cases, show why each case is accepted or rejected, and finish with one conclusion. A cso final mark requires the complete proof to be correct, although earlier method marks depend on the question-specific scheme.