Counting questions look short, and then a single word – "together", "at least", "not next to" – changes the whole method. The binomial theorem is similar: SL students expand (a + b)^n for whole-number n, but AA HL students must also handle negative and fractional powers, where the expansion never ends and only works for some values of x.
This guide covers both topics as they appear in IB Mathematics: Analysis and Approaches HL (current course, first assessment 2021, which applies to exams up to November 2028). It sets out the core ideas, four worked examples with every step shown, the mistakes that cost marks, and how to approach these questions in Paper 1 (no calculator) and Paper 2 (calculator). If you want structured help with the whole course, see our IB Maths AA HL tutoring.
What SL covers and what HL adds
| AA SL | AA HL | |
|---|---|---|
| Binomial theorem | (a + b)^n for n a positive integer, using Pascal's triangle and ⁿCᵣ | Same, plus the extension to negative and fractional powers |
| Counting principles | Not a separate topic | The product rule, permutations and combinations, arrangements with restrictions |
| Where it is used | Finding a term or coefficient in an expansion | Counting problems, probability, approximations and series |
Counting also feeds into probability. The binomial distribution uses ⁿCᵣ in every calculation, which is why it is worth being fluent with it. Our probability distributions guide shows that link.
The core ideas
The product principle. If one choice can be made in m ways and a second, independent choice in n ways, the pair can be made in m × n ways. Every counting formula grows out of this.
Permutations (order matters). The number of ways to arrange r objects chosen from n different objects is
nPr = n! / (n − r)!
Arranging all n objects in a line gives n!.
Combinations (order does not matter). The number of ways to choose r objects from n, ignoring order, is
ⁿCᵣ = n! / (r!(n − r)!)
A quick test: if swapping two chosen items gives a *different* outcome (a president and a secretary), use permutations. If it gives the *same* outcome (two members of a committee), use combinations.
Restrictions. Three standard tools handle most restrictions:
- Glue together. Items that must be next to each other are treated as one block. Arrange the blocks, then arrange inside the block.
- Fill the gaps. Items that must *not* be next to each other are placed in the gaps between the other items.
- Complement. For "at least one" or "at least two", it is often quicker to count everything and subtract the cases you do not want.
The binomial theorem (n a positive integer).
(a + b)^n = aⁿ + ⁿC₁ aⁿ⁻¹ b + ⁿC₂ aⁿ⁻² b² + … + bⁿ
The general term is ⁿCᵣ aⁿ⁻ʳ bʳ. Most exam questions ask for one term, so write the general term first and pick the value of r you need.
The extended binomial theorem (HL). For any rational n,
(1 + x)^n = 1 + nx + n(n − 1)x²/2! + n(n − 1)(n − 2)x³/3! + …
When n is a negative integer or a fraction, the series is infinite, and it is valid only for |x| < 1. For (a + bx)^n, take out the factor a first: (a + bx)^n = aⁿ(1 + bx/a)^n, which is valid for |bx/a| < 1.
Worked example 1: arrangements with restrictions
*Four girls and three boys from a school quiz team stand in a line for a photograph. How many arrangements are there if (a) there are no restrictions, (b) the three boys stand together, (c) no two boys stand next to each other?*
(a) Seven different people in a line: 7! = 5040.
(b) Glue the three boys into one block. Now arrange 5 items (four girls and the block): 5! = 120. The boys can be arranged inside the block in 3! = 6 ways.
Total = 120 × 6 = 720.
(c) Arrange the girls first: 4! = 24 ways. This creates 5 gaps (one at each end and three between):
_ G _ G _ G _ G _
Each boy goes in a different gap, and the order matters, so the number of ways is ⁵P₃ = 5 × 4 × 3 = 60.
Total = 24 × 60 = 1440.
Note that "no two boys together" (1440) is not the same as "the boys not all together" (5040 − 720 = 4320). The second count includes arrangements where exactly two boys stand side by side. Confusing the two is a common trap.
Worked example 2: combinations with "at least"
*A committee of 5 is chosen from 6 maths students and 5 physics students. How many committees contain at least 2 physics students?*
Complement method. Total committees: ¹¹C₅ = 462.
Committees with no physics students: ⁶C₅ = 6.
Committees with exactly one physics student: ⁵C₁ × ⁶C₄ = 5 × 15 = 75.
At least 2 physics students: 462 − 6 − 75 = 381.
Check by direct counting.
| Physics | Maths | Ways |
|---|---|---|
| 2 | 3 | ⁵C₂ × ⁶C₃ = 10 × 20 = 200 |
| 3 | 2 | ⁵C₃ × ⁶C₂ = 10 × 15 = 150 |
| 4 | 1 | ⁵C₄ × ⁶C₁ = 5 × 6 = 30 |
| 5 | 0 | ⁵C₅ × ⁶C₀ = 1 |
200 + 150 + 30 + 1 = 381. Both methods agree; the table is a good check when time allows.
Worked example 3: a term in a binomial expansion
*Find the coefficient of x⁴ in the expansion of (2x − 3/x)^10.*
General term:
¹⁰Cᵣ (2x)^(10 − r) (−3/x)^r = ¹⁰Cᵣ × 2^(10 − r) × (−3)^r × x^(10 − 2r)
For x⁴ we need 10 − 2r = 4, so r = 3.
Coefficient = ¹⁰C₃ × 2⁷ × (−3)³ = 120 × 128 × (−27) = −414 720.
Two things to notice. First, the minus sign belongs inside the bracket with the 3, so (−3)³ is negative. Second, the power of x comes from both parts of the term, so collect them before solving for r. The same method gives the constant term (r = 5), which is −1 959 552.
Worked example 4: the extended binomial theorem
*(a) Expand (1 − 2x)^(−1/2) up to the term in x³ and state the values of x for which the expansion is valid. (b) Use your answer to estimate 1/√0.98.*
(a) Use the series with n = −1/2 and "x" replaced by −2x.
- Term in x: n(−2x) = (−1/2)(−2x) = x
- Term in x²: n(n − 1)/2! × (−2x)² = (−1/2)(−3/2)/2 × 4x² = (3/8) × 4x² = (3/2)x²
- Term in x³: n(n − 1)(n − 2)/3! × (−2x)³ = (−1/2)(−3/2)(−5/2)/6 × (−8x³) = (−15/48) × (−8x³) = (5/2)x³
So (1 − 2x)^(−1/2) ≈ 1 + x + (3/2)x² + (5/2)x³.
Valid for |−2x| < 1, that is |x| < 1/2.
(b) 1/√0.98 = (0.98)^(−1/2) = (1 − 2x)^(−1/2) with 1 − 2x = 0.98, so x = 0.01. This is inside the interval of validity.
1 + 0.01 + 1.5(0.0001) + 2.5(0.000001) = 1.0101525
A calculator gives 1.0101525… (to 8 significant figures), so four terms are very accurate here because x is small.
When the bracket does not start with 1. For √(4 + x), take out the 4 first:
√(4 + x) = 2(1 + x/4)^(1/2) = 2 + x/4 − x²/64 + x³/512 + …
This is valid for |x/4| < 1, that is |x| < 4. Forgetting to take out the factor (or forgetting to raise it to the power, here √4 = 2) is one of the most common HL errors.
The same expansion is the Maclaurin series of (1 + x)^p, which you meet again in calculus. Our guide to Maclaurin series and limits builds on it.
Common mistakes
- Using permutations when order does not matter (or the other way round). Ask the swap question every time.
- Forgetting the arrangements inside a block. In example 1(b), leaving out the 3! gives 120 instead of 720.
- Treating "not all together" as "none together". They are different counts.
- Double counting with "at least". Choosing 2 physics students first and then "any 3 others" counts some committees more than once. Use the complement or a table of cases.
- Sign errors in binomial terms. Keep the negative inside the bracket: (−3/x)^r, not −(3/x)^r.
- Leaving out the validity condition for negative or fractional powers, or giving |x| < 1 when the bracket is (1 − 2x) or (4 + x).
- Not taking out the factor when the bracket starts with a number other than 1.
Exam technique: Paper 1, Paper 2 and Paper 3
In AA HL, Paper 1 (120 minutes, no calculator, 30%) and Paper 2 (120 minutes, calculator required, 30%) can both include counting and binomial work. Paper 3 (60 minutes, calculator required, 20%) is two compulsory extended problem-solving questions, which can draw on any part of the course.
- Paper 1. Expect to work out ⁿCᵣ by hand, so cancel factorials before multiplying: ¹⁰C₃ = (10 × 9 × 8)/(3 × 2 × 1) = 120. Leave large answers as products if the question allows, and check signs carefully. Our Paper 1 no-calculator guide has more on building that fluency.
- Paper 2. Use the GDC for ⁿCᵣ and nPr, and to check an expansion numerically: substitute a small value of x into both the original expression and your series.
- Show the method. Write the general term or the case breakdown before the number. A correct method with a slip still earns method marks; a bare wrong number earns nothing.
- Read the restriction words twice. "Together", "not next to", "at least", "exactly" and "different" each change the method.
- Link to proof. Some HL questions ask you to prove an identity with ⁿCᵣ, either algebraically with factorials or by proof by induction.
How to practise
- Do five short counting problems a week, each with a different restriction word, and check each with a second method.
- For binomial work, practise finding one term quickly, then one extended expansion with its validity condition.
- Keep a list of your own errors.
- Revise these topics alongside the rest of HL algebra; our post on partial fractions, systems of equations and polynomials covers the other HL algebra skills.
How Maths Bodhi helps
Counting and binomial questions are about choosing the right method, so our tutors teach the reasoning first (the swap question, blocks, gaps and complements) and then build speed with original exam-style practice. We check the algebra that sits underneath, especially signs and indices, and practise both no-calculator and GDC methods. Work is marked the way IB marking works, with method marks explained, so students see where marks are won and lost. Read more about our IB maths home tutors.
Home tuition is available in Gurgaon (Gurugram). Students elsewhere in India and abroad learn with us online. You can book a free demo class.
Frequently asked questions
- Are permutations and combinations in IB maths AA SL?
- The binomial theorem with positive whole-number powers and ⁿCᵣ is in AA SL, but counting principles with permutations and combinations are part of the AA HL course.
- What is the difference between a permutation and a combination?
- A permutation counts arrangements where order matters, nPr = n!/(n − r)!, while a combination counts selections where order does not matter, ⁿCᵣ = n!/(r!(n − r)!).
- What is the extended binomial theorem in IB maths HL?
- It extends (1 + x)^n to negative and fractional n, giving an infinite series 1 + nx + n(n − 1)x²/2! + … that is valid only for |x| < 1.
- How do I find the interval of validity for a binomial expansion?
- Write the bracket in the form (1 + u)^n, taking out any factor first, then require |u| < 1; for (1 − 2x)^n this gives |x| < 1/2.
- How do I handle "at least" in counting questions?
- Count all possible selections and subtract the cases that break the condition, or list every allowed case in a table and add them; using both is a good check.
- Can I use my calculator for nCr in IB maths?
- In Paper 2 and Paper 3 a GDC is required and can work out nCr and nPr, but Paper 1 has no calculator, so you need to evaluate them by hand by cancelling factorials.
