TMUA Paper 2: Mathematical Reasoning, from Syllabus to Strategy
- Papers
- 28
- Questions
- 826
- Free to try
- 2
- Paper format
- 20 multiple-choice questions in 75 minutes, covering Sections 1 and 2
- What it tests
- Constructing and analysing arguments; the maths stays within AS pure plus GCSE
- The three strands
- Logic Arg1 to Arg4, proof Prf1 to Prf5, errors Err1 and Err2
- Explicitly ruled out
- Symbolic notation and formal truth tables; induction is not in the current specification either
- Score and sittings
- Both papers scaled together into one score from 1.0 to 9.0; one sitting per admissions cycle
Based on the official specification and the official Notes on Logic and Proof covering the October 2026 and January 2027 sittings; before booking, check the specification UAT-UK has published for your own sitting.
- Paper 2 tests constructing and analysing arguments with Section 1 maths: the content stays within AS pure maths plus GCSE, and the difficulty lies in reasoning training, not new knowledge.
- The logic content is Arg1 to Arg4 (conditionals, converse and contrapositive, necessary and sufficient, quantifiers and negation); the specification explicitly rules out symbolic notation and formal truth tables.
- The official list has exactly four proof types: direct deduction, cases, contradiction and disproof by counterexample; mathematical induction is not in the current specification, so do not budget time for it.
- Error-spotting is its own strand: the specification names claiming b = c from ab = ac, and A = B from sin A = sin B, which stand for the division-by-zero and non-reversible-step trap families.
- Follow the official preparation trio: read the specification, read the Notes on Logic and Proof, and answer practice papers under timed conditions; remember you may sit only once per admissions cycle.
Part 1 of 3
Sections 01 to 03
The official brief: conceptual knowledge applied to arguments
| Paper 1 · Applications of Mathematical Knowledge | Paper 2 · Mathematical Reasoning | |
|---|---|---|
| What it asks of you | Using your maths to solve problems set in a variety of contexts | Thinking about the mathematics itself: is a statement true, does a deduction follow, where does a proof go wrong |
| Syllabus scope | Section 1 | Section 1 and Section 2 |
| Underlying toolkit | The mathematics set out in Section 1 | Exactly the same Section 1 content, with a layer of reasoning about it added on top |
How the syllabus is built: Section 1 underneath, Section 2 on top
The TMUA specification
Section 1 serves both papers; Section 2 belongs to Paper 2 alone
Section 1 · Part 1Shared by both papers
- Almost all within AS level pure mathematics
Section 1 · Part 2Shared by both papers
- Almost all within a Higher Level GCSE course
Section 2 · LogicArg1 to Arg4
- Arg1 true and false, and/or/not, four conditional forms, converse and contrapositive
- Arg2 necessary and sufficient
- Arg3 quantifiers: for all, for some, there exists
- Arg4 negating statements built from those terms
Section 2 · ProofPrf1 to Prf5
- Prf1 four proof types: deduction, cases, contradiction, counterexample
- Prf2 deducing implications from given statements
- Prf3 conjecturing from small cases, then justifying
- Prf4 reordering shuffled statements into a proof
- Prf5 problems needing a sophisticated chain of reasoning
Section 2 · ErrorsErr1 and Err2
- Err1 identifying errors in purported proofs
- Err2 familiarity with common error types
Tap a branch to unfold
The logic strand, Arg1 to Arg4: conditionals to quantifiers
Arg1
Truth, connectives and conditionals
Or is inclusive (A or B allows both); four conditional forms; a statement and its contrapositive always agree, while the converse is independent
Arg2
Necessary and sufficient
Understanding and using the terms necessary and sufficient
Arg3
Quantifiers
For all, for some, there exists, with the official gloss that for some means for at least one
Arg4
Negation
Negating statements built from any of the terms above
Part 2 of 3
Sections 04 to 06
What the specification rules out: symbols and truth tables
Do not work through a formal logic textbook
The language itself is part of the challenge
Truth tables are never demanded, yet remain a good private tool
The proof strand, Prf1 to Prf5: four proof types, four skills
Direct deductive proof
Step by step from the given conditions to the conclusion
Proof by cases
Split the problem into exhaustive cases and settle each one
Proof by contradiction
Assume the conclusion fails, then derive something impossible
Disproof by counterexample
Overturn a general claim with one concrete instance
Prf2 deducing implications from given statements
Prf3 making conjectures from small cases, then justifying them
Prf4 rearranging shuffled statements into a complete proof
Prf5 problems requiring a sophisticated chain of reasoning
Mathematical induction is not on the syllabus
Four
Proof types on the official Prf1 list
Zero
Mentions of induction in the specification or the official notes
Oct 2026 · Jan 2027
The two sittings covered by the specification used here
Part 3 of 3
Sections 07 to 09
The errors strand, Err1 and Err2: two named classic mistakes
| The step that fails | Why it does not follow | |
|---|---|---|
| Claiming b = c from ab = ac | It amounts to dividing both sides by a | A might equal 0, and then the original equation holds for any b and c whatsoever, so nothing follows |
| Assuming A = B from sin A = sin B | It inverts an operation that is not one-to-one | The sine function takes the same value at different angles, so sin A = sin B cannot pin down A = B |
| Cancelling the squares in x² = y² | The same non-reversible move, applied to squaring | From x² = y² you may conclude only that x = ±y; cancelling throws away half the cases |
The first two rows are named in the specification; the third is a common variant of the same trap. Many widely circulated fake proofs of absurd conclusions hide exactly one division by zero at their core.
The official Notes on Logic and Proof: written for this paper
Read it through at the very start
Then move into past-paper work
Return to the notes when you slip
Two or three passes across a cycle
Preparation strategy: pacing, materials and scoring reality
Time and questions
75 minutes for 20 questions
Reasoning and error questions carry more reading than computation
What you may use
No formulae booklet, no calculator, no dictionary
Every formula has to come from memory
Wrong answers
No penalty
So never leave a blank
Sittings
Only once within an admissions cycle
October versus January is a choice of date, not a second attempt
About 4.5
Where the scale is designed to place a typical candidate
Roughly 10%
Share scoring above 7.0, per the October 2025 Explanation of Results
6.5 = 5.0
Durham states that a 6.5 from 2023 equates to a 5.0 from 2024 onwards
Frequently asked questions
What does TMUA Paper 2 test, and how is it different from Paper 1?
Do I need mathematical induction for the TMUA?
Does TMUA Paper 2 require truth tables or logic symbols?
What are the Notes on Logic and Proof, and should I read them?
Is Paper 2 harder than Paper 1, and does it have its own score?
I have never studied logic or proof. How do I start preparing for Paper 2?
Other TMUA preparation guides
- TMUA Paper 1: Applications of Mathematical Knowledge
- TMUA Logic and Proof: The Complete Paper 2 Reasoning Guide
- The TMUA Syllabus in Full: Section 1, Section 2 and Every Topic Boundary
- The TMUA revision plan: from registration to results
- TMUA time management: pacing, guessing and stamina across both papers
- TMUA Common Mistakes: Where Strong Candidates Lose Marks
- How TMUA Scoring Works: From Rasch Scaling to University Data
- TMUA test day: from arriving at the centre to reading your score
- TMUA vs MAT: After the Switch
- TMUA vs ESAT: The Course Decides, Not You
- TMUA vs STEP: One Screens, One Seals the Offer
- TMUA Registration and Test Dates for 2027 Entry
- TMUA score statistics: where you actually sit
- TMUA sittings compared: October 2025 against January 2026
- TMUA overseas candidates: the official numbers, and where they stop
- TMUA candidate numbers: how big the 2026 cohort really was
FrontierVUE is an independent practice platform. It is not affiliated with or endorsed by UAT-UK, Pearson, OCR, the University of Cambridge, Imperial College London, or any official admissions-test owner.
Put it into practice
28 TMUA papers on FrontierVUE, including 10 Frontier Original mocks built to the current format, every question with a worked solution. The first 2 papers are free.