RankRizz
JEE MAIN 2019 · 08 APR S2+4 / −1EASYTRANSCRIBED

JEE Main 2019 Mathematics question — Classical probability and sample spaces

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:

SOLUTION

We want the probability of getting at least one head to be at least 90 %. A fair coin has probability 12\tfrac12 of showing a head and the same probability 12\tfrac12 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 nn tosses” is “no head at all in nn tosses”, i.e. all the nn tosses show tails.

For a single toss, the probability of getting a tail is 12\tfrac12. Because successive tosses are independent, the probability that all nn tosses are tails is

(12)n.\left(\tfrac12\right)^n.

The required probability of getting at least one head is therefore

1−(12)n.1-\left(\tfrac12\right)^n.

We are told this probability must be at least 90 %, that is 0.900.90. Translating the verbal condition into an inequality, we write

1−(12)n  ≥  0.9.1-\left(\tfrac12\right)^n \;\ge\; 0.9.

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

(12)n  ≤  0.1.\left(\tfrac12\right)^n \;\le\; 0.1.

To solve for nn 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 a>0a>0 and 0<b<10<b<1, then ba=cb^a=c implies a=ln⁡cln⁡b.a=\dfrac{\ln c}{\ln b}.

Applying this rule to our inequality

(12)n≤0.1,\left(\tfrac12\right)^n \le 0.1,

we obtain

n ln⁡ ⁣(12)  ≤  ln⁡(0.1).n \,\ln\!\left(\tfrac12\right) \;\le\; \ln(0.1).

Because ln⁡ ⁣(12)\ln\!\left(\tfrac12\right) is negative, dividing by it reverses the inequality once again:

n  ≥  ln⁡(0.1)ln⁡ ⁣(12).n \;\ge\; \dfrac{\ln(0.1)}{\ln\!\left(\tfrac12\right)}.

Now we evaluate the logarithms numerically:

ln⁡(0.1)=−2.302585…,\ln(0.1) = -2.302585\ldots,

ln⁡ ⁣(12)=−0.693147….\ln\!\left(\tfrac12\right) = -0.693147\ldots.

Substituting these values, n≥−2.302585…−0.693147…=3.321928…n \ge \dfrac{-2.302585\ldots}{-0.693147\ldots} = 3.321928\ldots

The number of tosses nn must be an integer, and it must be at least the value just obtained, so we round up to the next whole number:

n=4.n = 4.

We can verify quickly: with 4 tosses the probability of at least one head is

1−(12)4=1−116=1516=0.9375,1-\left(\tfrac12\right)^4 =1-\dfrac1{16} =\dfrac{15}{16} =0.9375, which indeed exceeds 0.90. For 3 tosses the probability is only 1−18=0.875,1-\tfrac18=0.875, 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.

TopicClassical probability and sample spaces
TypeMultiple choice