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

JEE Main 2019 Mathematics question — Classical probability and sample spaces

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:

SOLUTION

Let us denote by nn 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 12\dfrac12, and the probability of getting a tail is also 12\dfrac12.

We wish to find the smallest nn for which the probability of obtaining at least one head exceeds 99%99\%, that is, is greater than 0.990.99.

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

P(at least one head)  =  1  −  P(no head).P(\text{at least one head}) \;=\; 1 \;-\; P(\text{no head}).

For nn independent tosses, getting a tail every time has probability

P(no head)  =  (12)n,P(\text{no head}) \;=\; \Bigl(\dfrac12\Bigr)^n,

because we multiply 12\dfrac12 with itself nn times.

Hence, using the complementary rule,

P(at least one head)  =  1  −  (12)n.P(\text{at least one head}) \;=\; 1 \;-\; \Bigl(\dfrac12\Bigr)^n.

The requirement that this probability be more than 99%99\% translates to the inequality

1  −  (12)n  >  0.99.1 \;-\; \Bigl(\dfrac12\Bigr)^n \;>\; 0.99. Subtracting 11 from both sides and changing the sign gives

−(12)n  >  −0.01,-\Bigl(\dfrac12\Bigr)^n \;>\; -0.01,

which simplifies to

(12)n  <  0.01.\Bigl(\dfrac12\Bigr)^n \;<\; 0.01.

To solve for nn, we take logarithms. Stating the logarithm rule first: for any positive number aa and any base, log⁡(an)=nlog⁡a.\log(a^n)=n\log a. Applying this rule, we write

log⁡ ⁣((12)n)  <  log⁡(0.01).\log\!\Bigl(\Bigl(\dfrac12\Bigr)^n\Bigr) \;<\; \log(0.01).

Using the logarithm rule mentioned above, we obtain

n log⁡ ⁣(12)  <  log⁡(0.01).n\,\log\!\Bigl(\dfrac12\Bigr) \;<\; \log(0.01).

Now, log⁡ ⁣(12)\log\!\Bigl(\dfrac12\Bigr) is negative (since 12<1\dfrac12<1). Dividing by a negative number reverses the inequality sign. Hence,

n  >  log⁡(0.01)log⁡ ⁣(12).n \;>\; \dfrac{\log(0.01)}{\log\!\bigl(\dfrac12\bigr)}.

We evaluate the logs in base 10 for convenience:

log⁡10(0.01)  =  −2,\log_{10}(0.01) \;=\; -2,

log⁡10 ⁣(12)  =  log⁡10(1)−log⁡10(2)  =  0−0.3010  =  −0.3010.\log_{10}\!\Bigl(\dfrac12\Bigr) \;=\; \log_{10}(1) - \log_{10}(2) \;=\; 0 - 0.3010 \;=\; -0.3010.

Substituting these numerical values, we have

n  >  −2−0.3010  =  20.3010  ≈  6.644.n \;>\; \dfrac{-2}{-0.3010} \;=\; \dfrac{2}{0.3010} \;\approx\; 6.644.

The inequality demands nn be strictly greater than 6.6446.644, so the smallest integer satisfying it is

n=7.n = 7.

Therefore, we must toss the fair coin at least seven times to make the probability of getting at least one head exceed 99%99\%.

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.

TopicClassical probability and sample spaces
TypeMultiple choice