TMUA 2027 Entry | Test of Mathematics for University Admission Guide

TMUA 2027 Entry After the October Booking Deadline: Mathematical Knowledge, Reasoning, Timing and Preparation

The TMUA planning problem changed on 29 September 2026. Booking for the October 2026 sitting closed at 18:00 UK time on 28 September 2026, which was 01:00 Singapore time on 29 September. For a candidate reading this page now, the first question is no longer simply “How do I prepare for TMUA?” It is “Which sitting is valid for my course, and what should I do mathematically from this point?”

UAT-UK publishes two test sittings for the 2027-entry cycle: 12–16 October 2026 and 4–8 January 2027. Most Cambridge and Oxford applicants who require a UAT-UK test must use the October sitting. UAT-UK lists limited January exceptions, including mature applicants to a Cambridge mature college with a January admissions deadline and applicants to Oxford’s Astrophoria Foundation Year with a January admissions deadline. Applicants to other UAT-UK institutions may be able to use either sitting, but the university and exact course remain authoritative.

That current-state distinction is important because mathematical preparation cannot repair an invalid admissions route. Confirm the test requirement and sitting first. Then build the preparation system.

Current 2027-entry TMUA timeline

October Test Sitting 1 runs from 12 to 16 October 2026. October booking is closed.

For January Test Sitting 2, UAT-UK states that access-arrangement and bursary applications reopen on 5 October 2026. January booking opens on 26 October 2026 at 15:00 GMT. The deadline to request January access arrangements is 7 December 2026 at 18:00 GMT. The January bursary deadline is 14 December 2026 at 18:00 GMT. January booking closes on 21 December 2026 at 18:00 GMT. The test window is 4–8 January 2027.

Do not treat those January dates as permission to sit in January. First verify that January is valid for the course and applicant category.

TMUA format

TMUA lasts 2 hours 30 minutes in total and contains two 75-minute papers.

Calculators are not permitted. Dictionaries are not permitted. UAT-UK states that candidates do not lose marks for incorrect answers. There is no universal pass/fail score. Universities use TMUA scores as one part of their admissions processes.

The average time budget

Each paper gives:

[ 75 ext{ minutes}div20 ext{ questions}=3.75 ext{ minutes per question}. ]

That is a much larger per-question budget than ESAT, but TMUA questions can demand more sustained reasoning. A candidate should not force a uniform 3 minute 45 second allocation. Some questions collapse quickly once the decisive observation is found. Others deserve several minutes. The paper strategy should protect time for both.

Paper 1: Applications of Mathematical Knowledge

Paper 1 rewards the ability to take familiar school Mathematics and use it in unfamiliar arrangements. A candidate may know every underlying topic and still lose time because the question does not resemble the standard textbook form.

Strong Paper 1 preparation therefore includes:

• algebraic manipulation without calculator dependence;
• functions and graphs;
• equations and inequalities;
• coordinate and geometric reasoning;
• sequences and proportional relationships;
• exact arithmetic and estimation;
• recognising when a problem can be transformed into a simpler equivalent form;
• testing options or boundary cases efficiently.

Paper 2: Mathematical Reasoning

Paper 2 adds explicit emphasis on reasoning and elementary logic. The learner needs to distinguish a statement from its converse, understand implication, use counterexamples, track necessary and sufficient conditions and decide what follows from given information.

That does not mean Paper 2 is a formal university proof exam. It means the candidate must control the logic inside mathematical claims.

Logic failure 1: converse confusion

Statement:

“If an integer is divisible by 6, then it is divisible by 3.”

This is true.

Converse:

“If an integer is divisible by 3, then it is divisible by 6.”

This is false; (9) is a counterexample.

A candidate who treats implication as reversible will make mathematically polished but logically invalid decisions.

Logic failure 2: necessary versus sufficient

For a real number (x), the condition (x>2) is sufficient for (x>0), but it is not necessary. A positive number such as (x=1) satisfies (x>0) without satisfying (x>2).

Ask two questions:

• If A happens, must B happen?
• If B happens, must A have happened?

These are different directions.

Logic failure 3: one example is not a universal proof

Testing:

[ 1^2+1=2,quad2^2+2=6,quad3^2+3=12 ]

suggests that (n^2+n) is even for integers (n). The reason is structural:

[ n^2+n=n(n+1), ]

