1.10 · AHL · HL onlyPaper 1Paper 2Paper 3

Counting principles and the extended binomial theorem

Builds on 1.9 Binomial theorem28 min read

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 xx.

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 (a+b)n(a + b)^{n} for negative and fractional nn by taking ana^{n} 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
Check yourself
Find the value of 7C3{}^{7}C_{3}.
Check yourself
Find the coefficient of x2x^{2} in the expansion of (2+x)5(2 + x)^{5}.
Check yourself
Find the value of 8!6!\frac{8!}{6!}.

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 3×2=63 \times 2 = 6 meals. Multiplying works because every first choice leads to the same number of second choices.

The counts arrangements too. To put nn different objects in a row, the first place has nn choices, the next n−1n - 1, and so on down to 11.

Learn this
n!=n×(n−1)×(n−2)×⋯×2×1,0!=1n! = n \times (n - 1) \times (n - 2) \times \cdots \times 2 \times 1, \qquad 0! = 1

You met n!n!, read “nn ”, in 1.9. So nn different objects can be put in a row in n!n! ways.

Worked exampleA café sells 4 starters, 6 mains and 3 desserts, all different. A lunch deal is one main together with either one starter or one dessert, but not both. How many different lunch deals are there?

Try it first, then reveal one step at a time.

  1. The second course is a starter or a dessert. These are separate cases, so use the : 4+3=74 + 3 = 7 ways.
Worked exampleFour-digit numbers are made from the digits 1, 2, 3, 4, 5, 6 and 7, with no digit used more than once. How many of these numbers are odd and greater than 4000?

Try it first, then reveal one step at a time.

  1. 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.
Check yourself
Three-digit numbers are made from the digits 1 to 7, and digits may repeat. How many of these numbers are even?

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 12×11×10=132012 \times 11 \times 10 = 1320 ways.

Now pick 3 of the 12 for a relay squad with no positions. Each squad of 3 was counted 3!=63! = 6 times above, once per order, so there are 13206=220\frac{1320}{6} = 220 squads.

Count with the : nn choices for the first place, n−1n - 1 for the second, down to n−r+1n - r + 1 for the rrth. That product is n!(n−r)!\frac{n!}{(n-r)!}.

In the formula booklet
nPr=n!(n−r)!{}^{n}P_{r} = \frac{n!}{(n-r)!}

Each of rr objects can be ordered in r!r! ways, so nPr{}^{n}P_{r} counts it r!r! times. Dividing gives nCr=nPrr!{}^{n}C_{r} = \frac{{}^{n}P_{r}}{r!}, the same nCr{}^{n}C_{r} as in the binomial theorem.

In the formula booklet
nCr=n!r!(n−r)!{}^{n}C_{r} = \frac{n!}{r!(n-r)!}

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.

Check yourself
A gallery has 9 different paintings and a wall with 4 hooks in a row. In how many ways can 4 of the paintings be hung on the hooks?
Worked exampleA diagonal of a polygon is a line segment joining two vertices that are not next to each other. A convex polygon with nn sides has 54 diagonals. Find nn.

Try it first, then reveal one step at a time.

  1. Any 2 of the nn vertices give a segment, and the order of the two ends doesn't matter. So there are nC2{}^{n}C_{2} segments.
Worked exampleA box holds 20 batteries, of which 5 are faulty. A sample of 6 batteries is taken from the box. Use your calculator to find the number of different samples that contain exactly 2 faulty batteries.

Try it first, then reveal one step at a time.

  1. A sample has no order, so use combinations. Choose the 2 faulty batteries from the 5 faulty ones: 5C2{}^{5}C_{2} ways.
Check yourself
A squad of 5 players is chosen from 7 forwards and 6 defenders. The squad must include at least 3 forwards. How many different squads are possible?

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.

Worked exampleSix friends, including Lena and Omar, stand in a row for a photo. Find the number of arrangements in which Lena and Omar are not next to each other.

Try it first, then reveal one step at a time.

  1. Count every arrangement: 6!=7206! = 720.
Five floats in a row, drawn as boxes labelled F1 to F5. Six gaps are marked with arrows: one before the first float, four between neighbouring floats, and one after the last float. Each band goes into a different gap. F1 F2 F3 F4 F5 gap 1 gap 2 gap 3 gap 4 gap 5 gap 6 a band may go in any gap, at most one band per gap
Five floats make six gaps, counting both ends. Putting each band in a different gap keeps the bands apart.
Worked exampleA parade has 5 different floats and 3 different marching bands, moving in a single line. No two marching bands may be next to each other. How many different orders are possible?

Try it first, then reveal one step at a time.

  1. Arrange the floats first, ignoring the bands: 5!=1205! = 120 ways.
Check yourself
Seven different cars park in a row of 7 bays. Two of the cars are red. In how many ways can the cars park so that the red cars are not next to each other?
Check yourself
A panel of 4 people is chosen from 6 women and 5 men. How many panels contain at least one man?

Binomial expansions for negative and fractional powers

In 1.9 the expanded (1+x)n(1 + x)^{n} for a positive whole number nn. Its coefficient nCr{}^{n}C_{r} equals n(n−1)⋯(n−r+1)r!\frac{n(n-1)\cdots(n-r+1)}{r!}, and that form makes sense for any nn.

For n=3n = 3, the x4x^{4} coefficient is 3×2×1×04!=0\frac{3 \times 2 \times 1 \times 0}{4!} = 0, and so is every later one: the expansion stops. If nn is negative or a fraction, no factor is ever zero, so it goes on for ever.

