Let , , be the events that the spinner comes to rest over the sections labelled , , respectively, and let be the event that the player wins the game.
Since the spinner has equally likely sections, labelled , labelled and labelled ,
Since the red die has faces with , the blue die has faces with , and the yellow die has face with , each out of faces,
Part (i)
2 marksBy the law of total probability, since , , partition the sample space:
.
Part (ii)
1 markUsing Bayes’ theorem,
.
Part (iii)
2 marksApproach
“A different colour die each time” over the games means the spinner shows , , in some order, one each, over the games — there are such orders, and by independence of the games each order has the same probability. So rather than listing cases, we find the probability of one representative order and multiply by .
Let , , , the probability that a single game is won with the red, blue, yellow die respectively.
Since the games are independent, and there are ways to assign the colours , , to the games, all winning games:
| To check your answer: , sensibly small since it requires winning all games with different, specific colours. ✓ |
the required probability is .