a product of consecutive integers, one of which must be even.

Examples reveal. Structure establishes.

Logic failure 4: “not all” is not “none”

The negation of “all students solved the problem” is not “no students solved the problem”. It is “at least one student did not solve the problem”.

Quantifier control matters in reasoning questions.

Original TMUA-style practice principle: identify the decisive statement

The examples below are original BTT practice material, not copied from TMUA papers.

Practice 1: implication

Let (n) be an integer. Which statement is always true?

A. If (n^2) is odd, then (n) is odd.

B. If (n^2) is even, then (n) is odd.

C. If (n) is even, then (n+1) is even.

D. If (n) is divisible by 3, then (n) is divisible by 6.

A is true. If (n) were even, its square would be even. Therefore an odd square implies an odd integer.

Practice 2: counterexample

Claim: for every real (x), if (x^2>x), then (x>1).

Take (x=-1). Then:

[ x^2=1>-1=x, ]

but (x ot>1). The claim is false.

One decisive counterexample is stronger than many confirming examples.

Practice 3: algebraic compression

If:

[ x+rac1x=4, ]

find:

[ x^2+rac1{x^2}. ]

Square the given relationship:

[ x^2+2+rac1{x^2}=16, ]

so:

[ x^2+rac1{x^2}=14. ]

The fastest route uses the structure already given.

No calculator means representation choice matters

TMUA is designed so that school Mathematics can be applied without a calculator. The candidate should therefore become fluent with exact forms, factorisation, fractions, surds, proportional reasoning and estimation.

Consider:

[ rac{101^2-99^2}{2}. ]

Difference of squares gives:

[ rac{(101-99)(101+99)}2 =rac{2cdot200}{2} =200. ]

Expanding both squares first is mathematically valid and strategically weak.

Do not over-solve a multiple-choice question

A written school solution often aims to show a complete derivation. TMUA aims to test the candidate’s reasoning. If the answer can be established by sign, parity, bounds, substitution or elimination of impossible options, a long derivation may waste time.

But the shortcut must still be mathematically controlled. “It looks like C” is not a method. “A and B have the wrong sign, D exceeds the upper bound, therefore C is the only possible option” is reasoning.

Paper 1 error taxonomy

Paper 2 error taxonomy

Read Notes on Logic and Proof actively

UAT-UK specifically recommends its Notes on Logic and Proof for TMUA Paper 2. Do not read them as passive theory. Turn each logical form into three things:

1. a plain-English statement;
2. a true mathematical example;
3. a false near-neighbour or counterexample.

This converts vocabulary into decision skill.

Historic TMUA papers remain useful

UAT-UK publishes an archive of historic TMUA papers and worked answers. Although TMUA is now computer-based, UAT-UK states that the content specification and question style remain suitable for preparation.

Use the archive in phases:

• untimed for method discovery;
• timed in small clusters for pacing;
• full-paper simulation for endurance;
• delayed reattempt for transfer.

Do not measure progress only by percentage correct

Track:

• median time per correct question;
• number of questions abandoned productively;
• number of errors caused by algebra rather than concept;
• number of Paper 2 errors caused by logical direction;
• accuracy after returning to a skipped problem;
• quality of guesses when full solution is unavailable.

A candidate can improve materially before a raw score moves sharply.

The two-pass Paper 1 model

Pass 1: collect questions whose structure is visible within the first reading.

Pass 2: return to questions requiring deeper algebra, unusual representation or multi-step reasoning.

Do not confuse difficulty with value. A hard early question is worth the same raw mark as an easier later question.

The two-pass Paper 2 model

Paper 2 often rewards identifying the logical skeleton before calculating. On the first pass, answer claims whose truth or falsity can be decided quickly from a definition, counterexample or implication structure. On the second pass, tackle the more entangled reasoning chains.

Stop-loss conditions

Move on when:

• you have reread the question twice and still cannot state the target;
• the algebra is expanding rapidly without clarifying the structure;
• you are repeating the same manipulation;
• the candidate options suggest a faster test route;
• the time spent is now threatening later questions.

Return strategy

When you return to a skipped question, do not resume the same failed line automatically. Re-read the target and ask:

• Can I test the options?
• Can I use a graph mentally or sign analysis?
• Can I substitute a simple value?
• Can I attack the converse?
• Can I find a counterexample?
• Can I reduce the problem to a known identity?

