Skip to main content

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 codeContentOur notes
Arg1True/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 expectedConverse and contrapositive
Arg2A is sufficient for B: A ⇒ B; A is necessary for B: B ⇒ A; Testing each direction with examples and counterexamplesNecessary and sufficient conditions
Arg3-Arg4for 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
Prf1Chains 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' claimTypes of proof and counterexamples
Prf2-Prf5Deducing 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 reasoningDeductions, conjectures and ordering proofs
Err1-Err2Dividing 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

  1. 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.
  2. 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.
  3. Sufficient sits inside necessary. Draw the two solution sets: the smaller one is sufficient for the larger, the larger is necessary for the smaller.
  4. Negate quantifiers by swapping them. Not (for every x, P) is: there is an x with not P. Keep the order of the variables.
  5. 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.
Diagram for TMUA Paper 2: the set where 'n is a multiple of 12' sits inside the set where 'n is a multiple of 4', so the first condition is sufficient and the second is necessary
Sufficient sits inside necessary: every multiple of 12 is a multiple of 4, not the other way round.

How to prepare

  1. Learn the vocabulary exactly: 'only if', 'necessary', 'sufficient', 'for all', 'there exists', the converse and the contrapositive.
  2. Drill short logic questions until the translation is automatic: the Paper 2 logic trainer.
  3. Work through proof-error questions by checking each step on its own: does it follow for every value allowed?
  4. Sit timed Paper 2s: our mock papers and the official past papers.

Examples

Example 1

What is the contrapositive of the statement: 'If n2 is odd, then n is odd'? (n is an integer.)

  1. If n is even, then n2 is odd.
  2. n2 is odd only if n is even.
  3. If n is odd, then n2 is odd.
  4. If n2 is even, then n is even.
  5. If n is even, then n2 is even.
Show the answer and solution

Answer: E: If n is even, then n2 is even.

The contrapositive of 'if A then B' is 'if not B then not A'. Here A is 'n2 is odd' and B is 'n is odd', so it is 'if n is even (not odd), then n2 is even'. Option 2 is the converse; option 3 is the converse's contrapositive (the inverse).

Example 2

For a real number x, the condition x2<4 is ______ for x<2. Which phrase fills the gap?

  1. necessary but not sufficient
  2. necessary and sufficient
  3. neither necessary nor sufficient
  4. sufficient but not necessary
Show the answer and solution

Answer: D: sufficient but not necessary

If x2<4 then −2<x<2, so x<2: the condition is sufficient. It is not necessary: x=−3 satisfies x<2 but not x2<4.

Example 3

Which of the following is the negation of the statement: 'For every real number x there is an integer n with n>x'?

  1. There is a real number x and an integer n with n≤x.
  2. For every real number x, every integer n satisfies n≤x.
  3. For every real number x there is an integer n with n≤x.
  4. There is a real number x such that every integer n satisfies n≤x.
  5. There is an integer n such that every real number x satisfies n≤x.
Show the answer and solution

Answer: D: There is a real number x such that every integer n satisfies n≤x.

'Not (for every x, P(x))' is 'there is an x with not P(x)'. And 'not (there is an n with n>x)' is 'every n has n≤x'. So the negation is 'there is a real x such that every integer n satisfies n≤x'. (The original statement is true, so its negation is false.)

All TMUA topics

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.