Mixed Combinatorics & Exam Technique
You've mastered permutations, combinations, the Binomial Theorem, inclusion-exclusion, pigeonhole, and combinatorial identities. Now it's time to synthesise everything. In this final lesson you'll build a decision framework for approaching any combinatorics problem cold — and lock in the exam habits that separate Band 5 from Band 6.
A committee of 5 is chosen from 6 men and 4 women. Without calculating — roughly how many committees do you think contain at least 2 women? And how would you approach this type of problem in an exam? Jot your instinct before reading on.
Every combinatorics problem can be decoded by answering these five questions in order. Practise applying them until it becomes automatic.
- Does order matter? Yes → permutation ($^nP_r$); No → combination ($^nC_r$).
- Are there restrictions? (fixed positions, items that must stay together, items that cannot be adjacent)
- Is the arrangement linear or circular? Circular → fix one element, arrange the rest: $(n-1)!$
- Are there overlapping conditions? Use inclusion-exclusion: $|A \cup B| = |A| + |B| - |A \cap B|$
- Does the problem require proving existence? Yes → Pigeonhole Principle.
Key facts
- The five-question decision framework for combinatorics
- When to use complement vs. direct case analysis for "at least" problems
- Exam writing conventions: define variables, justify multiply/add steps
Concepts
- How all Module 4 techniques connect: permutations, combinations, circular, PIE, pigeonhole, Binomial Theorem
- Why impossible cases (e.g., choosing 4 from 3) must be checked before summing
- How exam mark allocations signal the expected method and length of response
Skills
- Apply the decision framework to decode unseen problems
- Correctly split "at least" problems into cases or use complement
- Identify and discard impossible cases before calculating
Strong exam technique in combinatorics is as important as knowing the formulas. Follow these four principles in every response:
- Write your reasoning: Show clearly why you multiply (independent steps) or add (mutually exclusive cases). Never write a string of numbers without explanation.
- Define variables: State explicitly what $n$ and $r$ represent in context. E.g., "choosing $r = 3$ items from $n = 8$ distinct books (order doesn't matter)".
- Simplify factorials: When exact values are large, leave answers as products of factorials or simplified fractions. $\frac{8!}{3!\cdot 5!}$ is a perfectly valid final form.
- Check plausibility: Does your answer make sense? The number of committees can't exceed the total number of ways to choose 5 from 10 people ($^{10}C_5 = 252$).
Framework: Order? → Restrictions? → Linear/Circular? → Overlapping? → Existence?; Multiply steps when they are independent; add when cases are mutually exclusive
Pause — copy the five-question framework into your book: (1) order? → P or C; (2) restrictions? → fix/glue/gap; (3) linear/circular?; (4) overlapping cases?; (5) existence? → Pigeonhole; multiply steps when independent, add when mutually exclusive.
Quick check: A password must use 3 different letters from the alphabet (26 letters, order matters). Which formula applies?
We just saw the five-question framework: (1) order? (2) restrictions? (3) linear or circular? (4) overlapping? (5) existence? — working through this systematically identifies which formula and method to apply. That raises a question: "at least $k$" problems seem to require summing many cases — is there a shortcut? This card answers it → yes: use the complement — total outcomes minus (fewer than $k$ outcomes), which usually has fewer cases.
Problems using "at least" language can be solved two ways. Choose whichever has fewer cases:
- Direct case analysis: List every qualifying case and add. Best when there are only 2–3 cases.
- Complement method: Total $-$ (cases that fail the condition). Best when failure is a single case or very few cases.
Always check whether all listed cases are actually possible. For example, "choose 4 consonants from EQUATION" has only 3 consonants (Q, T, N) — that case is impossible and contributes 0 to the count.
"At least k": try complement first — total - (fewer than k); Direct case method: list all qualifying cases, compute each, then add (use when complement is complex)
Pause — copy the "at least" strategy into your book: try complement first — total $-$ (fewer than $k$); use direct case method only when the complement is more complex than listing the qualifying cases.
Did you get this? True or false: the complement method for "at least 1 woman" in a committee problem gives Total $-$ (0 women).
Worked examples · 3 in a row, reveal as you go
A committee of 5 is to be chosen from 6 men and 4 women. How many committees contain at least 2 women?
How many 4-letter arrangements from the word EQUATION contain at least one vowel?
Find the coefficient of $x^3$ in the expansion of $(1 + 2x)^5$.
Fill the gap: In the committee example (6 men, 4 women, choose 5), the number of committees with exactly 3 women is $^4C_3 \times \,^6C_2 = $ .
Misconceptions to fix · the 3 traps that cost marks
Did you get this? True or false: $^3C_4 = 0$ because you cannot choose 4 objects from only 3.
Activities · practice with the ideas
A team of 5 is chosen from 7 boys and 5 girls. How many teams have more boys than girls? (Hint: list cases where boys > girls.)
Find the number of ways to arrange the letters of BANANA.
Find the coefficient of $x^3$ in the expansion of $(1 + 2x)^5$. Show full working using the general term formula.
How many 5-digit numbers can be formed using the digits 1, 2, 3, 4, 5 (no repetition) if the number must be even?
Apply the decision framework to this problem: "In how many ways can 8 people sit around a circular table?" State your answer to each of the five framework questions.
Earlier you estimated the number of committees with at least 2 women from 6 men and 4 women (choosing 5).
The exact answer is 186: $6 \times 20 + 4 \times 15 + 1 \times 6 = 120 + 60 + 6$. Out of $^{10}C_5 = 252$ total committees, 186 (about 74%) contain at least 2 women. The reason it's so high: with only 6 men, it's actually hard to get committees that are mostly male.
Odd one out: Which of the following does NOT belong to the Module 4 toolkit?
Pick your answer, then rate your confidence — that tells the system what to drill next. Each retry pulls a fresh mix from the bank.
Q1. A team of 5 is chosen from 7 boys and 5 girls. How many teams have more boys than girls? (2 marks)
Q2. Find the number of distinct arrangements of the letters in the word BANANA. (2 marks)
Q3. (a) Find the coefficient of $x^3$ in $(1 + 2x)^5$ using the general term. (b) Explain why the complement method would be inefficient for finding the number of 4-letter arrangements from EQUATION containing at least one vowel, and state the answer directly. (3 marks)
Comprehensive answers (click to reveal)
Activity 1:
1. More boys than girls (teams of 5): cases 3B+2G, 4B+1G, 5B+0G.
$= \,^7C_3 \cdot \,^5C_2 + \,^7C_4 \cdot \,^5C_1 + \,^7C_5 \cdot \,^5C_0 = 35 \times 10 + 35 \times 5 + 21 \times 1 = 350 + 175 + 21 = 546$
2. BANANA: 6 letters; A appears 3 times, N appears 2 times.
Distinct arrangements $= \dfrac{6!}{3! \times 2!} = \dfrac{720}{6 \times 2} = 60$
3. Coefficient of $x^3$ in $(1+2x)^5$: $T_4 = \binom{5}{3} \cdot 2^3 \cdot x^3 = 10 \times 8 \cdot x^3$. Coefficient $= 80$.
4. Even 5-digit number from {1,2,3,4,5} (no repetition): last digit must be 2 or 4 (2 choices). Remaining 4 positions: $4! = 24$ ways. Total $= 2 \times 24 = 48$.
5. Framework for 8 people in a circle: (1) Order matters — yes (different seating arrangements are distinct); (2) No restrictions; (3) Circular; (4) No overlapping conditions; (5) No existence question. Answer: $(8-1)! = 7! = 5040$.
Q1 (2 marks): Cases: 3B+2G, 4B+1G, 5B+0G [0.5 for identifying all cases].
$\,^7C_3 \cdot \,^5C_2 + \,^7C_4 \cdot \,^5C_1 + \,^7C_5 \cdot \,^5C_0 = 350 + 175 + 21 = \mathbf{546}$ [1.5].
Q2 (2 marks): 6 letters total; A $\times 3$, N $\times 2$ [0.5].
$\dfrac{6!}{3! \times 2!} = \dfrac{720}{12} = \mathbf{60}$ distinct arrangements [1.5].
Q3 (3 marks): (a) $T_{r+1} = \binom{5}{r}(2x)^r$; set $r=3$: $T_4 = 10 \times 8 \cdot x^3$. Coefficient $= \mathbf{80}$ [1.5]. (b) The complement requires 4 consonants from only 3 available (Q, T, N), which is impossible — $^3P_4 = 0$. Therefore all $^8P_4 = 1680$ arrangements contain at least one vowel [1.5].
Five timed questions drawn from across Module 4. Beat the boss to bank a tier — gold (90% + speed), silver (75%), or bronze (50%). This is your final Module 4 challenge. Replays welcome.
⚔ Enter the arenaClimb platforms by answering combinatorics questions. Lighter alternative to the boss — great for a final recap before the checkpoint.
- Always decide if order matters first: permutation ($^nP_r$) vs. combination ($^nC_r$).
- Check for restrictions, circular arrangements, and overlapping conditions before calculating.
- For "at least" problems: use case analysis (2–3 cases) or complement (1 failing case). Verify all cases are possible ($r \leq n$).
- Show clear working: define $n$ and $r$, justify why you multiply or add, and check plausibility.
- Before the Module 4 checkpoint or exam: review any lesson where you felt uncertain. The five-question framework is your starting point for every problem.
Mark lesson as complete
Tick when you've finished the practice and review.