Original reasoning set 1: necessary condition

If (x^2=9), then (x=pm3). Which condition is necessary for (x^2=9)?

A. (x>0)

B. (|x|=3)

C. (x=3)

D. (x<0)

B is necessary and sufficient.

Original reasoning set 2: sufficient but not necessary

Which condition is sufficient but not necessary for (x^2>4)?

One possible condition is (x>3). It guarantees (x^2>4), but (x=-3) also satisfies (x^2>4), so (x>3) is not necessary.

Original reasoning set 3: domain check

Solve:

[ rac{x-2}{x+1}=0. ]

A rational expression equals zero when the numerator is zero and the denominator is non-zero. Therefore (x=2). The domain restriction (x e-1) remains part of the reasoning.

Original reasoning set 4: inequality structure

For real (x), solve:

[ (x-1)(x+3)>0. ]

The product is positive when both factors have the same sign:

[ x>1 ]

or:

[ x<-3. ]

The solution is:

[ (-infty,-3)cup(1,infty). ]

Original reasoning set 5: disprove efficiently

Claim: if (a^2=b^2), then (a=b).

Counterexample:

[ a=2,quad b=-2. ]

Then (a^2=b^2=4) but (a e b).

Paper 2 vocabulary that should become automatic

• implies;
• if and only if;
• necessary;
• sufficient;
• converse;
• contrapositive;
• counterexample;
• for all;
• there exists;
• not all;
• unique;
• equivalent.

If the language itself consumes working memory, the reasoning becomes slower.

A six-week TMUA build

Week 1: specification and algebra audit

Repair fractions, indices, surds, functions, equations and inequalities.

Week 2: Paper 1 structure

Practise unfamiliar applications with multiple routes.

Week 3: logic and proof language

Work through implication, converse, contrapositive, quantifiers and counterexamples.

Week 4: timed clusters

Alternate Paper 1 and Paper 2 mini-sets.

Week 5: full papers

Use 75-minute conditions and practise skipping/returning.

Week 6: calibration

Repair recurrent failures, rehearse the computer-based environment and reduce last-minute novelty.

A ten-week build for earlier preparation

Weeks 1–2: prerequisite Mathematics.

Weeks 3–4: untimed Paper 1 problem solving.

Weeks 5–6: Paper 2 logic and reasoning.

Weeks 7–8: timed mixed sets and historic papers.

Week 9: complete simulations and recovery practice.

Week 10: maintenance, test logistics and current admissions verification.

Computer-based test preparation

UAT-UK provides specimen and practice tests in the Pearson test player. Use them to learn navigation, accessibility features and the feel of reading Mathematics from the live interface.

Do not let the first full computer-based experience be the live test.

Rough working

UAT-UK provides erasable sheets or a whiteboard and pen at the Pearson test centre. Candidates cannot bring their own working paper. Practise working economically: one line per decisive transformation, label question numbers clearly and avoid sprawling working that becomes hard to revisit.

Guessing policy

Because UAT-UK states that incorrect answers do not receive negative marks, a final blank has no scoring advantage. However, the goal is not random guessing. Use mathematical elimination first, then make a final selection if time is expiring.

Score interpretation

UAT-UK reports one overall TMUA score, with test scores on a 1–9 scale to one decimal place. There is no universal pass mark. Different institutions can use scores differently and alongside other application evidence.

Do not convert an unofficial practice percentage into a guaranteed live TMUA score. UAT-UK notes that sample tests are intended for familiarisation and practice, not as direct predictions of live performance.

Current October/January decision tree

1. Does the course require TMUA?
2. If no, do not take it merely because the subject is mathematical.
3. If yes, is the applicant applying to Cambridge or Oxford?
4. If yes, the October sitting is normally required unless the applicant falls within a stated January exception.
5. If applying elsewhere, check whether January is accepted for the specific institution and course.
6. If January is valid, use the January application and booking dates.
7. If January is not valid and October booking was missed, seek admissions clarification rather than assuming a workaround.

Access arrangements

UAT-UK requires access-arrangement requests before booking if arrangements are needed. January applications reopen 5 October 2026 and the published January request deadline is 7 December 2026 at 18:00 GMT.

Approved arrangements support access to the intended test; they do not change the mathematical construct being assessed.

Bursaries

