All guides

TMUA topic guide

TMUA Counting & Probability: What to Know

Counting and probability are a small part of the TMUA, which has no heavy statistics. Here is exactly what little to know: basic counting, combinations and simple probability.

Preparation Updated 24 Jun 2026 7 min read

Quick answer

Counting and probability are a minor part of the TMUA. The test has no heavy statistics, so you will not meet distributions, hypothesis testing or data handling. What you do need is small and finite: how to count outcomes, the combinations formula for choosing items, and basic probability as favourable over total outcomes. Learn that handful of ideas well, but do not let them crowd out the algebra, calculus and proof that the paper is actually built on. See the full TMUA syllabus topics for where this sits.

Let us be honest about this topic from the start: counting and probability are a small corner of the TMUA, not a pillar of it. If you have come from a GCSE or A-level course with a thick statistics module, set that expectation aside. The TMUA is a pure-maths and reasoning test. It has no heavy statistics, no distributions to learn, no hypothesis testing, no data handling and no calculator-driven number crunching. What it does occasionally ask is light: count how many ways something can happen, choose a subset using combinations, or work out a simple probability. This guide covers exactly how much of it appears, the small set of ideas worth knowing, and the few traps that catch people, so you can spend the right amount of time on it and not a minute more.

Key fact

Calibrate your effort. Counting and probability are worth a quick, confident pass, not a deep dive. Nail basic counting, the combinations formula and simple probability, then put your hours into the algebra, functions, calculus and proof that dominate the paper.

How much actually appears

Across a full TMUA sitting you might see a question or two that touch counting or probability, and often none at all in a recognisable form. They are far more likely to surface in Paper 1 as a clean application of arithmetic and algebra than as a statistics question in disguise. When probability does appear, it tends to be woven into reasoning: a problem about how many outcomes satisfy a condition, or a short logical argument that happens to use a fraction like 16\frac{1}{6} as its answer.

This is deliberate. The TMUA exists to test mathematical thinking for demanding university courses, and it leans hard on the topics those courses build on: sequences and series, indices, logarithms, polynomials, trigonometry, coordinate geometry, differentiation, integration and the logic of proof. Probability simply is not one of its load-bearing themes. You can read the complete breakdown in our TMUA syllabus topics guide, where counting and probability sit near the bottom of the list by frequency.

So the planning takeaway is blunt. Know the small kit below, practise a handful of questions so it is familiar, and then move on. Over-investing here is one of the easier ways to misallocate revision time, and the TMUA is hard enough in its core areas that those deserve the bulk of your attention.

Basic counting and combinations

Most counting on the TMUA reduces to two ideas, and both are finite and concrete.

The first is the multiplication principle: if one choice can be made in mm ways and an independent second choice in nn ways, the two together can be made in m×nm \times n ways. Choosing a starter from 44 options and a main from 55 gives 4×5=204 \times 5 = 20 meals. Stack more independent stages and you keep multiplying. This single rule handles a surprising share of counting problems, and it is usually faster to reason from it directly than to reach for a formula.

The second is combinations, which count how many ways you can choose rr items from nn when order does not matter. The notation is (nr)\binom{n}{r}, read "n choose r", and the formula is (nr)=n!r!(nr)!\binom{n}{r} = \frac{n!}{r!(n-r)!}, where n!n! means the product of all whole numbers from 11 up to nn. For example, choosing 22 people from 55 gives (52)=5!2!3!=1202×6=10\binom{5}{2} = \frac{5!}{2!\,3!} = \frac{120}{2 \times 6} = 10. The key distinction to fix in your mind is order: combinations are for selections where order is irrelevant, like picking a committee, as opposed to arrangements where order matters, like ranking finishers.

You may also meet (nr)\binom{n}{r} wearing a different hat entirely. The same numbers are the binomial coefficients that appear when you expand (a+b)n(a + b)^n, so a question on the binomial expansion is really a counting question in algebraic clothing. Spotting that connection means one idea covers two parts of the syllabus, which is exactly the kind of efficiency the TMUA rewards. A couple of useful sanity checks: (n0)=1\binom{n}{0} = 1 and (nn)=1\binom{n}{n} = 1, since there is exactly one way to choose nothing or everything, and (nr)=(nnr)\binom{n}{r} = \binom{n}{n-r}, because choosing what to include is the same as choosing what to leave out.

