The minimum number of times one has to toss a fair coin so that the probability of observing at least one head is at least 90% is:
We want the probability of getting at least one head to be at least 90 %. A fair coin has probability of showing a head and the same probability of showing a tail on every toss.
It is often easier to work with the complementary event. The complementary event to “at least one head in tosses” is “no head at all in tosses”, i.e. all the tosses show tails.
For a single toss, the probability of getting a tail is . Because successive tosses are independent, the probability that all tosses are tails is
The required probability of getting at least one head is therefore
We are told this probability must be at least 90 %, that is . Translating the verbal condition into an inequality, we write
Rearranging, we subtract 1 from both sides and then multiply by −1; remembering that multiplying an inequality by a negative reverses the inequality sign, we get
To solve for we take natural logarithms (any logarithm base could be used, but using one base consistently is essential). First we state the logarithm rule we are about to use:
If and , then implies
Applying this rule to our inequality
we obtain
Because is negative, dividing by it reverses the inequality once again:
Now we evaluate the logarithms numerically:
Substituting these values,
The number of tosses must be an integer, and it must be at least the value just obtained, so we round up to the next whole number:
We can verify quickly: with 4 tosses the probability of at least one head is
which indeed exceeds 0.90. For 3 tosses the probability is only which is insufficient.
Hence, the correct answer is Option B.
Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.