TMUA Paper 2: logic and proof
Paper 2 (Mathematical Reasoning) is 20 multiple-choice questions in 75 minutes. It uses all the maths of Paper 1, and adds Section 2 of the specification: the logic of arguments, mathematical proof and identifying errors in proofs. A Level courses teach little of this, so it is where focused practice pays off most.
What Section 2 covers
| Spec code | Content | Our notes |
|---|---|---|
| Arg1 | True/false; and, inclusive or, not; if A then B; A if B; A only if B; A if and only if B; A statement is equivalent to its contrapositive, not its converse; No symbolic notation or truth tables are expected | Converse and contrapositive |
| Arg2 | A is sufficient for B: A ⇒ B; A is necessary for B: B ⇒ A; Testing each direction with examples and counterexamples | Necessary and sufficient conditions |
| Arg3-Arg4 | for all, for some (at least one), there exists; Negating: not (for all x, P) = there exists x with not P; Negating and/or statements (De Morgan in words) | Quantifiers and negation |
| Prf1 | 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 | Types of proof and counterexamples |
| Prf2-Prf5 | Deducing what must, could or cannot be true; Conjectures from small cases, then justification; Putting the lines of a proof in a valid order; Longer chains of reasoning | Deductions, conjectures and ordering proofs |
| Err1-Err2 | Dividing by something that may be zero (ab = ac does not give b = c); sin A = sin B does not give A = B; squaring both sides creates extra roots; Assuming the result, or checking only one direction of an 'if and only if' | Errors in purported proofs |
The specification notes that candidates will not be expected to use symbolic logic notation or to complete formal truth tables: questions are written in words.
The five ideas that decide most Paper 2 marks
- Turn every sentence into an arrow. 'A if B' is B ⇒ A; 'A only if B' is A ⇒ B; 'B is necessary for A' is A ⇒ B; 'B is sufficient for A' is B ⇒ A.
- Only the contrapositive is equivalent. A ⇒ B means the same as not B ⇒ not A; the converse B ⇒ A and the inverse not A ⇒ not B are different statements.
- Sufficient sits inside necessary. Draw the two solution sets: the smaller one is sufficient for the larger, the larger is necessary for the smaller.
- Negate quantifiers by swapping them. Not (for every x, P) is: there is an x with not P. Keep the order of the variables.
- Check each step of a proof on its own. Dividing by something that can be zero, squaring, square-rooting without ±, and dropping a modulus are where solutions are lost or gained.

How to prepare
- Learn the vocabulary exactly: 'only if', 'necessary', 'sufficient', 'for all', 'there exists', the converse and the contrapositive.
- Drill short logic questions until the translation is automatic: the Paper 2 logic trainer.
- Work through proof-error questions by checking each step on its own: does it follow for every value allowed?
- Sit timed Paper 2s: our mock papers and the official past papers.
Examples
Example 1
What is the contrapositive of the statement: 'If
- If
is even, then is odd. is odd only if is even.- If
is odd, then is odd. - If
is even, then is even. - If
is even, then is even.
Show the answer and solution
Answer: E: If
The contrapositive of 'if A then B' is 'if not B then not A'. Here A is '
Example 2
For a real number
- necessary but not sufficient
- necessary and sufficient
- neither necessary nor sufficient
- sufficient but not necessary
Show the answer and solution
Answer: D: sufficient but not necessary
If
Example 3
Which of the following is the negation of the statement: 'For every real number
- There is a real number
and an integer with . - For every real number
, every integer satisfies . - For every real number
there is an integer with . - There is a real number
such that every integer satisfies . - There is an integer
such that every real number satisfies .
Show the answer and solution
Answer: D: There is a real number
'Not (for every
TMUA 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.