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.....
We are told that every bomb hits the target with probability , and each bomb acts independently of the others. Let us drop bombs and define a random variable that counts the number of hits among these bombs. Because each bomb can be thought of as a Bernoulli trial (Hit = success, Miss = failure), follows the binomial distribution with parameters and . The probability mass function for a binomially distributed variable is stated by the formula
The target is completely destroyed if we obtain at least two hits, i.e. if . We therefore want
Instead of summing many terms to find directly, it is easier to use the complement rule. We have the basic identity
So our requirement translates into
Rearranging, this is equivalent to
Now we calculate the two individual probabilities using the binomial formula.
First, for zero hits:
Next, for exactly one hit:
Adding these two probabilities gives
Our inequality therefore becomes
Because , we can rewrite the left side as
so the inequality we need to satisfy is
To find the minimum integer meeting this condition, we test successive values of starting from small integers and stop as soon as the inequality holds.
• For , This is slightly larger than , so ten bombs are not enough.
• For , Now the inequality is satisfied and we have reached the required confidence level.
Because fails while succeeds, the smallest possible number of bombs that achieves the desired chance of completely destroying the target is .
So, the answer is .
Tagged Binomial distribution. Machine-assigned, so read it as a strong shortlist rather than a verdict.