Count outcomes using the fundamental counting principle, permutations and combinations, and choose the correct method for a situation.
1Key ideas2Key ideas3Key ideas4Key ideas5Key ideas
Key ideas
Fundamental counting principle: if one choice can be made in m ways and a second in n ways, both can be made in m × n ways.
n! (n factorial) is n × (n − 1) × … × 1, and 0! = 1.
A permutation is an arrangement in which order matters:
1 / 5Next ▶
6
A combination is a selection in which order does not matter:
◀ Previous2 / 5Next ▶
Key ideas
Arrangements of n objects with repeats: n! divided by the factorial of each repeat count.
n distinct objects can be arranged around a circle in (n − 1)! ways.
◀ Previous3 / 5Next ▶
Key ideas
, and the coefficients in the expansion of (a + b)
◀ Previous4 / 5Next ▶
1Worked examples2Worked examples3Worked examples
1
How many 3-digit codes can be made from 1–5 without repeating a digit?
2
— 5 × 4 × 3 = 60
which is
1 / 3Next ▶
Worked examples
How many committees of 3 can be chosen from 8 people?
= (8 × 7 × 6)/(3 × 2 × 1) = 56.
How many different arrangements of the letters of LEVEL?
◀ Previous2 / 3Next ▶
Factorial
Factorial — the product of all positive integers up to n
Permutation
Permutation — an ordered arrangement
Combination
Combination — an unordered selection
Sample space
Sample space — the set of all possible outcomes
Tree diagram
Tree diagram — a branching diagram that lists outcomes
Permutation or combination?
| Question type |
Order matters? |
Use |
| Ranking, codes, seating |
Yes |
nPr |
| Teams, committees, hands of cards |
No |
nCr |
| Letters with repeats |
Yes |
n!/(repeats)! |
1
Ask: would swapping two chosen items give a different result? If yes, it is a permutation.
2
Cancel factorials before multiplying.
3
“And” between stages means multiply; “or” between separate cases means add.
4
nPr is always at least as large as nCr.