A fair coin is tossed times such that the probability of getting at least one head is at least 0.9. Then the minimum value of is _________.
We begin with a single throw of a fair coin. In one throw, the probability of getting a head is and the probability of getting a tail is also because the coin is fair.
When the coin is tossed times, all the throws are independent. The easiest way to find the probability of “at least one head” is to use the complementary event “no head at all,” that is, getting tails in every single throw.
For one throw, the probability of a tail is . Hence, when the coin is tossed times, the probability of getting a tail on every single throw (that is, zero heads) is This uses the multiplication rule for independent events.
Therefore, the probability of getting at least one head in throws is
The question tells us that this probability must be at least , so we set up the inequality:
Rearranging the terms, we isolate the power of :
To solve for , we take natural logarithms on both sides. (Any logarithm base would work; natural logarithm is convenient.) We state first that for any positive numbers and , if then , and dividing by a negative number reverses the inequality sign.
Applying , we get Using the power rule , this becomes
Because , dividing both sides by this negative number reverses the inequality:
We now evaluate the right-hand side numerically: Therefore
Since must be an integer (you cannot toss the coin a fractional number of times), we take the smallest integer not less than , which is .
We may confirm quickly: for , the probability of at least one head is , which is less than ; for , the probability is , which indeed satisfies the requirement.
So, the answer is .
Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.