Loading...
Please wait while we set up your experience
TMUA Past Paper Walkthrough
A question-by-question breakdown of TMUA 2023 Paper 2. Topics, traps, and the approach that gets the mark.
TL;DR
Cambridge Assessment Admissions Testing did not publish a Technical Report for the 2023 TMUA sitting. The score estimates above are inferred from candidate forum reports, school feedback, and aggregated diagnostic data from TMUA.co.uk users. Treat these as informed estimates, not official figures.
TMUA 2023 Paper 2 sat at a meaningful transition point. It was the last sitting before the recalibrated 1.0–7.0 scale, and the last Paper 2 to use the slightly looser wording style that earlier papers had inherited from the original Cambridge mathematics test. The reasoning content is identical to what 2024 tests, but the prose around it is more forgiving.
The most useful takeaway from this paper is that you cannot bluff Paper 2. Every wrong answer in the multiple-choice set corresponds to a specific kind of misreading: dropping a quantifier, swapping necessary and sufficient, or treating an existential claim as a universal one. The students who scored 6.5 and above were the ones who could name the mistake they almost made.
The other lesson is that Paper 2 in 2023 rewarded a small library of counterexamples. The same handful of edge cases — zero, the empty set, constant functions, the integer 1 — disposed of half a dozen distractors across the paper. Memorising that library is cheaper than discovering each counterexample under exam pressure.
Questions are paraphrased to respect Cambridge Assessment's copyright. For the verbatim wording, work through the official paper from the UAT-UK question bank, then return to this guide for the strategy notes.
Setup. A simple conditional is given, and the candidate must identify its contrapositive from four candidate forms.
What it tests. Whether you reliably distinguish contrapositive ('not Q implies not P') from converse ('Q implies P') and inverse ('not P implies not Q').
Approach. Write the four logically related forms in a column and match by symbol.
Setup. A set is described by a predicate involving inequalities. The candidate must select the answer that correctly enumerates or describes the set.
What it tests. Translation from predicate logic to a concrete set listing.
Approach. Construct the set element by element and match against the answer choices.
Setup. A universal statement is given. The candidate must select the correct negation among four candidates.
What it tests. Negation of a universal claim as an existential claim about the opposite predicate.
Approach. Apply the rule: not(for every x, P(x)) becomes (there exists x, not P(x)). Reject paraphrases that drop the predicate negation.
Setup. Two conditions are related. The candidate must determine whether the first is necessary, sufficient, both, or neither for the second.
What it tests. Bidirectional implication testing.
Approach. Test the implication left-to-right and right-to-left with a counterexample. The answer is determined by which directions hold.
Setup. A general claim about real-valued functions is made. The candidate must select the function that serves as a counterexample.
What it tests. Familiarity with standard counterexamples: constant functions, sin, sign function, piecewise constructions.
Approach. Test each candidate function against the claim. The counterexample usually involves a degenerate or piecewise function.
Setup. Three sets are defined by their elements. The candidate must determine which of the answer choices correctly describes an element relationship.
What it tests. Direct set membership reasoning.
Approach. Compute the relevant sets explicitly and test each answer choice.
Setup. Three conditional statements connect three propositions. The candidate must determine which conclusion follows.
What it tests. Modus ponens chained over three steps, plus recognition of when a chain is broken.
Approach. Map each statement to a symbol, chain the implications, and identify the conclusion that follows by valid inference rules.
Setup. A claim about properties of integers is made. The candidate must identify the smallest integer counterexample.
What it tests. Familiarity with edge cases in number theory: 0, 1, negative integers, primes, perfect squares.
Approach. Test small values (0, 1, 2, -1) and check whether the claim holds. The counterexample is almost always among these.
Setup. Two compound propositions are given. The candidate must determine whether they are logically equivalent.
What it tests. Truth-table verification or algebraic manipulation of logical connectives.
Approach. Build a truth table for both propositions over the four truth assignments. Equivalence holds iff the final columns match.
Setup. A short argument with two premises and a conclusion is given. The candidate must determine which formal pattern the argument fits.
What it tests. Recognition of valid patterns (modus ponens, modus tollens, hypothetical syllogism) and fallacies (affirming the consequent, denying the antecedent).
Approach. Map each premise and the conclusion to symbolic form. Match against the canonical patterns.
Setup. Three sets are given. The candidate must determine which expression correctly describes the elements of a derived set.
What it tests. Comfort with unions, intersections, and complements in small explicit sets.
Approach. Compute the derived set element by element. Match against the answer choices.
Setup. Two statements differ only in the order of their quantifiers. The candidate must determine which is stronger or which implies the other.
What it tests. Understanding that 'for every…there exists' is weaker than 'there exists…for every'.
Approach. Construct a small example where the weaker statement holds but the stronger does not. The witness in the weaker statement is allowed to depend on the universal variable.
Setup. A short proof has one logically invalid step. The candidate must identify which step does not follow.
What it tests. Close reading of each inference step, and recognition of converse error, denying the antecedent, or division by zero in disguise.
Approach. Check each line of the proof against valid inference rules. The wrong step usually exploits a converse or an unjustified case split.
Setup. A statement combines disjunctions and conjunctions in a non-trivial way. The candidate must determine which logical equivalence is correct.
What it tests. Distribution of conjunction over disjunction and vice versa (De Morgan and its dual).
Approach. Apply distribution carefully, or build a truth table. The trap is that one of the distractors is the dual of the correct answer.
Setup. An argument is given with a gap between premises and conclusion. The candidate must identify the missing premise that makes the argument valid.
What it tests. Finding the minimal premise that closes the inferential gap.
Approach. Identify the gap, then test each candidate premise. The right answer is the smallest premise that, when added, makes the conclusion follow.
Setup. A pattern is given by its first few terms. The candidate must identify the general rule or the next term.
What it tests. Pattern extraction and verification.
Approach. Write the terms in a normalised form, look for the rule, verify by extension. The wrong answers usually fail at the next predicted term.
Setup. A compound statement involves a conjunction inside a quantifier. The candidate must select the correct negation.
What it tests. De Morgan's law inside quantifier scope.
Approach. Negate the quantifier first, then apply De Morgan to the inside. Confirm with a small test case.
Setup. Several implications connect five propositions. The candidate must determine which inference is valid.
What it tests. Building a directed graph of implications and reading off valid chains.
Approach. Draw the graph with propositions as nodes and implications as arrows. Valid inferences are exactly the paths in the graph.
Setup. Four candidate conditions are offered. The candidate must select the weakest condition that still guarantees a stated outcome.
What it tests. Ranking conditions by strength and identifying the minimal sufficient one.
Approach. Order the candidates from weakest to strongest. Test the weakest first; if it implies the outcome, it is the answer.
Setup. A statement combines mixed quantifiers with a conditional structure. The candidate must determine which of four offered conclusions follows.
What it tests. Combined fluency in quantifier handling, conditional inference, and small witness construction.
Approach. Translate to formal notation, then test each conclusion against a small witness model. The correct conclusion holds on every model; the others fail on at least one.
Stop reading. Start practising.
Reading walkthroughs is half the job. The free diagnostic shows which topics from this paper you would actually drop marks on, with a TMUA-style grade at the end.
The themes that recur across this paper. Use them as a checklist when you sit a fresh mock.
Three questions on quantifier order or scope. Annotate which variable each quantifier governs before evaluating.
Two pure-negation questions plus several embedded ones. De Morgan inside quantifier scope needs to be automatic.
Always check both directions of an implication. The TMUA tests necessary-only and sufficient-only with the same frequency.
Carry a mental library of edge cases: 0, 1, the empty set, constant functions, the integer 1. They dispose of most distractors.
Affirming the consequent and denying the antecedent are the most common trap shapes. Recognise them at a glance.
Set notation is shorthand for logic. Element-by-element reasoning beats set-algebra manipulation.
Hidden-premise questions reward the smallest premise that closes the gap. Stronger premises are usually distractors.
TMUA proof errors hide in the middle of the chain. Read every line as if you have never seen the conclusion.
No. Cambridge Assessment did not publish a Technical Report or boundary table for the 2023 TMUA sitting. The estimates above are inferred from candidate reports and aggregated diagnostic data from TMUA.co.uk users. Treat them as informed estimates, not official figures.
The reasoning content is the same. The 2024 paper has slightly tighter wording, with more emphasis on quantifier-order questions. The 2023 paper is a fairer test of the same skills under marginally easier prose conditions. If you can handle 2023 cleanly, 2024 is within reach.
Yes, and you should weight it slightly more than Paper 1 if you are short on time. Paper 2 separates students by reading discipline, which is harder to fix close to the exam. Paper 1 fluency improves faster with practice.
You should know them well enough to write one in 30 seconds. You do not need to recall them under pressure, but you should not need to derive them either. The Logic Decoder PDF has these on a single reference card.
About 3.5 minutes per question across 20 questions. Easier questions (1, 2, 7, 11, 16) should take under two minutes each, banking time for the harder quantifier and proof questions later.
The Logic Decoder covers every Paper 2 topic with worked examples and is the right primer. Combine it with timed practice from the TMUA Pro question bank or the free diagnostic to build exam-day pacing.
Yes. The TMUA Pro mistake tracker logs Paper 2 errors by topic and reasoning pattern, then surfaces the topics costing you marks in your weekly review. The free diagnostic gives you a one-off snapshot of the same data.
10-question diagnostic with a TMUA-style score and weak-spot report.
Convert historic TMUA scores to the new 2026 scale and see a percentile band.
Timed mock exams with worked solutions and a TMUA grade. Free account required.
Logic Decoder, Top 30 Mistakes, and the Score Reality Check guide.
Shrey Garg read maths and economics at Cambridge. He co-built TMUA.co.uk after sitting the test himself and has since written the Logic Decoder, Top 30 Mistakes, and Score Reality Check guides. Walkthroughs reflect what he teaches one-to-one, not generic exam advice.
Start with the free diagnostic. Get a TMUA-style grade, a list of topics costing you marks, and a recommended next step in under 15 minutes.
Start free diagnostic