A fair coin is tossed repeatedly. Tossing stops when the first head appears or when three tosses have been made, whichever happens first.
Draw a tree and list all possible terminal sequences.
Find the probability of each terminal sequence.
Find the probability that exactly three tosses are needed.
Find the probability that a head appears before the experiment stops.
Explain why counting favourable terminal sequences over total terminal sequences can give an incorrect answer.
Need help? Join our JC Math tuition classes.
Learn more