Question
A factory produces 1000 items per day. The probability that any one item is defective is 0.005. Use the binomial theorem (or its approximation) to find the probability that exactly 3 items are defective on a given day.
This connects binomial expansion with binomial probability — a real-world JEE Main pattern.
Solution — Step by Step
n=1000, p=0.005, k=3.
P(X=3)=(31000)p3(1−p)997.
(31000)=(1000⋅999⋅998)/6≈1.66×108.
p3=(0.005)3=1.25×10−7.
(0.995)997: use ln(0.995)≈−0.005012, so 997×(−0.005012)≈−4.997, giving (0.995)997≈e−5≈0.0067.
P(X=3)≈1.66×108×1.25×10−7×0.0067≈0.139.
So about 13.9%.
Final answer: P(X=3)≈0.14.
Why This Works
The binomial PMF (kn)pk(1−p)n−k counts how many ways to pick k defectives out of n, weighted by the probability of any one such configuration. The binomial theorem ensures these probabilities sum to 1 (by setting x=p and y=1−p in (x+y)n).
For large n and small p with np moderate, the binomial converges to the Poisson distribution. Here np=5, so P(X=3)≈e−553/6≈0.140 — matching our exact answer.
Alternative Method
Poisson approximation. With λ=np=5:
P(X=3)≈3!e−5⋅53=60.0067×125≈0.140
Faster than the binomial, accurate to within a few percent for n≥20, p≤0.05.
When n is large and p small (rare event), use the Poisson approximation. JEE often slips this in disguised as a binomial — the Poisson saves time.
Common Mistake
Using (1−p)n instead of (1−p)n−k. The exponent is the number of “successes” we did NOT have, which is n−k=997, not 1000.