What you’ll work on
- Count ordered and unordered outcomes and connect counting to equally likely probabilities.
- Explain a method and check the reasonableness of a result.
Start with the idea
When a process has m choices followed by n choices for each first choice, the multiplication principle gives mn outcomes. Factorial n! counts arrangements of n distinct objects; 0! is defined as 1. Specify whether repetition is permitted and whether order matters.
Ordered selections of r distinct objects from n have n(n−1)…(n−r+1) possibilities. For unordered selections, divide by r! because rearranging the selected objects does not create a new group. For probability, favourable-count divided by total-count requires equally likely elementary outcomes.
A worked example
How many ordered two-letter codes can be formed from A, B, C, D without repetition?
- There are 4 choices for the first letter.
- There are then 3 remaining choices for the second.
Answer: 4×3=12
Try one question
A menu has 3 mains and 4 drinks. How many main-and-drink combinations are possible?
Show answer and explanation
12
Choose one item independently from each category.
Inside the collection
| Resource | Length | Practice | Answers |
|---|---|---|---|
| Learn and practise | 4 pages | 4 questions | Included |
| Apply and extend | 4 pages | 4 questions | Included |
| Topic checkpoint | 3 pages | 4 questions | Included |
Read on a device and work in an exercise book, or print the A4 PDFs. These files are not auto-marked digital quizzes.