1.10 Counting principles and extended binomial theorem
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: . Order does not matter: .
- Identical objects, circular arrangements and proof of the binomial theorem are not examined.
- for any rational is an infinite series, valid for .
- , valid for .
Counting principles
"And" multiplies the ways, "or" adds them, and "at least one" is total minus none.
The multiplication principle: independent choices made in and ways together give 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.
- "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?
- 1
Total teams: .
- 2
No Year 13 student: .
- 3
Subtract: .
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: .
A permutation counts ordered selections. different objects in a row can be arranged in ways, and ordered selections of from number . For 4-digit PINs from different digits 1 to 9: .
For objects that must be together, treat them as one block, arrange the blocks, then arrange inside the block.
- different objects in a row
- Ordered choice of from
Worked example
Arrange 7 different books on a shelf with the 3 maths books together.
- 1
One block plus 4 books is 5 items: ways.
- 2
Arrange the 3 books inside the block: ways.
- 3
.
In how many ways can 5 different people stand in a queue?
Combinations
A combination is a selection where order does not matter: .
A combination is a selection. Each combination of objects matches permutations, so .
Choosing from two groups, exactly 2 from 7 and 2 from 5 is (multiply, since every pair goes with every pair). Use for a committee or team: swapping two chosen people gives the same selection.
Permutation
- Order matters
- PIN codes, queues
Combination
- Order does not matter
- Committees, teams
A committee of 3 is chosen from 8 people. How many committees are possible?
Rational powers
For any rational and , is an infinite series.
The booklet gives for . When is not a positive integer the series never stops, and it converges only when .
Put any substituted term in brackets: , not .
Worked example
Expand as far as and state when it is valid.
- 1
Use and replace by .
- 2
- 3
- 4
Valid when .
What are the first three terms of ?
Taking out a factor
Take out first so the bracket starts with 1: .
The extended expansion works directly only for , so factor first. It is valid for . Raise the factor to the power too: , not . Then multiply every term by 2.
For an approximation, substitute a small : with , gives .
- 1
Factor
Write
- 2
Expand
Use the series with
- 3
Multiply
Multiply every term by
- 4
State validity
Worked example
Expand as far as and state when it is valid.
- 1
.
- 2
- 3
Multiply by 2.
- 4
Valid when .
For which values of is the expansion of valid?
Try an exam question
Expand in ascending powers of as far as the term in , and state the values of for which the expansion is valid.
[4 marks]
- [1]Takes out 8: .
- [1]Expands the bracket:
- [1]Multiplies by 2:
- [1]States , so .
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
Find the number of different teams that can be chosen.
1 mark, marked against the mark scheme