Edexcel A-level Mathematics · P · Pure mathematics
P1 Proof
Write proofs by deduction, exhaustion and contradiction, and disprove a false statement with a counter-example.
1/6A proof by deduction shows a result holds for every case
- A proof by deduction shows a result holds for every case
- Algebraic proofs finish by showing the required form
- Proof by exhaustion checks every possible case
- A single counter-example disproves a statement
- Proof by contradiction assumes the opposite and fails
- Each method suits a particular kind of statement
- Check your recall
- Practice: 10 questions
Part 1 of 6: A proof by deduction shows a result holds for every case
Suppose two odd numbers always seem to add to an even number. Checking more pairs makes the pattern likelier, but it never settles the matter. A proof by deduction starts from known facts. Valid steps then lead to the result for every case.
Letters make this possible. Any even number can be written , where is an integer. Any odd number can be written .
Key terms · tap one for its definition
proof by deduction
A proof by deduction is a logical argument that uses known facts and valid steps to establish a result for all cases.
integer
An integer is a whole number that may be positive, negative or zero.
Part 2 of 6: Algebraic proofs finish by showing the required form
Now put these letters to work. Most algebraic proofs follow the same four steps, and the final form depends on the claim. For a multiple of 3, the required form is 3 times an integer.
- Define the objects in the claim using letters.
- Expand and simplify the resulting expression.
- Factorise to reveal the form the claim names.
- Finish with a conclusion in words.
Worked example
Sum of three consecutive integers
- Let the integers be , and , where is an integer.
- Add them: .
- Factorise: .
- Since is an integer, is a multiple of 3.
Answer: The sum of any three consecutive integers is a multiple of 3.
End every proof with a short sentence in words. It should state that the result holds for all integers , because could stand for any integer.

Quick check
One question on the part you just read
Easy
Show answer and explanation
Answer: B · Worked explanation
Part 3 of 6: Proof by exhaustion checks every possible case
Sometimes one algebraic line cannot cover everything. Instead, the statement splits into separate cases. A common split is into even and odd integers, because every integer is one or the other. In proof by exhaustion, you show the statement is true in each case, and the cases together cover every possibility.
Worked example
An expression that is always even
- Every integer is even or odd, so two cases cover all possibilities.
- Case 1, : , which is even.
- Case 2, : .
- Factorise: , which is even.
Answer: Both cases give an even number, so is even for every integer .
The cases may also be a short list of values, such as every integer from 1 to 5. Checking each one then completes the proof.
Key term
proof by exhaustion
A proof by exhaustion is a proof that splits a statement into a finite set of cases and checks every case.
Part 4 of 6: A single counter-example disproves a statement
A proof shows a statement is always true. Showing it is false needs far less. One case where the statement fails is enough, and it is called a counter-example.
No number of true examples can prove a statement. A single false example can disprove it. To find one, try small values first, then try special values such as 0, 1 and negative numbers.
Worked example
Disproving a claim about primes
- Try small values: gives 13, gives 17 and gives 23. All are prime.
- Keep searching. For : .
- Factorise: , so 121 is not prime.
Answer: is a counter-example, so the statement is false.
Key term
counter-example
A counter-example is a single case that meets the conditions of a statement but makes its claim false.

