RankRizz
JEE MAIN 2020 · 05 SEP S2+4MEDIUMTRANSCRIBED

JEE Main 2020 Mathematics question — Binomial distribution

In a bombing attack, there is 50% chance that a bomb will hit the target. At least two independent hits are required to destroy the target completely. Then the minimum number of bombs, that must be dropped to ensure that there is at least 99% chance of completely destroying the target, is.....

SOLUTION

We are told that every bomb hits the target with probability p=0.5p = 0.5, and each bomb acts independently of the others. Let us drop nn bombs and define a random variable XX that counts the number of hits among these nn bombs. Because each bomb can be thought of as a Bernoulli trial (Hit = success, Miss = failure), XX follows the binomial distribution with parameters nn and pp. The probability mass function for a binomially distributed variable is stated by the formula

Pr⁡(X=k)=(nk) p k (1−p) n−k,k=0,1,2,…,n.\Pr(X = k) = \binom{n}{k}\,p^{\,k}\,(1-p)^{\,n-k}, \qquad k = 0,1,2,\dots ,n.

The target is completely destroyed if we obtain at least two hits, i.e. if X≥2X \ge 2. We therefore want

Pr⁡(X≥2)≥0.99.\Pr(X \ge 2) \ge 0.99.

Instead of summing many terms to find Pr⁡(X≥2)\Pr(X \ge 2) directly, it is easier to use the complement rule. We have the basic identity

Pr⁡(X≥2)=1−Pr⁡(X≤1)=1−[Pr⁡(X=0)+Pr⁡(X=1)].\Pr(X \ge 2) = 1 - \Pr(X \le 1) = 1 - \bigl[\Pr(X = 0) + \Pr(X = 1)\bigr].

So our requirement translates into

1−[Pr⁡(X=0)+Pr⁡(X=1)]  ≥  0.99.1 - \bigl[\Pr(X = 0) + \Pr(X = 1)\bigr] \;\ge\; 0.99.

Rearranging, this is equivalent to

Pr⁡(X=0)+Pr⁡(X=1)  ≤  0.01.\Pr(X = 0) + \Pr(X = 1) \;\le\; 0.01.

Now we calculate the two individual probabilities using the binomial formula.

First, for zero hits:

Pr⁡(X=0)=(n0) p 0 (1−p) n=1×1×(1−0.5) n=0.5 n.\Pr(X = 0) = \binom{n}{0}\,p^{\,0}\,(1-p)^{\,n} = 1 \times 1 \times (1-0.5)^{\,n} = 0.5^{\,n}.

Next, for exactly one hit:

Pr⁡(X=1)=(n1) p 1 (1−p) n−1=n×0.5×0.5 n−1=n×0.5 n.\Pr(X = 1) = \binom{n}{1}\,p^{\,1}\,(1-p)^{\,n-1} = n \times 0.5 \times 0.5^{\,n-1} = n \times 0.5^{\,n}.

Adding these two probabilities gives

Pr⁡(X=0)+Pr⁡(X=1)=0.5 n+n×0.5 n=(1+n) 0.5 n.\Pr(X = 0) + \Pr(X = 1) = 0.5^{\,n} + n \times 0.5^{\,n} = (1+n)\,0.5^{\,n}.

Our inequality Pr⁡(X=0)+Pr⁡(X=1)≤0.01\Pr(X = 0) + \Pr(X = 1) \le 0.01 therefore becomes

(1+n) 0.5 n  ≤  0.01.(1+n)\,0.5^{\,n} \;\le\; 0.01.

Because 0.5 n=12 n0.5^{\,n} = \dfrac{1}{2^{\,n}}, we can rewrite the left side as

(1+n) 12 n=1+n2 n,(1+n)\,\dfrac{1}{2^{\,n}} = \dfrac{1+n}{2^{\,n}},

so the inequality we need to satisfy is

1+n2 n  ≤  0.01.\dfrac{1+n}{2^{\,n}} \;\le\; 0.01.

To find the minimum integer nn meeting this condition, we test successive values of nn starting from small integers and stop as soon as the inequality holds.

• For n=10n = 10, 1+102 10=111024≈0.010742  >  0.01.\dfrac{1+10}{2^{\,10}} = \dfrac{11}{1024} \approx 0.010742 \;>\; 0.01. This is slightly larger than 0.010.01, so ten bombs are not enough.

• For n=11n = 11, 1+112 11=122048≈0.005859  <  0.01.\dfrac{1+11}{2^{\,11}} = \dfrac{12}{2048} \approx 0.005859 \;<\; 0.01. Now the inequality is satisfied and we have reached the required confidence level.

Because n=10n = 10 fails while n=11n = 11 succeeds, the smallest possible number of bombs that achieves the desired 99%99\% chance of completely destroying the target is n=11n = 11.

So, the answer is 1111.

Tagged Binomial distribution. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicBinomial distribution
TypeNumerical answer