Distributions from selections and stopping rules
Selection questions split into two forms: a fixed-size group, or an ordered process that continues until something happens.
Five coins give 10 equally likely pairs
pair counts: 1 + 4 + 1 + 2 + 2 = 10
Fixed-size selections: count groups
Jasmine selects two coins from one $5 coin, two $2 coins and two $1 coins. The physical coins are distinct, even when their printed values match. There are equally likely unordered pairs. (9709/52/M/J/24 Q5)
- List the possible totals: 2, 3, 4, 6 and 7.
- Count the physical pairs giving each total.
- Divide every count by the same total, 10.
| x | P(X = x) |
|---|---|
| 2 | 1/10 |
| 3 | 4/10 |
| 4 | 1/10 |
| 6 | 2/10 |
| 7 | 2/10 |
| x | 2 | 3 | 4 | 6 | 7 |
|---|---|---|---|---|---|
| P(X = x) | 1/10 | 4/10 | 1/10 | 2/10 | 2/10 |
Common mistake
Count each table cell with combinations
If 2 counters are selected from 3 red and 5 blue counters and is the number of red counters, then
Use to produce the three table cells.
The denominator counts all two-counter groups. The numerator chooses exactly red counters and the remaining blue counters. Every table cell must use the same sample space.
Examiner note
Stopping processes: multiply in order
Without replacement means a selected object is not returned, so the numbers and probabilities change after every draw. If is the draw on which the first green counter appears, then means: non-green on the first draws, then green.
Worked example
Three non-green and two green counters
Draw without replacement until the first green. The latest possible stop is draw 4, because only three non-green counters exist.
Common mistake
Two counters are selected from 3 red and 2 blue counters. Let be the number of blue counters. Draw up the distribution of .
Show worked answer
There are equally likely groups. Count the groups with 0, 1 and 2 blue counters.
| x | P(X = x) |
|---|---|
| 0 | 3/10 |
| 1 | 6/10 |
| 2 | 1/10 |
| x | 0 | 1 | 2 |
|---|---|---|---|
| P(X = x) | 3/10 | 6/10 | 1/10 |