Eligible UK candidates can apply for the UAT-UK bursary. UAT-UK instructs candidates to obtain approval before paying because it cannot reimburse a test fee already paid. The published January bursary deadline is 14 December 2026 at 18:00 GMT.

Fees

UAT-UK currently lists £78 for candidates sitting in the UK and Republic of Ireland and £133 for candidates sitting elsewhere. Current official booking information should be checked before payment because operational fees can change by cycle.

Test-day control

Mathematical preparation can be undermined by avoidable administration. Confirm:

• test centre;
• appointment time;
• approved photographic identification;
• travel time;
• approved access arrangements;
• test-day rules;
• what materials are provided and prohibited.

Final TMUA audit

• I have checked my exact course requirement.
• I know whether January is valid for me.
• I know the October deadline has passed.
• I understand Paper 1 and Paper 2 as different reasoning jobs.
• I can work without a calculator.
• I can distinguish necessary and sufficient conditions.
• I can test a converse and contrapositive.
• I can search for counterexamples before proving a claim.
• I can use exact structure instead of brute-force arithmetic.
• I have a skip-and-return rule.
• I use official practice materials.
• I have rehearsed the Pearson test player.
• I know my current booking and access-arrangement deadlines.

Official current-state references

Use UAT-UK Key Dates and Deadlines for the 2027-entry timeline, UAT-UK TMUA for test format and scoring, UAT-UK Prepare for specifications and sample tests, and TMUA Preparation Materials for the historic paper archive.

The durable TMUA model

TMUA rewards mathematical control more than decorative complexity.

Know the Mathematics → read the logical structure → choose the cheapest valid route → preserve conditions → manage time → check with independent evidence → return to the exact course requirement.

The admissions dates will change in future cycles. That reasoning loop remains useful wherever Mathematics has to be applied under unfamiliar conditions.

TMUA Mathematical Reasoning Clinic: Applications, Logic, Proof and Time Control

The TMUA becomes much easier to understand when it is treated as two linked tests of mathematical judgement rather than one long paper of difficult questions. Paper 1 asks how well familiar Mathematics can be used in unfamiliar situations. Paper 2 asks whether the candidate can reason with mathematical statements, implications, counterexamples and proof structures under time pressure.

The content is deliberately school-accessible. The difficulty comes from compression: little time, no calculator, plausible distractors and questions designed to expose whether the candidate understands why a method works.

1. Paper 1: Applications of Mathematical Knowledge

Paper 1 rewards candidates who can select and combine familiar Mathematics quickly. The task may involve algebra, functions, coordinate geometry, sequences, trigonometry, probability or other specification content, but the chapter name is not announced as a method label.

The candidate therefore needs three layers of control:

1. recognise the mathematical structure;
2. select an efficient method;
3. check whether the final option still satisfies the original problem.

2. Paper 2: Mathematical Reasoning

Paper 2 increases the importance of logic. The candidate may need to decide whether a statement follows, whether a converse is valid, whether one example proves anything general, whether a counterexample destroys a claim, or whether an argument contains a logical gap.

This is why UAT-UK recommends reading its Notes on Logic and Proof as part of preparation. The Mathematics is not detached from school knowledge; the reasoning layer is more explicit.

3. Quantifiers change the size of the claim

Compare:

“For every real number (x), (x^2ge0).”

and:

“There exists a real number (x) such that (x^2ge0).”

The first is universal. The second is existential.

To disprove a universal statement, one counterexample is enough. To prove an existential statement, one valid example is enough. TMUA reasoning becomes faster when the candidate identifies the quantifier before testing cases.

4. Original reasoning practice: counterexample

Statement: “If (x^2>4), then (x>2).”

This is false. Take (x=-3). Then:

[ x^2=9>4, ]

but:

[ -3 ot>2. ]

One counterexample ends the universal implication.

5. Converse and contrapositive

If a statement has the form:

[ PRightarrow Q, ]

its converse is:

[ QRightarrow P, ]

and its contrapositive is:

[ eg QRightarrow eg P. ]

The original statement and contrapositive are logically equivalent. The converse need not be true.

For example:

“If an integer is divisible by 6, it is divisible by 3.”

True.

Converse:

“If an integer is divisible by 3, it is divisible by 6.”

False; (9) is a counterexample.

6. Necessary and sufficient conditions

