Counting principles and the extended binomial theorem
In a minute
Counting principles let you count arrangements and selections without listing them. Multiply for stages, add for separate cases, and use when order matters and when it doesn't. The binomial theorem also works for negative and fractional powers: the expansion never ends, and it is valid only for small enough .
You'll be able to
- Count outcomes with the and the : multiply for stages, add for separate cases.
- Use when order matters and when it doesn't, for objects that are all different.
- Count arrangements with conditions: objects kept together, kept apart, or at least one of a kind.
- Expand for negative and fractional by taking outside, and state when the expansion is valid.
- Use these expansions to find coefficients and approximations, without needing to prove the theorem.
Before you start3 quick questions on what this builds on
Revise first: 1.9 Binomial theorem
Multiply for stages, add for cases
Listing works only for tiny problems. Choose one of 3 mains and one of 2 drinks: on a tree diagram each main branches into 2 drinks, giving meals. Multiplying works because every first choice leads to the same number of second choices.
The counts arrangements too. To put different objects in a row, the first place has choices, the next , and so on down to .
You met , read “ ”, in 1.9. So different objects can be put in a row in ways.
Try it first, then reveal one step at a time.
- The second course is a starter or a dessert. These are separate cases, so use the : ways.
- Choosing the main and then the second course are two stages, so multiply: .
- Check by counting each case on its own: deals with a starter and with a dessert. Then .
Try it first, then reveal one step at a time.
- Fill the restricted places first. The first digit must be 4, 5, 6 or 7, and the last must be 1, 3, 5 or 7.
- The digits 5 and 7 fit both restricted places, so the two choices affect each other. Split into cases by the first digit.
- Case 1: the first digit is 4 or 6 (2 ways). All four odd digits are free, so the last has 4 ways. The middle two places take 2 of the 5 digits left, in order: ways. So .
- Case 2: the first digit is 5 or 7 (2 ways). One odd digit is used, so the last has 3 ways. The middle again has 20 ways. So .
- The cases are separate, so add: .
Permutations and combinations
Twelve swimmers race in a final. Awarding gold, silver and bronze is a choice where order matters: Ana gold and Ben silver differs from Ben gold and Ana silver. There are ways.
Now pick 3 of the 12 for a relay squad with no positions. Each squad of 3 was counted times above, once per order, so there are squads.
Count with the : choices for the first place, for the second, down to for the th. That product is .
Each of objects can be ordered in ways, so counts it times. Dividing gives , the same as in the binomial theorem.
Both formulas are in the formula booklet. Your job is to choose between them. Ask: does swapping two chosen objects give a different outcome? If yes, use a permutation. If no, use a combination.
In this course every object is different, and places are in a line or labelled. Arrangements with identical objects (such as the letters of LEVEL) and arrangements around a circle are not required.
Try it first, then reveal one step at a time.
- Any 2 of the vertices give a segment, and the order of the two ends doesn't matter. So there are segments.
- Exactly of these segments are sides, not diagonals. So .
- Write without factorials: . So .
- Multiply by 2 and collect terms: , so .
- Factorise: . A number of sides is positive, so reject .
- Check: .
Try it first, then reveal one step at a time.
- A sample has no order, so use combinations. Choose the 2 faulty batteries from the 5 faulty ones: ways.
- The other 4 batteries must work, so choose them from the 15 working ones: ways.
- These are two stages of one choice, so multiply. Write down what you enter: .
- The calculator gives .
- Check the sizes: in the sample and in the box.
Together, apart and at least one
Most exam counting questions add a condition. Four tools handle nearly all of them.
1. Together: glue the objects into one block. Arrange the block with the other objects, then multiply by the orders inside the block. With several blocks, the blocks themselves are items you arrange.
2. Apart: count every arrangement, then subtract those where the objects are together.
3. No two of a kind next to each other: arrange the other objects first. Then put the restricted objects into the gaps between them, one per gap, including both ends.
4. At least one: count every outcome, then subtract those with none.
Try it first, then reveal one step at a time.
- Count every arrangement: .
- Count those with Lena and Omar together. Glue them into one block, so there are 5 items to arrange: ways.
- Inside the block, Lena and Omar can stand in orders. So arrangements have them together.
- Subtract from the total: .
Try it first, then reveal one step at a time.
- Arrange the floats first, ignoring the bands: ways.
- The 5 floats make 6 gaps: one before the first float, four between floats and one after the last.
- Put each band in a different gap, so no two bands touch. The bands are different, so order matters: ways.
- The two stages multiply: .
- Nothing is counted twice: the floats' order and each band's gap fix the whole line.
Binomial expansions for negative and fractional powers
In 1.9 the expanded for a positive whole number . Its coefficient equals , and that form makes sense for any .
For , the coefficient is , and so is every later one: the expansion stops. If is negative or a fraction, no factor is ever zero, so it goes on for ever.
Try : , a geometric series with ratio . From 1.8, its sum is only when . For other the terms do not shrink to zero, and the series has no sum.
For , first take out so the bracket starts with : . Then use the series with replaced by . This form is in the formula booklet.
You use these expansions without proof: proving the binomial theorem is not required. 5.19 shows where the series comes from, as a Maclaurin series.
Try it first, then reveal one step at a time.
- Use with and . Keep in a bracket, so its sign and its power are not lost.
- Term in : .
- Term in : .
- Term in : .
- The expansion is valid when , that is .
Try it first, then reveal one step at a time.
- Take 8 out: .
- Expand with and : .
- Multiply by 2: , valid for , that is .
- Match the whole root: gives , well inside .
- Substitute: .
- Check: and , which agree to 6 decimal places.
Try it first, then reveal one step at a time.
- Write the root as a power: .
- Expand with and , up to :
- Multiply by , keeping only the products that give : and .
- Add them: . The expansion is valid for , that is .
Common mistakes
- Using for a group with no roles, or for different roles. If swapping two chosen people changes the outcome, order matters.
- Multiplying cases that are alternatives. Separate cases are added. Only the stages inside one case are multiplied.
- Forgetting the order inside a block. Two people glued together can stand in orders, and several blocks can also swap places.
- Leaving out the end gaps. With objects in a row there are gaps, so a restricted object can also stand at either end.
- Raising only the to a power. , not , so keep the whole of , such as , in a bracket.
- Matching the wrong part when you approximate. For from , solve , then check that is inside the valid range.
Exam tips
- “Find” or “determine” the number of ways: write the counting expression, such as , before the number. It earns the method mark even if the arithmetic slips.
- “State the values of for which the expansion is valid”: turn into an inequality in , such as .
- “Hence” approximate: show the value of you substitute, how you found it, and that it lies in the valid range.
Key takeaways
Practise this
22 past-paper questions on 1.10 in the AA HL bank, each with a mark scheme and a worked explanation.