Try n=−1n = -1: (1+x)−1=1−x+x2−x3+…(1 + x)^{-1} = 1 - x + x^{2} - x^{3} + \ldots, a geometric series with ratio −x-x. From 1.8, its sum is 11+x\frac{1}{1 + x} only when ∣x∣<1\lvert x\rvert < 1. For other xx the terms do not shrink to zero, and the series has no sum.

Learn this
(1+x)n=1+nx+n(n−1)2!x2+n(n−1)(n−2)3!x3+⋯ ,∣x∣<1(1 + x)^{n} = 1 + nx + \frac{n(n-1)}{2!}x^{2} + \frac{n(n-1)(n-2)}{3!}x^{3} + \cdots, \quad \lvert x\rvert < 1

For (a+b)n(a + b)^{n}, first take aa out so the bracket starts with 11: (a+b)n=an(1+ba)n(a + b)^{n} = a^{n}\left(1 + \frac{b}{a}\right)^{n}. Then use the series with xx replaced by ba\frac{b}{a}. This form is in the formula booklet.

In the formula booklet
(a+b)n=an(1+n(ba)+n(n−1)2!(ba)2+⋯ ),n∈Q(a + b)^{n} = a^{n}\left(1 + n\left(\frac{b}{a}\right) + \frac{n(n-1)}{2!}\left(\frac{b}{a}\right)^{2} + \cdots\right), \quad n \in \mathbb{Q}

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.

Worked exampleFind the first four terms of the expansion of (1−2x)−3(1 - 2x)^{-3} in ascending powers of xx. State the values of xx for which the expansion is valid.

Try it first, then reveal one step at a time.

  1. Use (1+u)n(1 + u)^{n} with n=−3n = -3 and u=−2xu = -2x. Keep uu in a bracket, so its sign and its power are not lost.
Check yourself
For which values of xx is the expansion of (2+5x)−1(2 + 5x)^{-1} valid?
Worked example(a) Find the first three terms of the expansion of 8−x3\sqrt[3]{8 - x} as a series in xx. (b) Hence find an approximation to 7.93\sqrt[3]{7.9} as a fraction.

Try it first, then reveal one step at a time.

  1. Take 8 out: (8−x)13=813(1−x8)13=2(1−x8)13(8 - x)^{\frac{1}{3}} = 8^{\frac{1}{3}}\left(1 - \frac{x}{8}\right)^{\frac{1}{3}} = 2\left(1 - \frac{x}{8}\right)^{\frac{1}{3}}.
Check yourself
Find the coefficient of x3x^{3} in the expansion of (1+x2)−3\left(1 + \frac{x}{2}\right)^{-3}. Give your answer as a decimal.
Worked exampleFind the coefficient of x2x^{2} in the expansion of 3−x1+4x\frac{3 - x}{\sqrt{1 + 4x}} in ascending powers of xx.

Try it first, then reveal one step at a time.

  1. Write the root as a power: 3−x1+4x=(3−x)(1+4x)−12\frac{3 - x}{\sqrt{1 + 4x}} = (3 - x)(1 + 4x)^{-\frac{1}{2}}.
Check yourself
In the expansion of (1+ax)−3(1 + ax)^{-3}, the coefficient of xx is −12-12. Find the coefficient of x2x^{2}.

Common mistakes

  • Using nPr{}^{n}P_{r} for a group with no roles, or nCr{}^{n}C_{r} 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 2!2! orders, and several blocks can also swap places.
  • Leaving out the end gaps. With kk objects in a row there are k+1k + 1 gaps, so a restricted object can also stand at either end.
  • Raising only the xx to a power. (−2x)2=4x2(-2x)^{2} = 4x^{2}, not −2x2-2x^{2}, so keep the whole of ba\frac{b}{a}, such as −2x-2x, in a bracket.
  • Matching the wrong part when you approximate. For 7.93\sqrt[3]{7.9} from 8−x3\sqrt[3]{8 - x}, solve 8−x=7.98 - x = 7.9, then check that xx is inside the valid range.

Exam tips

  • “Find” or “determine” the number of ways: write the counting expression, such as 5C2×15C4{}^{5}C_{2} \times {}^{15}C_{4}, before the number. It earns the method mark even if the arithmetic slips.
  • “State the values of xx for which the expansion is valid”: turn ∣ba∣<1\left\lvert\frac{b}{a}\right\rvert < 1 into an inequality in xx, such as ∣x∣<25\lvert x\rvert < \frac{2}{5}.
  • “Hence” approximate: show the value of xx you substitute, how you found it, and that it lies in the valid range.

Key takeaways

In bookletnPr=n!(n−r)!{}^{n}P_{r} = \frac{n!}{(n-r)!}
In bookletnCr=n!r!(n−r)!{}^{n}C_{r} = \frac{n!}{r!(n-r)!}
In booklet(a+b)n=an(1+n(ba)+n(n−1)2!(ba)2+⋯ ),n∈Q(a + b)^{n} = a^{n}\left(1 + n\left(\frac{b}{a}\right) + \frac{n(n-1)}{2!}\left(\frac{b}{a}\right)^{2} + \cdots\right), \quad n \in \mathbb{Q}
Learn this“And” means multiply, “or” means add. Fill the most restricted places first.
Learn thisOrder matters: nPr{}^{n}P_{r}. Order doesn't matter: nCr=nPrr!{}^{n}C_{r} = \frac{{}^{n}P_{r}}{r!}.
Learn thisTogether: glue into a block and multiply by the orders inside it. Apart or at least one: the total minus the opposite. No two next to each other: use the gaps, including both ends.
Learn thisFor negative or fractional nn, take ana^{n} outside first. The expansion never stops and is valid only for ∣ba∣<1\left\lvert\frac{b}{a}\right\rvert < 1.

Practise this

22 past-paper questions on 1.10 in the AA HL bank, each with a mark scheme and a worked explanation.

Practise 1.10 →