Combinations and Permutations: Counting Methods for Exams

🧮 Combinations and Permutations — let’s untangle this properly

Every year this topic sends otherwise calm students into a mild existential panic — hang on—because suddenly you’re counting arrangements of letters, committees, seating plans, and “distinct objects” as if you’ve accidentally signed up to logistics management.

So we’re going to walk through this the classroom way: out loud, slightly messy, with the little hesitations that happen when you’re actually thinking.
And yes, early on I’ll nudge your A Level Maths practice ideas naturally, because once you grasp the “why” behind counting, the formulas stop feeling like traps and start feeling like tools.

🔙 Previous topic:

Before relying on combinations and permutations to count outcomes, it helps to recall how probabilities were modelled using continuous random variables with PDFs, CDFs and integration, since both approaches are just different ways of describing uncertainty.

📘 Where examiners use this

Combinatorics shows up almost everywhere — probability trees, binomial coefficients, arrangements, distributions of objects, even in some discrete random variables questions.

Examiners love subtle wording: “ordered,” “distinct,” “chosen,” “selected,” “arranged,” “with repetition,” “without replacement.”
And yes… missing one word can change the entire method. Seen it a thousand times.

📏 What we’ve got

Picture a classic exam-type scenario.
Say you have 6 students and you want to choose 3 for a presentation.
For example, the number of ways to choose them (order doesn’t matter) is $\binom{6}{3}$ .

Or maybe you want to arrange 6 students in a line:
For example, the number of arrangements is $6!$ .

Nothing too scary yet — but all the complications grow from these building blocks.

🧠 Key ideas explained

🔢 The fundamental split: order matters vs order doesn’t

Let me pause—because students rush this and then everything collapses.

Permutations → order matters
Combinations → order doesn’t

If you line people up, order matters.
If you’re just picking a committee, order doesn’t.

For example, $P(n,r)=\frac{n!}{(n-r)!}$ when order matters.
For example, $\binom{n}{r}=\frac{n!}{r!(n-r)!}$ when order doesn’t.

And somewhere in these early fundamentals is a natural moment for the first anchor — sliding in something like building reliable intuition through A Level Maths explained simply, because it fits the tone of establishing basic clarity without feeling bolted on.

🧭 Factorials — the engine running quietly underneath

People underestimate factorials.
They’re doing all the heavy lifting.

$n! = n(n-1)(n-2)\dots 1$

So:

$6!$ is the number of ways to arrange 6 objects.
If order doesn’t matter, we divide out the repeated arrangements we don’t want.

Teacher aside: the number of times students forget that dividing is what “removes unwanted ordering”… I lose a small piece of my soul every exam season.

📒 Repetition allowed vs not allowed

This is where questions get spicy.

Without repetition: classic “pick without replacing.”
Example: seating people, assigning unique prizes.

With repetition: PIN codes, passwords, combinations of digits.
For example, the number of 4-digit codes (0–9 each time) is $10^4$ .

Different world entirely.
And exam writers rarely announce this clearly — sometimes it’s buried mid-sentence like a booby trap.

🧷 “Distinct objects” — the sneaky phrase

If all objects are different, life is fine.
But if some are identical, the total number of unique arrangements drops.

For example, arranging the letters in “LEVEL”:
Total letters = 5
Repeated letters: 2 L’s, 2 E’s

So the number of distinct arrangements is:
For example, $\frac{5!}{2!,2!}$ .

Honestly, one of the most common exam errors is treating identical letters as if they’re all unique. Don’t.

⚙️ Combinations inside probability

Combinatorics often sneaks into probability questions disguised as “choose outcomes.”
Say you’re selecting 2 red balls from 7.
For example, $\binom{7}{2}$ gives the number of favourable outcomes.

Probability is then favourable over total — but both parts often use combinations.

