Worked solution
Use order counts instead of expanding every draw path
A box contains 5 white balls,3 red balls and 2 green balls.
(i) Three balls are taken at random with replacement. Find the probability that they all have different colours.
(ii) Five balls are taken at random without replacement. Find the probability that (a) exactly 2 are white, (b) at least 2 are white, (c) exactly 2 are red, given that at least 2 are white.
[SP2006/II/6]
CJC · Lecture · Example 10
(i) Method 1: sum the six different-colour paths
Let denote the colour on draw i. With replacement the probabilities stay 0.5,0.3,0.2 at every split. The complete tree has 27 colour paths. The favourable paths are WRG, WGR, RWG, RGW, GWR, GRW, with products 0.5×0.3×0.2,0.5×0.2×0.3,0.3×0.5×0.2,0.3×0.2×0.5,0.2×0.5×0.3,0.2×0.3×0.5. Each is 0.03, so their sum is 0.18. The fifth symbolic term in both copies prints ; the intended GWR path is , consistent with its numerical product.
(i) Method 2: count the colour orders
There are 3! orders of three distinct colours, so . Follow the Teacher guidance: the full tree is tedious and unnecessary for this calculation; use the order count once the one-path product is clear.
(ii) Choose a tractable model without replacement
For five draws the source describes a 3^5=243-case full colour tree. This counts candidate colour strings, including impossible strings beyond the available colour supplies; it is not 243 equally likely feasible outcomes. The source therefore uses order counts or combinations instead. Probabilities must now update after each draw.
(ii)(a) Method 1: count the orders of WWNNN
Write N for non-white. The specified order WWNNN has probability . There are positions for the two white and three non-white results. Multiplying gives .
(ii)(b) Method 1: subtract zero and one white
The no-white probability is . One specified WNNNN order has probability , with orders. Subtract the first probability and five times the second from 1. Thus . This implements the Teacher complement annotation.
(ii)(c) Method 1: split the favourable intersection
Two red and at least two white among five balls means RRWWG or RRWWW. One RRWWG order has probability and orders. One RRWWW order has probability and orders. The divisors correct the two repeated red results and either two or three repeated white results.
(ii)(c) Divide the intersection probability by the condition
Add 30 times the RRWWG probability and 10 times the RRWWW probability to obtain . Divide by 113/126 from (b): .
(ii) Method 2: label the ten physical balls
Use W1,W2,W3,W4,W5,R1,R2,R3,G1,G2 as physical identities, distinct from draw-index events. There are equally likely unordered five-ball selections.
(ii)(a) Method 2: select white and non-white balls
Choose 2 of the 5 white and 3 of the 5 non-white balls: . The probability is 100/252=25/63. Both selection factors and their roles are retained.
(ii)(b) Method 2: remove the two excluded counts
Zero white contributes selection of all five non-white balls. Exactly one white contributes : choose 1 white from 5 and 4 non-white from 5. Therefore , retaining the Teacher-completed counts.
(ii)(c) Method 2: count both intersection cases
RRWWG contributes : choose 2 red from 3,2 white from 5,1 green from 2. RRWWW contributes : choose 2 red from 3 and 3 white from 5. The conditional probability is . Equivalently 90 favourable selections lie among 226 eligible selections.
Compare your sketch
Three colour draws with replacement
Expand a first-draw branch to read its nine complete paths. All 27 ordered outcomes are retained.
Start · probability 1
Open a branch to follow its outcomes. Outcome percentages are for complete paths. Open an outcome to see its calculation.
W₁ · White0.5 · 9 outcomes
W₁ · White
W₂ · White0.5 · 3 outcomes
W₁ · White → W₂ · White
W₃ · WhitePath 12.5%
W₁ · White → W₂ · White → W₃ · White- Branch weights
- 0.5 × 0.5 × 0.5
- Complete path probability
- 1/8= 0.125 · 12.5%
R₃ · RedPath 7.5%
W₁ · White → W₂ · White → R₃ · Red- Branch weights
- 0.5 × 0.5 × 0.3
- Complete path probability
- 3/40= 0.075 · 7.5%
G₃ · GreenPath 5%
W₁ · White → W₂ · White → G₃ · Green- Branch weights
- 0.5 × 0.5 × 0.2
- Complete path probability
- 1/20= 0.05 · 5%
R₂ · Red0.3 · 3 outcomes
W₁ · White → R₂ · Red
W₃ · WhitePath 7.5%
W₁ · White → R₂ · Red → W₃ · White- Branch weights
- 0.5 × 0.3 × 0.5
- Complete path probability
- 3/40= 0.075 · 7.5%
R₃ · RedPath 4.5%
W₁ · White → R₂ · Red → R₃ · Red- Branch weights
- 0.5 × 0.3 × 0.3
- Complete path probability
- 9/200= 0.045 · 4.5%
G₃ · GreenPath 3% · All different
W₁ · White → R₂ · Red → G₃ · Green- Branch weights
- 0.5 × 0.3 × 0.2
- Complete path probability
- 3/100= 0.03 · 3%
G₂ · Green0.2 · 3 outcomes
W₁ · White → G₂ · Green
W₃ · WhitePath 5%
W₁ · White → G₂ · Green → W₃ · White- Branch weights
- 0.5 × 0.2 × 0.5
- Complete path probability
- 1/20= 0.05 · 5%
R₃ · RedPath 3% · All different
W₁ · White → G₂ · Green → R₃ · Red- Branch weights
- 0.5 × 0.2 × 0.3
- Complete path probability
- 3/100= 0.03 · 3%
G₃ · GreenPath 2%
W₁ · White → G₂ · Green → G₃ · Green- Branch weights
- 0.5 × 0.2 × 0.2
- Complete path probability
- 1/50= 0.02 · 2%
R₁ · Red0.3 · 9 outcomes
R₁ · Red
W₂ · White0.5 · 3 outcomes
R₁ · Red → W₂ · White
W₃ · WhitePath 7.5%
R₁ · Red → W₂ · White → W₃ · White- Branch weights
- 0.3 × 0.5 × 0.5
- Complete path probability
- 3/40= 0.075 · 7.5%
R₃ · RedPath 4.5%
R₁ · Red → W₂ · White → R₃ · Red- Branch weights
- 0.3 × 0.5 × 0.3
- Complete path probability
- 9/200= 0.045 · 4.5%
G₃ · GreenPath 3% · All different
R₁ · Red → W₂ · White → G₃ · Green- Branch weights
- 0.3 × 0.5 × 0.2
- Complete path probability
- 3/100= 0.03 · 3%
R₂ · Red0.3 · 3 outcomes
R₁ · Red → R₂ · Red
W₃ · WhitePath 4.5%
R₁ · Red → R₂ · Red → W₃ · White- Branch weights
- 0.3 × 0.3 × 0.5
- Complete path probability
- 9/200= 0.045 · 4.5%
R₃ · RedPath 2.7%
R₁ · Red → R₂ · Red → R₃ · Red- Branch weights
- 0.3 × 0.3 × 0.3
- Complete path probability
- 27/1000= 0.027 · 2.7%
G₃ · GreenPath 1.8%
R₁ · Red → R₂ · Red → G₃ · Green- Branch weights
- 0.3 × 0.3 × 0.2
- Complete path probability
- 9/500= 0.018 · 1.8%
G₂ · Green0.2 · 3 outcomes
R₁ · Red → G₂ · Green
W₃ · WhitePath 3% · All different
R₁ · Red → G₂ · Green → W₃ · White- Branch weights
- 0.3 × 0.2 × 0.5
- Complete path probability
- 3/100= 0.03 · 3%
R₃ · RedPath 1.8%
R₁ · Red → G₂ · Green → R₃ · Red- Branch weights
- 0.3 × 0.2 × 0.3
- Complete path probability
- 9/500= 0.018 · 1.8%
G₃ · GreenPath 1.2%
R₁ · Red → G₂ · Green → G₃ · Green- Branch weights
- 0.3 × 0.2 × 0.2
- Complete path probability
- 3/250= 0.012 · 1.2%
G₁ · Green0.2 · 9 outcomes
G₁ · Green
W₂ · White0.5 · 3 outcomes
G₁ · Green → W₂ · White
W₃ · WhitePath 5%
G₁ · Green → W₂ · White → W₃ · White- Branch weights
- 0.2 × 0.5 × 0.5
- Complete path probability
- 1/20= 0.05 · 5%
R₃ · RedPath 3% · All different
G₁ · Green → W₂ · White → R₃ · Red- Branch weights
- 0.2 × 0.5 × 0.3
- Complete path probability
- 3/100= 0.03 · 3%
G₃ · GreenPath 2%
G₁ · Green → W₂ · White → G₃ · Green- Branch weights
- 0.2 × 0.5 × 0.2
- Complete path probability
- 1/50= 0.02 · 2%
R₂ · Red0.3 · 3 outcomes
G₁ · Green → R₂ · Red
W₃ · WhitePath 3% · All different
G₁ · Green → R₂ · Red → W₃ · White- Branch weights
- 0.2 × 0.3 × 0.5
- Complete path probability
- 3/100= 0.03 · 3%
R₃ · RedPath 1.8%
G₁ · Green → R₂ · Red → R₃ · Red- Branch weights
- 0.2 × 0.3 × 0.3
- Complete path probability
- 9/500= 0.018 · 1.8%
G₃ · GreenPath 1.2%
G₁ · Green → R₂ · Red → G₃ · Green- Branch weights
- 0.2 × 0.3 × 0.2
- Complete path probability
- 3/250= 0.012 · 1.2%
G₂ · Green0.2 · 3 outcomes
G₁ · Green → G₂ · Green
W₃ · WhitePath 2%
G₁ · Green → G₂ · Green → W₃ · White- Branch weights
- 0.2 × 0.2 × 0.5
- Complete path probability
- 1/50= 0.02 · 2%
R₃ · RedPath 1.2%
G₁ · Green → G₂ · Green → R₃ · Red- Branch weights
- 0.2 × 0.2 × 0.3
- Complete path probability
- 3/250= 0.012 · 1.2%
G₃ · GreenPath 0.8%
G₁ · Green → G₂ · Green → G₃ · Green- Branch weights
- 0.2 × 0.2 × 0.2
- Complete path probability
- 1/125= 0.008 · 0.8%
Compare outcome probabilities
| Outcome | Probability |
|---|---|
| W₁ · White → W₂ · White → W₃ · White | 1/8= 0.125 · 12.5% |
| W₁ · White → W₂ · White → R₃ · Red | 3/40= 0.075 · 7.5% |
| W₁ · White → W₂ · White → G₃ · Green | 1/20= 0.05 · 5% |
| W₁ · White → R₂ · Red → W₃ · White | 3/40= 0.075 · 7.5% |
| W₁ · White → R₂ · Red → R₃ · Red | 9/200= 0.045 · 4.5% |
| W₁ · White → R₂ · Red → G₃ · Green | 3/100= 0.03 · 3% |
| W₁ · White → G₂ · Green → W₃ · White | 1/20= 0.05 · 5% |
| W₁ · White → G₂ · Green → R₃ · Red | 3/100= 0.03 · 3% |
| W₁ · White → G₂ · Green → G₃ · Green | 1/50= 0.02 · 2% |
| R₁ · Red → W₂ · White → W₃ · White | 3/40= 0.075 · 7.5% |
| R₁ · Red → W₂ · White → R₃ · Red | 9/200= 0.045 · 4.5% |
| R₁ · Red → W₂ · White → G₃ · Green | 3/100= 0.03 · 3% |
| R₁ · Red → R₂ · Red → W₃ · White | 9/200= 0.045 · 4.5% |
| R₁ · Red → R₂ · Red → R₃ · Red | 27/1000= 0.027 · 2.7% |
| R₁ · Red → R₂ · Red → G₃ · Green | 9/500= 0.018 · 1.8% |
| R₁ · Red → G₂ · Green → W₃ · White | 3/100= 0.03 · 3% |
| R₁ · Red → G₂ · Green → R₃ · Red | 9/500= 0.018 · 1.8% |
| R₁ · Red → G₂ · Green → G₃ · Green | 3/250= 0.012 · 1.2% |
| G₁ · Green → W₂ · White → W₃ · White | 1/20= 0.05 · 5% |
| G₁ · Green → W₂ · White → R₃ · Red | 3/100= 0.03 · 3% |
| G₁ · Green → W₂ · White → G₃ · Green | 1/50= 0.02 · 2% |
| G₁ · Green → R₂ · Red → W₃ · White | 3/100= 0.03 · 3% |
| G₁ · Green → R₂ · Red → R₃ · Red | 9/500= 0.018 · 1.8% |
| G₁ · Green → R₂ · Red → G₃ · Green | 3/250= 0.012 · 1.2% |
| G₁ · Green → G₂ · Green → W₃ · White | 1/50= 0.02 · 2% |
| G₁ · Green → G₂ · Green → R₃ · Red | 3/250= 0.012 · 1.2% |
| G₁ · Green → G₂ · Green → G₃ · Green | 1/125= 0.008 · 0.8% |
| All 27 outcomes | 1= 1 · 100% |
Tree assumptions and source notes
W: white, R: red, G: green. Every split uses 0.5, 0.3 and 0.2 because each ball is replaced.
Draw indices 1, 2 and 3 identify events, not individual balls.
The six all-different paths are WRG, WGR, RWG, RGW, GWR and GRW. They are labeled All different in the tree; each has probability 0.03.
This diagram is for the with-replacement experiment in part (i), not the five-ball selection without replacement in part (ii).
Open original probability tree (new tab)Common mistakes
Part (i) uses replacement; part (ii) does not. Keep order-count factors with sequential probabilities and combination counts with the common equally likely selection space. The original symbolic-index slip is qualified rather than propagated.