If (PRightarrow Q), then (P) is sufficient for (Q), while (Q) is necessary for (P).

Example:

If a number is divisible by 12, then it is divisible by 4.

Divisibility by 12 is sufficient for divisibility by 4. Divisibility by 4 is necessary for divisibility by 12, but not sufficient.

7. Do not confuse “only if” and “if”

“A only if B” means:

[ ARightarrow B. ]

“A if B” means:

[ BRightarrow A. ]

Under time pressure, these language reversals create avoidable logic errors. Rewrite the sentence symbolically when necessary.

8. Original practice: implication

Which statement is equivalent to “If (n) is not even, then (n) is not divisible by 4”?

The contrapositive is:

“If (n) is divisible by 4, then (n) is even.”

That statement is true and logically equivalent to the original.

9. Pattern evidence is not proof

If a formula works for (n=1,2,3,4,5), the candidate may have evidence for a conjecture. A universal claim still needs an argument covering every permitted (n).

This distinction appears repeatedly in Paper 2 because attractive distractors often turn numerical evidence into general certainty.

10. Original proof practice

Prove that (n^2+n) is even for every integer (n).

Factor:

[ n^2+n=n(n+1). ]

Two consecutive integers contain one even number, so the product is even.

The proof is short because the right representation exposes the structure.

11. Domain conditions matter in reasoning questions

Claim: if (ab=ac), then (b=c).

This is false unless (a e0). If (a=0), then both sides equal zero for any (b) and (c).

TMUA distractors often become plausible because a missing condition is easy to overlook.

12. Applications paper: exactness before decimals

Without a calculator, exact forms often make relationships easier to see.

Example:

[ rac{1}{2}+rac{1}{3}=rac{5}{6}. ]

The decimal route adds unnecessary approximation. Similar logic applies to surds, ratios and trigonometric exact values.

13. Applications paper: work backwards from the answer choices

If the answer choices are candidate values for an unknown, substitution can be cheaper than a full derivation. This is legitimate when the original condition is quick to evaluate.

For an equation whose symbolic solution would require several transformations, testing four simple options may reduce both time and algebraic risk.

14. Applications paper: bounding

If the options are widely separated, prove the answer lies in one interval.

For:

[ sqrt{90}, ]

we know:

[ 9^2=81,qquad10^2=100, ]

so:

