TMUA Paper 2: Logic, Proof & Counterexamples

Paper 2 is the part of the TMUA that decides good scores from great ones, and it is the part almost nobody prepares properly. Where Paper 1 dresses up familiar maths, Paper 2 asks a different question entirely: not "what is the answer" but "does this argument actually hold". That shift catches out strong A-level students who have never been asked to reason formally. The good news, and the reason this guide exists, is that the skill is finite. There are only so many logical moves the examiners can test, and once you know them the paper stops feeling alien.

Why Paper 2 catches people out

Most maths teaching rewards getting to an answer. You learn a method, apply it, and the number at the end is either right or wrong. Paper 2 quietly removes the number. A typical question gives you a claim and four or five candidate statements, and asks which one must be true, or which deductions are valid, or where a printed proof goes wrong. There is often no calculation to hide behind.

That is unfamiliar territory because school maths rarely asks you to treat an argument as the object of study. Schools touch proof briefly, usually proof by deduction for a couple of identities, and move on. Paper 2 builds an entire paper out of that thin slice, then layers on logical vocabulary, quantifiers and the gap between a statement and its converse. None of the underlying maths is hard. The difficulty is that you are reasoning about statements rather than computing with them, and that is a genuinely different muscle. For the full split between the two papers, see Paper 1 vs Paper 2, and for where this sits in the wider course, the syllabus topics guide.

Necessary vs sufficient: the distinction everything hangs on

If you learn one thing from this guide, make it this. A condition is sufficient for a result if having it guarantees the result. A condition is necessary for a result if the result cannot happen without it. They are not the same, and the TMUA tests the difference relentlessly.

Take a simple example. Being a multiple of 4 is sufficient for being even: every multiple of 4 is even. But it is not necessary, because 6 is even without being a multiple of 4. Run it the other way: being even is necessary for being a multiple of 4 (no odd number is a multiple of 4) but not sufficient (6 again). The two ideas point in opposite directions, and questions are written precisely to tempt you into swapping them.

The clean test is to phrase the claim as an implication. "If a condition is sufficient for a result" means condition implies result. "If a condition is necessary for a result" means result implies condition. Whenever a question uses the words necessary or sufficient, rewrite it as an arrow in your head before you do anything else. The symbol $A \Rightarrow B$ reads "A is sufficient for B" and equally "B is necessary for A", and seeing both readings of the same arrow is what keeps you from flipping the logic.

Implications, converses and negation

An implication $P \Rightarrow Q$ says: whenever P holds, Q holds. The single most common Paper 2 trap is assuming the converse $Q \Rightarrow P$ comes free. It does not. "If it is raining, the ground is wet" does not give you "if the ground is wet, it is raining", because a burst pipe wets the ground too. The TMUA loves statements where the implication is true but the converse is false, and asks you to spot exactly that.

Two more relatives are worth knowing cold. The contrapositive of $P \Rightarrow Q$ is "not Q implies not P", and it is always logically equivalent to the original: if rain means wet ground, then dry ground means no rain. The inverse, "not P implies not Q", is equivalent to the converse, not to the original, so it carries the same risk. When a question chains several implications together, swapping any one for its converse or inverse quietly breaks the chain, and that broken link is usually the answer.

Negation is the other skill examiners assume you have and most candidates do not. To negate "all swans are white" you do not say "all swans are black", you say "there exists at least one swan that is not white". The negation of a "for all" is a "there exists", and vice versa. Negating "if P then Q" gives "P is true and Q is false", which is exactly the shape of a counterexample. Getting these flips right is half the battle on the reasoning questions, and it feeds directly into the next tool.

Counterexamples: one is enough

A universal claim, anything of the form "for all x, something holds", is destroyed by a single example where it fails. You do not need to explain why the claim is wrong in general. You just need one case. This is the cheapest, fastest move in your Paper 2 toolkit, and it turns several questions from a page of algebra into ten seconds of thought.

The skill is knowing where to look. The standard hunting grounds are the values people forget: zero, one, negatives, fractions between 0 and 1, and the boundary cases of any range. A claim like "$n^2$ is always greater than $n$" looks obvious until you try $n = 1$ (equal) or $n = 0$ or a fraction like one half, where squaring makes it smaller. When a question asks which of several statements is false, reach for counterexamples first and only prove the survivors. Crucially, a counterexample only disproves; it can never prove a universal claim true, since showing it works for a few values says nothing about the rest. That asymmetry, easy to break and hard to confirm, is the whole reason proof exists.

Proof techniques you need to recognise

Paper 2 does not ask you to write long proofs, but it does ask you to recognise valid ones and follow their logic. Three techniques cover almost everything.

Proof by exhaustion checks every case when there are finitely many. To prove a statement about the remainder when a square is divided by 4, you only need to test even and odd inputs, because every integer is one or the other. The art is reducing infinitely many cases to a handful by grouping them, and a proof by exhaustion is only valid if the cases genuinely cover all possibilities, which is a favourite place for the examiners to hide a gap.

Proof by contradiction assumes the opposite of what you want, then derives something impossible, forcing the assumption to be wrong. The classic is the proof that $\sqrt{2}$ is irrational: assume it equals a fraction in lowest terms, and you are driven to conclude both numerator and denominator are even, contradicting "lowest terms". Recognising the shape, "suppose not, reach an absurdity, therefore the original holds", lets you follow these quickly.

Proof by deduction is the familiar direct march from assumptions to conclusion using known rules, and a brief mention is due to proof by counterexample, which we have already met: the standard way to prove a "for all" statement false. Knowing which technique a question is using tells you what a valid version should look like, and that is exactly what you need to judge a printed proof. For the broader study plan around this, see how to prepare for the TMUA.

Spotting the flaw in a faulty proof

The hardest Paper 2 questions print a proof that reaches a true or false conclusion and ask you to find the line where the reasoning breaks. The trick is that the conclusion can be correct while the proof is still invalid: a broken argument that happens to land on a true statement is still a broken argument, and the TMUA tests whether you can tell the difference.

Work line by line and ask of each step, "does this actually follow from what came before". The usual culprits are familiar once you know them. Dividing by an expression that might be zero is the most common, and it manufactures false conclusions like "1 equals 2". Squaring both sides can introduce extra solutions that were never there. Assuming the converse, using $Q \Rightarrow P$ when you have only shown $P \Rightarrow Q$, slips an unproven step into the chain. A proof by exhaustion that misses a case, or a "for all" justified by a single example, are both invalid however convincing they read. Train yourself to distrust the smooth line, because the flaw is almost always the step that looks most innocent.

How to train Paper 2

Because the toolkit is finite, Paper 2 rewards deliberate practice more than any other part of the test. Start by getting fluent with the vocabulary: necessary, sufficient, implies, converse, contrapositive, for all, there exists. Until those are second nature you will keep misreading questions before you even begin.

Then drill by type rather than by paper. Do a run of necessary-versus-sufficient questions back to back until the rewrite-as-an-arrow habit is automatic, then a run of counterexample questions, then faulty-proof questions. Doing them in clusters builds the pattern recognition that scattered practice never quite delivers. When you get one wrong, the useful question is not "what was the answer" but "which logical move did I miss", because the same handful of moves recur across every sitting.

Start this early. Paper 2 reasoning is the slowest skill to feel natural, so it is the worst thing to leave until the final weeks. Build it first and you turn the feared half of the test into your most dependable marks. If you want a sense of how this fits the overall challenge, see is the TMUA hard, and for the marks these questions are worth, what counts as a good TMUA score.

Frequently asked questions