Use a permutation when order matters (arranging, ranking, forming numbers or codes) and a combination when it does not (choosing a team, a committee or a set of books). That one decision is the heart of Topic 11 in Cambridge IGCSE Additional Mathematics. After it come the counting tools: n!, ⁿPᵣ = n!/(n − r)! for ordered arrangements of r items from n, and ⁿCᵣ = n!/(r!(n − r)!) for unordered selections.
This topic rewards clear thinking more than algebra, and students who rush it often get answers that are off by a factor they cannot explain. Working through it with our Additional Maths tutoring helps you see why each factor is there.
What the syllabus includes and leaves out
Topic 11 of the 2025–2027 syllabus has three learning outcomes:
- 11.1 Recognise the difference between permutations and combinations and know when each should be used.
- 11.2 Know and use n! and the expressions for permutations and combinations of n items taken r at a time, including 0! = 1.
- 11.3 Solve arrangement and selection problems in an everyday context or based on an algebraic problem.
The syllabus also states three exclusions: problems with repetition of objects, objects arranged in a circle, and problems that need both permutations and combinations together are not included. That keeps 0606 counting cleaner than many textbook exercises, some of which are written for other courses.
There is no Core or Extended tier, so this is for every candidate, on either paper. ⁿCᵣ written as n!/((n − r)! r!) appears in the List of formulas under the binomial theorem; ⁿPᵣ does not, so learn it. For the topics around this one, see where counting sits in the 0606 syllabus.
The decision in one table
| Question wording | Order matters? | Tool |
|---|---|---|
| "Arrange", "in a row", "form a number", "code" | Yes | n! or ⁿPᵣ |
| "Choose", "select", "committee", "team", "group" | No | ⁿCᵣ |
| "Captain and vice-captain" | Yes (roles differ) | ⁿPᵣ |
| "Two representatives" with no roles | No | ⁿCᵣ |
A quick test: if swapping two chosen items gives a different outcome, order matters.
Worked example 1: letters with conditions
The seven letters of the word FORMULA are all different. Find the number of arrangements (a) in total, (b) that begin and end with a vowel, (c) in which M and L are next to each other.
(a) Seven different letters in a row: 7! = 5040.
(b) The vowels are O, U and A. Fill the restricted places first:
- first letter: 3 choices of vowel
- last letter: 2 vowels left
- the 5 middle places: the remaining 5 letters in 5! = 120 ways
Total = 3 × 2 × 120 = 720.
(c) Glue M and L together as one block. Now there are 6 items to arrange: 6! = 720. Inside the block, M and L can be in either order: × 2.
Total = 720 × 2 = 1440.
The rule "fill restricted positions first" saves most conditional arrangement questions.
Worked example 2: forming numbers
Four-digit numbers are formed from the digits 1, 2, 3, 4, 5, 6 and 7, with no digit used more than once. Find how many (a) can be formed, (b) are greater than 5000, (c) are even and greater than 5000.
(a) ⁷P₄ = 7 × 6 × 5 × 4 = 840.
(b) The first digit must be 5, 6 or 7: 3 choices. The other three places are filled from the remaining 6 digits in ⁶P₃ = 120 ways. Total = 3 × 120 = 360.
(c) Now both the first digit (5, 6 or 7) and the last digit (2, 4 or 6) are restricted, and they overlap at 6. Split into cases:
- First digit 6: the last digit is 2 or 4 (2 ways). The middle two places: ⁵P₂ = 20. Subtotal 2 × 20 = 40.
- First digit 5 or 7: 2 ways. The last digit is 2, 4 or 6 (3 ways). The middle: ⁵P₂ = 20. Subtotal 2 × 3 × 20 = 120.
Total = 40 + 120 = 160.
When two restrictions share an item, split into cases. Multiplying 3 × 3 × 20 = 180 counts the number 6__6, which repeats a digit, so it is wrong.
Worked example 3: "at least" in a selection
A committee of 5 is chosen from 6 men and 4 women. How many committees contain at least 2 women?
Order does not matter, so use combinations. "At least 2" has several cases (2, 3 or 4 women), so it is quicker to subtract the cases you do not want from the total.
- Total: ¹⁰C₅ = 252
- No women: ⁶C₅ = 6
- Exactly 1 woman: ⁴C₁ × ⁶C₄ = 4 × 15 = 60
At least 2 women = 252 − 6 − 60 = 186.
Check by direct counting: 2 women: ⁴C₂ × ⁶C₃ = 6 × 20 = 120; 3 women: ⁴C₃ × ⁶C₂ = 4 × 15 = 60; 4 women: ⁴C₄ × ⁶C₁ = 6. Total 186. Both methods agree.
A similar idea handles "two particular people must not both be chosen": count all selections, then subtract those that include both. For a team of 6 from 12 people, that is ¹²C₆ − ¹⁰C₄ = 924 − 210 = 714.
Worked example 4: an algebraic problem
Given that ⁿC₃ = 4 × ⁿC₂, find n.
Write both sides with factorials or products:
- ⁿC₃ = n(n − 1)(n − 2)/6
- ⁿC₂ = n(n − 1)/2
So n(n − 1)(n − 2)/6 = 4 × n(n − 1)/2.
Since n ≥ 3, n(n − 1) is not zero, so divide both sides by n(n − 1): (n − 2)/6 = 2.
n = 14. Check: ¹⁴C₃ = 364 and ¹⁴C₂ = 91, and 4 × 91 = 364.
The syllabus explicitly includes problems "based on an algebraic problem", so expect at least one question like this.
Calculator or not?
On Paper 2, the calculator's nPr and nCr keys give values quickly, but the marks are for the method: you must show the cases or the product, such as 3 × ⁶P₃, not just the final number.
On Paper 1, numbers are kept small enough to work by hand. Cancel before multiplying: ¹⁰C₅ = (10 × 9 × 8 × 7 × 6)/(5 × 4 × 3 × 2 × 1) = 252. Knowing ⁿC₁ = n, ⁿC₂ = n(n − 1)/2 and ⁿCᵣ = ⁿCₙ₋ᵣ saves time.
Mistakes our tutors see
- Using ⁿPᵣ for a committee, which counts each committee many times over.
- Adding when you should multiply. Independent stages multiply; separate cases add.
- Forgetting the internal order of a glued block.
- Double-counting overlapping restrictions, as in Example 2(c).
- "At least" done case by case with one case missing. Use the complement, then check.
- 0! taken as 0. It is 1, which is why ⁿC₀ = 1.
When to get help with counting
- You often get an answer that is too big by a factor of 2 or 6 and cannot see why.
- You cannot decide between permutations and combinations from the wording.
- Conditional questions ("must", "must not", "next to") leave you without a plan.
- nCr equations feel like an algebra problem you have never seen before.
Self-check
- In how many ways can 8 different books be arranged on a shelf?
- In how many ways can 3 books be chosen from 8 different books?
- How many arrangements of 3 letters can be made from the letters of PLANET?
- A team of 4 is chosen from 5 girls and 7 boys. How many teams have exactly 2 girls?
- Solve ⁿP₂ = 72.
Answers. 1: 8! = 40 320. 2: ⁸C₃ = 56. 3: ⁶P₃ = 120. 4: ⁵C₂ × ⁷C₂ = 10 × 21 = 210. 5: n(n − 1) = 72, so n = 9.
Where this leads
ⁿCᵣ is the coefficient in every binomial expansion, so this topic leads straight into binomial expansion in 0606. For timed practice on both, use the 0606 series and counting practice questions. Counting also underpins probability; the 0580 foundations are in our 0580 probability topics overview. If you came here from trigonometry, the trig graphs guide is the topic just before this one in the syllabus order.
At IB AA HL and A level, counting extends to circular arrangements, repetition and mixed problems; see IB AA HL counting and the binomial theorem.
How Maths Bodhi helps
Our tutors ask students to explain each factor in a counting answer out loud, which exposes double counting quickly. Practice moves from plain arrangements to conditions to "at least" problems, with original questions in the 0606 style. Students can learn through one-to-one IGCSE maths tutoring at home in Gurgaon or online.
Home tuition is available in Gurgaon (Gurugram). Students elsewhere in India and abroad learn with us online. You can book a free demo class.
Written and checked by the Maths Bodhi team. Facts checked against official Cambridge International and Pearson sources, November 2026.
Frequently asked questions
- What is the difference between permutations and combinations?
- A permutation counts arrangements where order matters, such as forming a number. A combination counts selections where order does not matter, such as choosing a committee.
- Are circular arrangements in IGCSE Additional Maths?
- No. The 0606 syllabus excludes objects arranged in a circle, problems with repeated objects, and problems that need both permutations and combinations together.
- Is the nCr formula given in the 0606 exam?
- The List of formulas gives ⁿCᵣ = n!/((n − r)! r!) as part of the binomial theorem. The formula for ⁿPᵣ is not given, so learn ⁿPᵣ = n!/(n − r)!.
- How do you solve "at least" counting questions?
- Often the quickest way is to count all possible selections and subtract the ones that break the condition, such as those with no women or exactly one woman. Check by direct counting if time allows.
- What is 0! in permutations and combinations?
- 0! = 1. This makes formulas such as ⁿC₀ = 1 and ⁿPₙ = n! work correctly, and the syllabus expects you to know it.