[ 9

If only one option lies in that interval, the question is effectively solved.

15. Original practice: algebraic compression

If:

[ x+rac1x=5, ]

find:

[ x^2+rac1{x^2}. ]

Square the first equation:

[ x^2+2+rac1{x^2}=25. ]

Therefore:

[ x^2+rac1{x^2}=23. ]

Do not solve the quadratic for (x) unless the question actually needs (x).

16. Original practice: function reasoning

If (f(x)=2x+3), which expression gives (f(f(x)))?

[ f(f(x))=2(2x+3)+3=4x+9. ]

The trap is treating composition as multiplication of functions.

17. Original practice: inequality structure

If (0

For positive values, reciprocation reverses the order:

[ rac1a>rac1b. ]

A candidate who substitutes numbers can discover this, but the stronger internal model understands the monotonic behaviour of (1/x) on positive reals.

18. Original practice: sequences

An arithmetic sequence has first term 7 and common difference 4. Which term is 55?

[ 7+4(n-1)=55. ]

So:

[ 4(n-1)=48,quad n-1=12,quad n=13. ]

19. Original practice: ratio composition

In a group, the ratio of red to blue objects is (2:5). After adding 6 red objects, the ratio becomes (4:5). How many red objects were there originally?

Let the original counts be (2k) and (5k). Then:

[ rac{2k+6}{5k}=rac45. ]

So:

[ 5(2k+6)=20k, ]

[ 10k+30=20k, ]

hence (k=3), so there were (6) red objects originally.

20. Time budget across 20 questions

Each TMUA paper contains 20 multiple-choice questions in 75 minutes. The raw average is:

[ 75/20=3.75 ext{ minutes per question}. ]

This is a budget, not a command. A strong candidate spends less on straightforward questions and keeps room for harder reasoning later.

21. A two-pass paper strategy

Pass 1: complete questions where the route is visible quickly.

Pass 2: return to high-friction questions with the remaining time.

If the first ten minutes are consumed by two difficult questions, the paper has been allowed to choose the time allocation for the candidate.

22. A three-state question label

Use:

• S — secure route, solve now;
• R — recognisable but needs work, return;
• U — unclear structure, postpone until later.

This keeps the paper moving without requiring emotional decisions about “giving up”.

23. No negative marking changes the final-minute strategy

UAT-UK states that wrong answers do not lose marks. A candidate should therefore use the final minutes to make a considered response to unanswered questions rather than protect blanks.

That does not mean random guessing should replace Mathematics early in the paper. It changes the endgame.

24. Common Paper 1 failure: solving more than asked

A question may ask for a sign, interval or comparison, while the candidate performs a complete exact solution. Identify the minimum information needed for the answer choices.

25. Common Paper 1 failure: calculator-shaped thinking

A candidate sees awkward numbers and assumes exact calculation is required. Often the test is asking for factorisation, cancellation, estimation or bounds.

26. Common Paper 2 failure: trusting a diagram

A picture can support intuition but cannot create an unstated equality, angle or length. Use only properties established by the problem.

27. Common Paper 2 failure: treating a true conclusion as a valid proof

An argument can reach a true statement through invalid reasoning. TMUA reasoning questions care about whether each inference follows.

28. Common Paper 2 failure: proving the converse

If the task concerns (PRightarrow Q), make sure the reasoning begins from (P) and reaches (Q), unless you deliberately use the contrapositive.

29. Common Paper 2 failure: hidden assumption

Dividing by (x) assumes (x e0). Taking a square root can lose a sign branch. Squaring can introduce candidates. Logical questions often turn on these boundaries.

30. Logic and Proof revision card

• universal claim → one counterexample can disprove;
• existential claim → one example can prove existence;
• original implication ↔ contrapositive;
• converse is separate;
• necessary ≠ sufficient;
• examples suggest; proof establishes;
• domain conditions travel with algebra.

31. Mixed mini-set

A. Disprove: “If (x^2>1), then (x>1).”

Counterexample (x=-2).

B. If (pRightarrow q) and (qRightarrow r), what follows?

[ pRightarrow r. ]

C. If (a+b=12) and (ab=20), find (a^2+b^2).

[ 144-40=104. ]

D. If an integer is divisible by 8, what must be true?

It is divisible by 4 and by 2.

E. If (x^2=16), what are the real possibilities?

[ x=pm4. ]

32. Practice should alternate Paper 1 and Paper 2

Do not spend weeks becoming fast at applications and then begin reasoning practice late. The two papers reward overlapping but distinct habits. Alternate them so algebraic fluency and logical precision develop together.

33. Error ledger for TMUA

34. Fresh retest rule

If the learner failed an implication question, do not retest using the same nouns and numbers. Change the surface language while preserving the same logical structure.

Transfer means recognising the implication pattern even when the context changes.

35. Four-week TMUA plan

Week 1: specification and logic audit

Identify missing school content and review implication, converse, contrapositive, necessary/sufficient conditions and counterexamples.

Week 2: applications efficiency

Practise algebraic compression, bounds, exact arithmetic, function interpretation and method selection.

Week 3: timed paper clusters

Use mixed Paper 1 and Paper 2 sets. Build the error ledger.

Week 4: full papers and recovery

Work under 75-minute conditions, rehearse two-pass control and stabilise weak reasoning categories.

36. Eight-week TMUA plan

Weeks 1–2: prerequisite repair.

Weeks 3–4: untimed high-quality reasoning.

Weeks 5–6: timed clusters and deliberate method comparison.

Week 7: full papers and interface familiarity.

Week 8: maintenance, targeted review and logistics.

37. Use official resources to calibrate style

UAT-UK recommends its test specification, Notes on Logic and Proof and timed practice materials. Third-party practice should come after the candidate understands the official task style.

38. Do not infer a universal pass mark

UAT-UK states that TMUA has no pass/fail score. Universities use results in their own admissions processes. Preparation should therefore target mathematical performance rather than a fabricated universal cutoff.

39. October versus January is an admissions rule, not a study preference

For the 2027-entry cycle, the October booking deadline has passed. Most Cambridge and Oxford applicants requiring TMUA need the October sitting, with limited stated exceptions for January-deadline routes. Other UAT-UK institutions may permit October or January.

The applicant must check the exact course. A study plan cannot repair an invalid sitting choice.

40. One test per admissions cycle

UAT-UK permits a candidate to sit a UAT-UK test only once in an admissions cycle. October and January belong to the same cycle. Do not plan January as a second attempt after sitting in October.

41. Access arrangements

Candidates needing access arrangements should follow the UAT-UK process early and obtain approval before booking. For the January 2027 sitting, UAT-UK lists 7 December 2026 at 18:00 GMT as the access-arrangement booking deadline.

42. Final readiness audit

• I know whether my course requires TMUA.
• I know which sitting is valid for my applicant category.
• I understand that October booking for the 2027-entry cycle has closed.
• I can work without a calculator.
• I can distinguish implication, converse and contrapositive.
• I can use a counterexample efficiently.
• I can compress algebra without losing conditions.
• I can use bounds and answer choices intelligently.
• I have a two-pass timing strategy.
• I analyse the first failed decision after practice.
• I retest the repair on a changed problem.
• I use official practice to calibrate my preparation.

Continue through TMUA, STEP & ESAT Mathematics Admissions, ESAT 2027 Entry, STEP Mathematics and the World Mathematics Atlas.

TMUA Final Calibration: Make the Reasoning Portable

The last stage of TMUA preparation is not another catalogue of techniques. It is proof that the learner can recognise the same logical structure after the surface has changed. A candidate who remembers a solution but cannot transfer its reasoning is still dependent on the old question.

Fresh transfer 1: implication

Claim: if an integer is divisible by 15, then it is divisible by 5. This is true. The converse is false because 10 is divisible by 5 but not 15. The repair target is the direction of implication.

Fresh transfer 2: universal claim

Claim: for every real number (x), (x^2ge x). Test (x=rac12):

[ rac14<rac12. ]

One counterexample settles the claim. The candidate should search for a boundary or fractional case before trying to prove a universal statement that may be false.

Fresh transfer 3: domain

For:

[ f(x)=rac{x+2}{x-4}, ]

the value (x=4) is excluded. Any manipulation, inverse question or graph interpretation must preserve that fact. Domain is part of the object, not an annotation added afterwards.

Fresh transfer 4: necessary and sufficient

For a real number (x), the condition (x=3) is sufficient for (x^2=9), but not necessary because (x=-3) also works. The condition (|x|=3) is both necessary and sufficient.

Fresh transfer 5: structure before arithmetic

Evaluate:

[ rac{64^2-36^2}{28}. ]

Difference of squares gives:

[ rac{(64-36)(64+36)}{28} =rac{28cdot100}{28}=100. ]

The correct habit is to search for a simplifying structure before expanding.

Final paper review

After each full practice paper, select only three questions for deep review:

1. one wrong answer caused by missing Mathematics;
2. one wrong answer caused by logic or interpretation;
3. one question that was correct but too slow.

Repair each with a changed problem. This keeps review focused on transferable weaknesses instead of producing a large archive of annotated mistakes that are never retested.

Final timing rule

Do not allow one hard question to become the emotional centre of the paper. Twenty questions share the 75-minute budget. A difficult item can be left, returned to and answered later. The candidate’s performance is the whole paper, not the first obstacle.

Final administrative rule

The October 2026 booking deadline has passed. A January 2027 sitting exists, but candidates must confirm that January is valid for their exact institution, course and applicant category before relying on it. Current UAT-UK dates and the university course page remain the governing sources.

TMUA readiness is visible when the learner can read a new problem, identify the mathematical or logical skeleton, choose a proportionate route, preserve conditions and move on without needing the chapter label.

TMUA Release Check: One Last Unfamiliar Problem

Before treating preparation as complete, give the learner one unfamiliar problem without a topic label, formula prompt or worked model. The learner should state the relevant structure, choose a route, preserve any domain condition, reject at least one plausible but invalid alternative and explain why the final conclusion follows.

Then change one feature of the task. Reverse the implication, alter the domain, replace an exact value with a bound, or turn a direct question into a counterexample question. If the learner can adapt without recreating the previous wording, the reasoning is becoming portable.

The final TMUA habit is therefore not speed alone. It is calibrated reasoning under time: know what the statement says, know what would disprove it, know which operation preserves the conditions, and know when the answer choices allow a shorter route.

Current admissions control remains separate: verify the target course and valid sitting through UAT-UK and the university before relying on any preparation schedule.