Minimum number of times a fair coin must be tossed so that the probability of getting at least one head is more than 99% is:
Let us denote by the number of independent tosses of a fair coin we plan to make. Because the coin is fair, the probability of getting a head in a single toss is , and the probability of getting a tail is also .
We wish to find the smallest for which the probability of obtaining at least one head exceeds , that is, is greater than .
Instead of counting heads directly, it is easier to count the complementary event: “no head at all”, which means all tosses show tails. The rule of complementary probability states
For independent tosses, getting a tail every time has probability
because we multiply with itself times.
Hence, using the complementary rule,
The requirement that this probability be more than translates to the inequality
Subtracting from both sides and changing the sign gives
which simplifies to
To solve for , we take logarithms. Stating the logarithm rule first: for any positive number and any base, Applying this rule, we write
Using the logarithm rule mentioned above, we obtain
Now, is negative (since ). Dividing by a negative number reverses the inequality sign. Hence,
We evaluate the logs in base 10 for convenience:
Substituting these numerical values, we have
The inequality demands be strictly greater than , so the smallest integer satisfying it is
Therefore, we must toss the fair coin at least seven times to make the probability of getting at least one head exceed .
Hence, the correct answer is Option D.
Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.