Quick check
One question on the part you just read
Easy
Show answer and explanation
Answer: A · Worked explanation
Part 5 of 6: Proof by contradiction assumes the opposite and fails
Some results are hard to prove directly. Here you assume the statement is false. If that assumption leads to something impossible, the statement must be true. This is proof by contradiction.
It suits claims about irrational numbers. A rational number can be written as , where and are integers and . An irrational number cannot be written in that form.
Worked example
The square root of 2 is irrational
- Assume is rational. Then , where and are integers with no common factor.
- Square both sides: , so .
- So is even. The square of an odd number is odd, so must be even.
- Write . Then , so .
- So is even, and in the same way is even.
- Now and share the factor 2. This contradicts the assumption that they have no common factor.
Answer: The assumption is false, so is irrational.
Every step above follows from the one before it. The contradiction therefore comes from the opening assumption, not from the working. That is why the assumption must be false, and the opposite statement is proved.
Key terms · tap one for its definition
proof by contradiction
A proof by contradiction is a proof that assumes a statement is false and shows this assumption leads to an impossibility.
rational number
A rational number is a number that can be written as a fraction of two integers with a non-zero denominator.
irrational number
An irrational number is a number that cannot be written as a fraction of two integers.
Part 6 of 6: Each method suits a particular kind of statement
With four methods available, the form of the statement guides your choice. The table sets out when each one fits.
Choosing a proof method
- Method
- Deduction
- Use it when
- A general algebraic result is claimed
- What it shows
- True for all cases
- Method
- Exhaustion
- Use it when
- The cases are few and can be listed
- What it shows
- True in every case
- Method
- Counter-example
- Use it when
- A claim looks false
- What it shows
- The claim is false
- Method
- Contradiction
- Use it when
- A direct proof is hard, as with irrationals
- What it shows
- The opposite is impossible
Check your recall[14 marks]
6 written questions. Answer each one in your head or on paper, then open the mark scheme.
- 1.State[1 mark]
State why testing a few numbers does not prove a general statement.
Show mark schemeHide mark scheme
Model answer
Checking a few numbers covers only some cases, so it cannot show the statement holds for every case.
- 1 mark for stating that checking a few cases does not cover every case
- 2.Show[3 marks]
Show that the sum of any two consecutive odd integers is a multiple of 4.
Show mark schemeHide mark scheme
Model answer
Let the integers be and . Their sum is . Since is an integer, the sum is a multiple of 4.
- 1 mark for writing two consecutive odd integers as and
- 1 mark for simplifying the sum to
- 1 mark for factorising to and concluding that it is a multiple of 4
- 3.Give[2 marks]
Give a counter-example, with working, to the statement ‘ for every integer ’.
Show mark schemeHide mark scheme
Model answer
Take . Then , which is not greater than , so the statement is false.
- 1 mark for choosing a valid integer such as or
- 1 mark for showing that the inequality fails for that value
- 4.Explain[2 marks]
Explain why checking one even case and one odd case completes a proof by exhaustion for a statement about all integers.
Show mark schemeHide mark scheme
Model answer
Every integer is either even or odd, so the two cases cover every possibility. If the statement is true in both cases, it is true for all integers.
- 1 mark for stating that every integer is even or odd, so the cases are complete
- 1 mark for concluding that the statement is true for every integer when it holds in both cases
- 5.Describe[3 marks]
Describe how to begin a proof by contradiction that is irrational.
Show mark schemeHide mark scheme
Model answer
Assume is rational. Write it as , where and are integers with no common factor. Square both sides to get .
- 1 mark for assuming that is rational
- 1 mark for writing with integers and having no common factor
- 1 mark for squaring to obtain
- 6.Show[3 marks]
Show that the product of two odd integers is odd.
Show mark schemeHide mark scheme
Model answer
Let the integers be and . Their product is . This is one more than an even number, so it is odd.
- 1 mark for writing two odd integers as and
- 1 mark for expanding to
- 1 mark for factorising to and concluding that it is odd

Practice this topic
10 quick-fire multiple-choice questions, easy to hard. Tap an answer to see if you're right and the worked explanation. (The written questions with mark schemes are under “Check your recall” above.)
0 right0 of 10 answered
Includes the 2 quick checks in the note above.
EasyIdentify[1 mark]
Show answer and explanation
Answer: C · Worked explanation
MediumIdentify[1 mark]
Show answer and explanation
Answer: D · Worked explanation
MediumDetermine[1 mark]
Show answer and explanation
Answer: B · Worked explanation
MediumIdentify[1 mark]
Show answer and explanation
Answer: B · Worked explanation
MediumDetermine[1 mark]
Show answer and explanation
Answer: A · Worked explanation
HardIdentify[2 marks]
Show answer and explanation
Answer: B · Worked explanation
HardDetermine[2 marks]
Show answer and explanation
Answer: A · Worked explanation
HardIdentify[2 marks]
Show answer and explanation
Answer: A · Worked explanation