1.10 Counting principles and extended binomial theorem

1.10 Counting principles and extended binomial theorem

IB Maths: Analysis and Approaches HL: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • "And" means multiply; "or" (separate cases) means add; "at least one" means total minus none.
  • Order matters: nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n-r)!}. Order does not matter: (nr)\binom nr.
  • Identical objects, circular arrangements and proof of the binomial theorem are not examined.
  • (1+x)n(1+x)^n for any rational nn is an infinite series, valid for ∣x∣<1|x|<1.
  • (a+b)n=an(1+ba)n(a+b)^n = a^n\left(1+\frac ba\right)^n, valid for ∣b∣<∣a∣|b|<|a|.

Counting principles

"And" multiplies the ways, "or" adds them, and "at least one" is total minus none.

The multiplication principle: independent choices made in mm and nn ways together give m×nm\times n ways. The addition principle: separate cases that cannot happen together are added.

A useful trick is the complement: "at least one" == total −- none. When there is a restriction, deal with the restricted position or group first.

Shirt 1Shirt 2Trousers 1Trousers 2Trousers 3Trousers 1Trousers 2Trousers 3
Multiplication principle: 2 shirts and 3 pairs of trousers give 2 × 3 = 6 outfits.
  • "And"multiply
  • "Or"add
  • "At least one"total −- none

Worked example

Teams of 4 are chosen from 7 Year 12 and 5 Year 13 students. How many teams have at least one Year 13 student?

A menu has 3 starters, 4 mains and 2 desserts. How many three-course meals are possible?

Permutations

A permutation is an arrangement where order matters: nPr=n!(n−r)!{}^nP_r = \frac{n!}{(n-r)!}.

A permutation counts ordered selections. nn different objects in a row can be arranged in n!n! ways, and ordered selections of rr from nn number nPr=n(n−1)⋯(n−r+1){}^nP_r = n(n-1)\cdots(n-r+1). For 4-digit PINs from different digits 1 to 9: 9P4=3024{}^9P_4 = 3024.

For objects that must be together, treat them as one block, arrange the blocks, then arrange inside the block.

050010001500200025003000972r = 1r = 2r = 3r = 4r digits chosenArrangements
Number of ordered selections of r different digits from 1 to 9 (P(9, r)).
  • nn different objects in a rown!n!
  • Ordered choice of rr from nnn!(n−r)!\dfrac{n!}{(n-r)!}

Worked example

Arrange 7 different books on a shelf with the 3 maths books together.

In how many ways can 5 different people stand in a queue?

Combinations

A combination is a selection where order does not matter: (nr)=n!r!(n−r)!\binom nr = \frac{n!}{r!(n-r)!}.

A combination is a selection. Each combination of rr objects matches r!r! permutations, so (nr)=nPrr!\binom nr = \frac{{}^nP_r}{r!}.

Choosing from two groups, exactly 2 from 7 and 2 from 5 is (72)×(52)=210\binom72\times\binom52 = 210 (multiply, since every pair goes with every pair). Use (nr)\binom nr for a committee or team: swapping two chosen people gives the same selection.

0246810012345r5Cr
Combinations of r objects from 5: the values are symmetrical because choosing r to include is the same as choosing 5 − r to leave out.

Permutation

  • Order matters
  • nPr{}^nP_r
  • PIN codes, queues

Combination

  • Order does not matter
  • (nr)\binom nr
  • Committees, teams

A committee of 3 is chosen from 8 people. How many committees are possible?

Rational powers

For any rational nn and ∣x∣<1|x|<1, (1+x)n(1+x)^n is an infinite series.

The booklet gives (1+x)n=1+nx+n(n−1)2!x2+n(n−1)(n−2)3!x3+⋯(1+x)^n = 1+nx+\frac{n(n-1)}{2!}x^2+\frac{n(n-1)(n-2)}{3!}x^3+\cdots for n∈Qn\in\mathbb{Q}. When nn is not a positive integer the series never stops, and it converges only when ∣x∣<1|x|<1.

Put any substituted term in brackets: (−2x)2=4x2(-2x)^2 = 4x^2, not −4x2-4x^2.

−0.2−0.10.10.20.3246810121416xy(0, 1)y = (1 − 2x)^−31 + 6x + 24x²
Three-term approximation (dashed): good near x=0x=0, poor near x=12x=\frac12.

Worked example

Expand (1−2x)−3(1-2x)^{-3} as far as x2x^2 and state when it is valid.

What are the first three terms of (1+x)−1(1+x)^{-1}?

Taking out a factor

Take out ana^n first so the bracket starts with 1: (a+b)n=an(1+ba)n(a+b)^n = a^n\left(1+\frac ba\right)^n.

The extended expansion works directly only for (1+… )n(1+\dots)^n, so factor first. It is valid for ∣ba∣<1\left|\frac ba\right|<1. Raise the factor to the power too: (8+3x)13=2(1+3x8)13(8+3x)^{\frac13} = 2\left(1+\frac{3x}{8}\right)^{\frac13}, not 8(… )8(\dots). Then multiply every term by 2.

For an approximation, substitute a small xx: with x=0.01x=0.01, (1+4x)−12≈1−2x+6x2(1+4x)^{-\frac12}\approx1-2x+6x^2 gives 11.04≈0.9806\frac1{\sqrt{1.04}}\approx0.9806.

  1. 1

    Factor

    Write an(1+ba)na^n\left(1+\frac ba\right)^n

  2. 2

    Expand

    Use the series with x=bax=\frac ba

  3. 3

    Multiply

    Multiply every term by ana^n

  4. 4

    State validity

    ∣ba∣<1\left|\frac ba\right|<1

Expanding (a+b)n(a+b)^n

Worked example

Expand (8+3x)13(8+3x)^{\frac13} as far as x2x^2 and state when it is valid.

For which values of xx is the expansion of (4+x)−1(4+x)^{-1} valid?

Try an exam question

Expand (8+3x)13(8+3x)^{\frac13} in ascending powers of xx as far as the term in x2x^2, and state the values of xx for which the expansion is valid.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Find the number of different teams that can be chosen.

1 mark, marked against the mark scheme

Revision notes