Simple probability

Probability on the TMUA stays at its most basic. For equally likely outcomes, the probability of an event AA is the count of favourable outcomes over the count of all possible outcomes:

P(A)=favourable outcomestotal outcomesP(A) = \frac{\text{favourable outcomes}}{\text{total outcomes}}

Rolling a fair die and asking for a six gives P(A)=16P(A) = \frac{1}{6}. Asking for an even number gives 36=12\frac{3}{6} = \frac{1}{2}. Notice that the hard part is the counting, not the probability: once you can count the outcomes, the fraction writes itself. That is why the counting tools above matter more than any probability rule.

A few facts cover almost everything you might need. Every probability lies between 00 and 11 inclusive. The probability that an event does not happen is 11 minus the probability that it does, so P(not A)=1P(A)P(\text{not } A) = 1 - P(A), and reaching for the complement is often far quicker than counting the event directly. For two independent events, where one has no effect on the other, the probability that both occur is the product P(A)×P(B)P(A) \times P(B); two fair coins both landing heads is 12×12=14\frac{1}{2} \times \frac{1}{2} = \frac{1}{4}. That short list, equally likely outcomes, the complement and independent multiplication, is essentially the whole probability toolkit the TMUA expects.

Because there is no calculator, every answer stays as an exact fraction. You will never be asked for a decimal probability to three places, which fits the wider calculator-free techniques the paper is built around: keep numbers exact, cancel fractions early, and never reach for arithmetic the question does not need.

Try one

The best way to feel how lightly this topic sits in the test is to attempt a real question that uses it. Give this one a proper go against the clock, and notice that the counting or probability is a small step inside a broader reasoning problem rather than the whole task:

If it felt more like careful reading and clear counting than statistics, that is exactly the point. This is what "probability on the TMUA" usually looks like in practice.

Common traps to avoid

Even on a minor topic there are a few reliable ways to lose marks, and they are worth a quick mental note.

  • Confusing order and no order. Using combinations when the arrangement matters, or counting arrangements when only the selection matters. Ask yourself first: does swapping two items create a genuinely different outcome? If not, it is a combination.
  • Double counting. Counting the same outcome twice when cases overlap, or forgetting to subtract an overlap. Listing the cases explicitly on a small problem is safer than a half-remembered shortcut.
  • Treating dependent events as independent. The product rule P(A)×P(B)P(A) \times P(B) only holds when the events truly do not affect each other. Draws without replacement, for instance, are not independent.
  • Over-engineering it. Reaching for a heavy formula when the multiplication principle or a short list would settle the question in seconds. On the TMUA the simple route is almost always the intended one.
  • Forgetting the complement. Grinding through "at least one" the long way instead of computing 1P(none)1 - P(\text{none}), which is usually a single quick step.

Most of these are reasoning slips rather than gaps in knowledge, which is encouraging, because they are fixed by slowing down for one sentence and asking what is actually being counted.

How to fit it into your prep

Treat this topic as a short, deliberate visit rather than a campaign. Spend an hour getting the multiplication principle, the combinations formula and the basic probability rules genuinely solid, work through a small set of mixed questions until they feel routine, and then stop. There is no depth here to reward a second day, and the marginal hour is far better spent on calculus, algebra or proof.

The one connection worth keeping live is the binomial link. Because (nr)\binom{n}{r} also drives the binomial expansion covered in our sequences and series guide, practising one quietly reinforces the other, so you get two topics for slightly more than the price of one. Beyond that, fold the occasional counting or probability question into your general timed practice so the ideas stay warm, and let the rest of your plan, laid out in how to prepare for the TMUA, carry the weight. Knowing what to skim is as much a part of good preparation as knowing what to grind.

Practise the real TMUA, free

Work through every official past paper as an interactive question bank, with instant worked solutions, trap-spotting and progress tracking. No PDFs.

Start practising free

Frequently asked questions

Very little. The TMUA has no heavy statistics, so there are no distributions, no hypothesis testing and no data handling. You might meet a question or two that touch basic counting or simple probability across a full sitting, and sometimes none in an obvious form. It is a minor topic, not a major one.