RankRizz
JEE MAIN 2021 · 25 JUL S2+4EASYTRANSCRIBED

JEE Main 2021 Mathematics question — Classical probability and sample spaces

A fair coin is tossed n−n- times such that the probability of getting at least one head is at least 0.9. Then the minimum value of nn is _________.

SOLUTION

We begin with a single throw of a fair coin. In one throw, the probability of getting a head is 12\dfrac12 and the probability of getting a tail is also 12\dfrac12 because the coin is fair.

When the coin is tossed nn 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 12\dfrac12. Hence, when the coin is tossed nn times, the probability of getting a tail on every single throw (that is, zero heads) is (12)n.\left(\dfrac12\right)^n. This uses the multiplication rule for independent events.

Therefore, the probability of getting at least one head in nn throws is 1−(12)n.1-\left(\dfrac12\right)^n.

The question tells us that this probability must be at least 0.90.9, so we set up the inequality: 1−(12)n≥0.9.1-\left(\dfrac12\right)^n \ge 0.9.

Rearranging the terms, we isolate the power of 12\dfrac12: (12)n≤1−0.9=0.1.\left(\dfrac12\right)^n \le 1-0.9 = 0.1.

To solve for nn, we take natural logarithms on both sides. (Any logarithm base would work; natural logarithm is convenient.) We state first that for any positive numbers aa and bb, if a<1a<1 then ln⁡a<0\ln a<0, and dividing by a negative number reverses the inequality sign.

Applying ln⁡\ln, we get ln⁡ ⁣((12)n)≤ln⁡(0.1).\ln\!\left(\left(\dfrac12\right)^n\right) \le \ln(0.1). Using the power rule ln⁡(ak)=kln⁡a\ln(a^k)=k\ln a, this becomes n ln⁡ ⁣(12)≤ln⁡(0.1).n\,\ln\!\left(\dfrac12\right) \le \ln(0.1).

Because ln⁡ ⁣(12)<0\ln\!\left(\dfrac12\right)<0, dividing both sides by this negative number reverses the inequality: n≥ln⁡(0.1)ln⁡ ⁣(12).n \ge \dfrac{\ln(0.1)}{\ln\!\left(\dfrac12\right)}.

We now evaluate the right-hand side numerically: ln⁡(0.1)≈−2.302585,ln⁡ ⁣(12)≈−0.693147.\ln(0.1) \approx -2.302585, \qquad \ln\!\left(\dfrac12\right) \approx -0.693147. Therefore n≥−2.302585−0.693147≈3.321928.n \ge \dfrac{-2.302585}{-0.693147} \approx 3.321928.

Since nn must be an integer (you cannot toss the coin a fractional number of times), we take the smallest integer not less than 3.3219283.321928, which is 44.

We may confirm quickly: for n=3n=3, the probability of at least one head is 1−(12)3=1−18=0.8751-\left(\dfrac12\right)^3 = 1-\dfrac18 = 0.875, which is less than 0.90.9; for n=4n=4, the probability is 1−(12)4=1−116=0.93751-\left(\dfrac12\right)^4 = 1-\dfrac{1}{16} = 0.9375, which indeed satisfies the requirement.

So, the answer is 44.

Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicClassical probability and sample spaces
TypeNumerical answer