TMUA: Types of proof and counterexamples
Paper 2: types of proof and counterexamples.
- Section 2 (Paper 2) · Prf1-Prf5 Mathematical proof · spec Prf1
- Paper 2 only
- 14 free questions
- No calculator
What the specification covers
- Chains of deduction
- Cases such as even/odd or sign of x
- Proof by contradiction (e.g. irrationality, infinitely many primes)
- One counterexample disproves a 'for all' claim
Key ideas
- Direct proof: a chain of implications from what you know to what you want.
- Proof by cases: e.g.
even and odd; together the cases must cover everything. - Proof by contradiction: assume the statement is false and deduce something impossible.
- One counterexample disproves a 'for all' statement; examples never prove it.
Common mistakes
- Checking a few cases is not a proof.
- A counterexample must satisfy the hypothesis and fail the conclusion.
Exam tip
For 'which is a counterexample' questions, check each option against both halves of the statement.
Worked example
Worked example
The statement 'for every positive integer
Answer: D:
Practice questions
Try each question before opening the solution. No calculator: the TMUA does not allow one. Every answer here was checked independently before it was published, and each solution ends with the fastest reliable method.
Question 1
Which pair
, , , , ,
Show the answer and solution
Answer: B:
A counterexample needs both irrational and the sum rational.
Question 2
The statement 'for every positive integer
Show the answer and solution
Answer: D:
Question 3
The statement 'for every positive integer
Show the answer and solution
Answer: A:
Question 4
The statement 'for every positive integer
Show the answer and solution
Answer: B:
Question 5
The statement 'for every positive integer
Show the answer and solution
Answer: B:
Question 6
The statement 'for every positive integer
Show the answer and solution
Answer: E:
Question 7
The statement 'for every positive integer
Show the answer and solution
Answer: E:
Question 8
Which of the following is a counterexample to the statement: 'For every positive integer
Show the answer and solution
Answer: A:
A counterexample must satisfy the 'if' part and fail the 'then' part. With
Fast method: Discard options that fail the 'if' part straight away (they cannot be counterexamples), then test the 'then' part only for the rest.
Question 9
Which of the following is a counterexample to the statement: 'For every positive integer
Show the answer and solution
Answer: C:
A counterexample must satisfy the 'if' part and fail the 'then' part. With
Fast method: Discard options that fail the 'if' part straight away (they cannot be counterexamples), then test the 'then' part only for the rest.
Question 10
The function
Show the answer and solution
Answer: B:
Write
Fast method: Test
Question 11
The function
Show the answer and solution
Answer: A:
Write
Fast method: Test
Question 12
A student wants to prove, by contradiction, the statement 'If
- If
is not a prime greater than 3, then is not a multiple of 24 is not a prime greater than 3 and is not a multiple of 24 is a prime greater than 3 and is not a multiple of 24 is not a multiple of 24 is a prime greater than 3 and is a multiple of 24
Show the answer and solution
Answer: C:
A statement 'if P then Q' is false exactly when P is true and Q is false. A proof by contradiction assumes the statement is false, so it starts from:
Fast method: The negation of 'if P then Q' is 'P and not Q' (never another if-then statement). Find the option that keeps P and negates Q.
Question 13
A student wants to prove, by contradiction, the statement 'If
is not the sum of two odd squares and is not a perfect square is not the sum of two odd squares and is a perfect square- If
is not the sum of two odd squares, then is a perfect square is the sum of two odd squares and is not a perfect square is the sum of two odd squares and is a perfect square
Show the answer and solution
Answer: E:
A statement 'if P then Q' is false exactly when P is true and Q is false. A proof by contradiction assumes the statement is false, so it starts from:
Fast method: The negation of 'if P then Q' is 'P and not Q' (never another if-then statement). Find the option that keeps P and negates Q.
38 more types of proof and counterexamples questions
Each with a full worked solution and a fast-method note. They also appear in topic drills, spaced review and mock papers 3 to 10.
Keep going
The next topic in the specification: notes, a worked example and free questions.
Next: Deductions, conjectures and ordering proofsTMUA is run by UAT-UK. A Level Math Revision is independent: it is not affiliated with or endorsed by UAT-UK, Pearson VUE or any university. Every question here is our own.