Let n be the total number of missiles fired at the target.
Let the random variable X denote the number of successful hits on the target. Since each trial is independent, X follows a Binomial distribution:
X∼Binomial(n,p)
where p=0.75=43 is the probability of a successful hit, and q=1−p=0.25=41 is the probability of a miss.
To completely destroy the target, at least 3 successful hits are required. We are given that the probability of completely destroying the target must be at least 0.95:
P(X≥3)≥0.95
Using the complement rule, this can be written as:
1−P(X<3)≥0.95⟹P(X<3)≤0.05
The probability P(X<3) is the sum of the probabilities of getting 0, 1, or 2 successful hits:
P(X<3)=P(X=0)+P(X=1)+P(X=2)
Using the binomial probability formula P(X=k)=(kn)pkqn−k:
P(X=0)=(0n)(43)0(41)n=4n1
P(X=1)=(1n)(43)1(41)n−1=4n3n
P(X=2)=(2n)(43)2(41)n−2=2⋅4n9n(n−1)
Summing these terms gives:
P(X<3)=4n1[1+3n+29n(n−1)]
We need to find the smallest integer n≥3 such that:
4n1[1+3n+29n(n−1)]≤0.05=201
Let's test integer values of n:
-
For n=4:
P(X<3)=441[1+3(4)+29×4×3]=2561+12+54=25667≈0.2617>0.05
-
For n=5:
P(X<3)=451[1+3(5)+29×5×4]=10241+15+90=1024106≈0.1035>0.05
-
For n=6:
P(X<3)=461[1+3(6)+29×6×5]=40961+18+135=4096154=204877≈0.0376≤0.05
Since 0.0376≤0.05, the condition P(X≥3)≥0.95 is satisfied for n=6.
Thus, the minimum number of missiles that must be fired is 6.