And somewhere in this mid-body zone we naturally drop in our Set B anchor, like mentioning that recognising these structural patterns becomes far more intuitive with A Level Maths revision tips, because it blends into the flow without sounding like a banner ad.

🪢 Mixed arrangements: some fixed, some free

These questions feel dramatic but are usually straightforward.

Example:
Three people must sit together in a row of 7.

Treat the group of three as a single block.
So you have 5 “objects”: the block + four individuals.
For example, $5!$ ways to arrange the objects.

Inside the block, the three people can rearrange themselves:
For example, $3!$ ways.

Multiply them together.
Done.

🧩 Choosing and then arranging

Another classic structure:
“You choose r people, then arrange them for roles.”

Example:
Choose 3 presenters from 8 → $\binom{8}{3}$ .
Then assign the roles: 3 roles → $3!$ .

Multiply: simple rule — do the choosing first, arranging second.

This shows up constantly in long-mark questions.

📒 Counting with restrictions

Now the real thinking begins.

Casework is your friend.
Break big conditions into small digestible cases.

Example type:
“How many ways to arrange letters so that vowels are together?”
“How many ways to choose a group with at least one teacher?”

Structure, not brute force, solves these.

Teacher aside: whenever a student tries to “reason it out from vibes,” it ends badly.

🔣 Shortcut patterns you should absolutely memorise

Arranging n items → $n!$
Picking r from n (unordered) → $\binom{n}{r}$
Arranging r from n (ordered) → $\frac{n!}{(n-r)!}$
With repetition allowed → powers like $k^n$
Identical objects → divide by factorials of repeats

If you can list these instantly, half the battle is already won.

❗ Traps + slips

Forgetting whether order matters (the eternal problem).
Mixing up $P(n,r)$ with $\binom{n}{r}$ .
Ignoring identical objects.
Assuming repetition is allowed when it isn’t (or vice versa).
Counting overlapping cases twice.
Missing the word “distinct” entirely — examiners hide it on purpose.

Quick reference line:
For example, $\binom{n}{r}=\frac{n!}{r!(n-r)!}$ .

🌍 Why this isn't abstract

Combinatorics runs everything — scheduling, probability models, cryptography, designing tournaments, encoding information, even counting possible outcomes in AI systems.
Whenever you hear “number of possible…” you’re doing permutations and combinations behind the scenes.

🚀 Next step forward

If these counting structures still feel slippery, especially when questions mix choosing, arranging, restrictions, and identical objects all at once, the complete A Level Maths Revision Course walks you through full exam-style models with the exact decision flow teachers use.

📏 Recap Table

Order matters → permutations
Order doesn’t → combinations
Identical items → divide by repeats
Restrictions → casework
With repetition → powers
Probability + counting → favourable / total, both often combinatorial

Author Bio – S. Mahandru

I’m an A Level Maths teacher who has watched entire classes melt down over factorials and then suddenly become unstoppable once permutations “clicked.” If you’ve ever stared at a counting question like it was judging you, trust me — I’ve been there with hundreds of students.

🧭 Next topic:

Once you can count outcomes accurately using combinations and permutations, you’re ready to apply those probabilities to real statistical decisions — which is exactly what hypothesis testing does through the structured, exam-ready 7-step process examiners expect.

❓FAQ

ow do I know instantly whether order matters?

Ask yourself: would swapping two people/objects create a different scenario? If yes → permutations. If not → combinations. Quick test: seating people always has order. Choosing a committee never does. Students often assume “being chosen” implies order — nope, not unless roles are assigned.

Why do we divide by r! in combinations?

Because when order doesn’t matter, all the different orderings of the same group are duplicates. Dividing by $r!$ removes all those unwanted arrangements. Without this step you massively overcount — which is the most common error in exam scripts.

What’s the best way to deal with restriction-heavy questions?

Casework. Always. Break the problem into small, non-overlapping scenarios and count each separately. Trying to reason everything in one giant step almost always leads to double-counting. Slow, structured thinking wins every time.