Paper 2 logic, one slip at a time

A complaint that comes up again and again on the forums: around 8 on Paper 1 practice, around 4 on Paper 2. The maths on Paper 2 is rarely harder. What changes is that you have to judge statements, and most wrong answers come from six slips. Every wrong option below is labelled with the slip that produces it.

The six slips

Read the one you recognise, then practise it on its own. The official Notes on Logic and Proof from UAT-UK cover the same ground in full and are worth reading once from start to finish.

1. The converse trap

You read "if A then B" as if it also said "if B then A".

“If nn is divisible by 4, then nn is even” is true. Its converse, “if nn is even, then nn is divisible by 4”, is false: take n=6n = 6. An option that reverses the arrow uses the same words as the question, which is exactly why it looks right.

The habit: Write the statement as A ⇒ B with arrows, then check which way each option's arrow points. Practise this slip (28 questions)

2. Contrapositive, converse and inverse mixed up

The contrapositive (not B ⇒ not A) is confused with the converse or the inverse.

Take “if x>2x > 2 then x2>4x^2 > 4”. The contrapositive, “if x2≤4x^2 \le 4 then x≤2x \le 2”, is true like the original. The inverse, “if x≤2x \le 2 then x2≤4x^2 \le 4”, is false: x=−3x = -3. Of the four versions, only the contrapositive always agrees with the original.

The habit: Only "not B ⇒ not A" is equivalent to "A ⇒ B". Swap AND negate, or do neither. Practise this slip (17 questions)

3. Necessary and sufficient mixed up

A condition that is needed is treated as enough, or the other way round.

For x2=9x^2 = 9: “x=3x = 3” is sufficient but not necessary (x=−3x = -3 also works). “x≥−3x \ge -3” is necessary but not sufficient (x=0x = 0). “A only if B” means A ⇒ B, so B is the necessary one.

The habit: "A is sufficient for B" means A ⇒ B. "A is necessary for B" means B ⇒ A. Turn the words into an arrow first. Practise this slip (15 questions)

4. Examples treated as proof

A few cases that work are taken as a proof, or a counterexample is chosen that breaks the conditions.

Checking n=1n = 1 to 1010 proves nothing about every nn. One counterexample is enough to disprove a “for all” claim, but it must meet the conditions: to disprove “if nn is prime then 2n−12^n - 1 is prime”, n=11n = 11 works (2047=23×892047 = 23 \times 89); n=4n = 4 does not, because 4 is not prime.

The habit: One counterexample disproves a "for all" claim. No number of examples proves one. Practise this slip (32 questions)

5. "For all", "there exists" and negations

The order of "for every" and "there is" is swapped, or a negation leaves a quantifier unchanged.

“For every real xx there is a yy with y>xy > x” is true. “There is a yy such that y>xy > x for every real xx” is false. The negation of “every student passed at least one paper” is “some student failed every paper”, not “every student failed a paper”.

The habit: To negate, swap every "for all" with "there exists" and negate only the final condition. Practise this slip (20 questions)

6. Invalid steps in a proof

A line of a proof that looks fine hides a division by zero, a squared inequality or a one-way implication.

The usual culprits: dividing both sides by something that could be zero, squaring both sides (from x+6=x\sqrt{x + 6} = x you get x=3x = 3 or x=−2x = -2, and −2-2 does not work), and writing ⇔ where a step only goes one way.

The habit: For each line, ask whether it follows from the one before in that direction only, or both ways. Practise this slip (26 questions)

How to use the practice

  • Do one slip per sitting. Mixing them hides which one is costing you marks.
  • Before you read the options, write the statement as arrows: A ⇒ B. Most of these questions are decided at that point.
  • When you get one wrong, read the slip name on the option you chose. If the same name keeps coming up, that is your slip.
  • Paper 2 gives you 75 minutes for 20 questions, so about 3 minutes 45 seconds each. Practise without a clock first, then with one.

Practice: the converse trap

28 questions in the bank train this slip.

Question 1 of 28, Paper 2 style (mathematical reasoning)About 2 min

It is known that the following statement is true:

For every integer n>3n>3, if nn is prime, then n2−1n^2-1 is divisible by 2424.

The integer kk satisfies k>3k>3, and k2−1k^2-1 is not divisible by 2424. Which of the following must be true?

0 answered, 0 correct.

Sources

  1. UAT-UK: Notes on Logic and Proof (June 2025, PDF)
  2. UAT-UK: about the TMUA
  3. UAT-UK: TMUA content specification (PDF)

Every question on this page is our own. None is taken from a past paper.