Subtopic 1 of 5
4.1Permutations & combinations
The idea
Counting uses nPr when order matters and nCr when it does not.
Think of it like this: Arranging books on a shelf (order) versus picking a team (no order).
Why it exists
Almost every paper has one counting question.
How it works
- Does order matter? Yes: permutation.
- Repeated letters: divide by the factorials.
- Round table: (n − 1)!.
- "At least one": total minus none.
Worked example: Arrangements of LETTER
6! / (2! 2!) = 180.
Now play with it
- →Compare 6P3 and 6C3.
- →Type a word with double letters.
Arrangements of all n: n!720
Ordered choice nPr120
Unordered choice nCr20
Round table (n − 1)!120
Selections with repetition C(n+r−1, r)56
Words with repetition n^r216
Letters6
RepeatsE×2, T×2
Distinct arrangements180
Check yourself
Ways to arrange the letters of MOON
Remember: Order → nPr. No order → nCr. Divide by factorials for repeats.
Exam notes (the dense version)
Order matters: nPr = n!/(n − r)!. Order does not matter: nCr = n!/(r!(n − r)!). Arrangements of n distinct objects = n!; around a circle = (n − 1)!; of a word with repeated letters = n!/(p! q! ...) (LETTER = 6!/(2!2!) = 180). "At least one" is usually total minus none.
Previous year questions: Counting & Probability (10)
PYQs are grouped by topic, so this is the full set for Counting & Probability; try the ones that match this subtopic. Open all 10 on the topic page.