Intuition Why a whole page of examples?
The parent note gave you three formulas: the PMF ( k n ) p k ( 1 − p ) n − k , the mean n p , and the variance n p ( 1 − p ) . Formulas are useless until you can smell which one a word problem wants . This page walks through every kind of question a binomial can produce — exactly-k , at-least, at-most, a range, the degenerate edges where p = 0 or p = 1 , the "am I even allowed to use binomial?" trap, and the two big limits (Poisson and Normal). By the end no scenario should surprise you.
Definition The binomial PMF (self-contained statement)
So this page stands on its own, here is the formula every example below applies. If X ∼ Bin ( n , p ) counts the successes in n trials, then the probability of exactly k successes is
P ( X = k ) = ( k n ) p k ( 1 − p ) n − k , k = 0 , 1 , … , n ,
where ( k n ) = k ! ( n − k )! n ! counts how many orderings give k successes. The mean is E [ X ] = n p and the variance is Var ( X ) = n p ( 1 − p ) . Full derivations live in the parent note; here we drill on using them.
Definition The BINS conditions (recap from the parent note)
Before any example, we check the four conditions that make a count binomial. BINS is the memory hook:
B inary — each trial is a clean success/failure (a Bernoulli trial).
I ndependent — one trial's outcome never nudges another.
N umber — the number of trials n is fixed in advance.
S ame p — every trial has the identical success probability p .
If all four hold, X = number of successes is Bin ( n , p ) . If even one fails, we are in cell G.
Every binomial question is one of these cells. Each worked example below is tagged with the cell it hits.
Cell
What it asks
Tool
A. Exact
P ( X = k ) for one value of k
PMF once
B. At least one
P ( X ≥ 1 )
complement 1 − ( 1 − p ) n
C. At most / range
P ( X ≤ m ) or P ( a ≤ X ≤ b )
sum a few PMF terms
D. Summary stats
mean, variance, standard deviation, "typical range"
n p , n p ( 1 − p )
E. Extreme p
p = 0 or p = 1 (degenerate)
distribution collapses to a point
F. Extreme k
k = 0 or k = n (the tails)
( 0 n ) = ( n n ) = 1
G. Not binomial
dependent trials / changing p
recognise & switch model
H. Poisson limit
huge n , tiny p , n p moderate
λ = n p approximation
I. Normal limit
large n , middling p
N ( n p , n p ( 1 − p )) + continuity
Decision tree for routing a binomial word problem. The butter box at the top is the legality gate : check BINS first. A "no" (coral) drops you into cell G (not binomial). A "yes" (mint) leads to the middle question "what do you need?", which fans out to the four everyday leaves — A exact, B at-least-one, C range, D summary stats (all lavender). The bottom row holds the special situations: the degenerate edges E /F (butter) and the big-n limits H /I (mint). Use it as a literal flowchart: trace top-to-bottom for whichever example you are reading, and notice that the edges and limits are not new formulas — they are the same PMF/mean/variance evaluated at their boundaries.
Every worked example below names the exact cell it lands on, so you can watch the tree get exercised end to end.
Worked example Exactly 3 sixes in 6 rolls of a fair die
A fair die is rolled n = 6 times. "Success" = rolling a six, so p = 6 1 . Find P ( X = 3 ) .
Forecast: guess — is this more or less than 10% ? (Sixes are rare, so getting three of them feels unlikely.)
Check BINS. Six fixed rolls, each six/not-six, independent, same p = 6 1 . Binomial. Why this step? Never apply the PMF before confirming the four conditions (Binary, Independent, Number fixed, Same p ) — cell G exists precisely because people skip this.
Pick the PMF. We want one exact count k = 3 , so this is cell A: apply the PMF once. Why this step? Cell A asks for a single value of k , and the PMF ( k n ) p k ( 1 − p ) n − k is exactly the tool that returns the probability of one specific count — no summing needed.
P ( X = 3 ) = ( 3 6 ) ( 6 1 ) 3 ( 6 5 ) 3 .
Count the orderings. ( 3 6 ) = 3 ! 3 ! 6 ! = 20 . Why this step? Three sixes can sit in 20 different positions among the six rolls; each ordering has the same probability, so we multiply.
Multiply the pieces.
P ( X = 3 ) = 20 ⋅ 216 1 ⋅ 216 125 = 46656 2500 ≈ 0.0536.
Why this step? We combine the count of orderings (20 ) with the shared probability of one ordering, ( 6 1 ) 3 ( 6 5 ) 3 = 46656 125 , exactly as the PMF prescribes.
Verify: ≈ 5.4% — below 10% , matching the forecast. Units: a probability, dimensionless, and 0 ≤ 0.0536 ≤ 1 . ✓
The full shape of this distribution is the histogram in Figure 2, with the k = 3 bar highlighted.
PMF bars of Bin ( 6 , 6 1 ) . Each lavender bar's height is P ( X = k ) . Most mass sits at k = 0 , 1 (few sixes are typical), and the coral bar at k = 3 — our answer ≈ 0.054 — is already small. The bars keep shrinking toward k = 6 , whose height is a tiny ( 6 1 ) 6 . The picture is why the forecast "less than 10% " was safe: k = 3 lives well out in the thinning tail.
Worked example At least one bullseye
An archer hits the bullseye with probability p = 0.2 on each independent shot. She takes n = 10 shots. Find P ( at least one bullseye ) .
Forecast: with 10 tries at 20% each, does "at least one" feel closer to 50% or to 90% ?
Recognise cell B. "At least one" means X ≥ 1 , i.e. k = 1 , 2 , … , 10 — nine terms. Why this step? Summing nine PMF values is slow; the complement is one line (this is the 80/20 move from the parent note).
Flip to the complement.
P ( X ≥ 1 ) = 1 − P ( X = 0 ) .
Why this step? The only way to not get at least one is to get exactly zero — a single easy term.
Compute P ( X = 0 ) . ( 0 10 ) = 1 , so
P ( X = 0 ) = ( 0.8 ) 10 ≈ 0.1074.
Why this step? At k = 0 there is only one arrangement (all misses), so the coefficient is 1 and only the product of ten failure probabilities remains.
Subtract. P ( X ≥ 1 ) = 1 − 0.1074 = 0.8926 . Why this step? Total probability is 1 , so whatever is not "zero bullseyes" must be "at least one bullseye".
Verify: ≈ 0.893 , comfortably near 90% — matches the forecast. Sanity: as n grows, ( 0.8 ) n → 0 so this probability rises toward 1 , exactly as intuition demands. ✓
Worked example At most 2 defects
A production line yields defects with p = 0.05 . In a sample of n = 8 , find P ( X ≤ 2 ) .
Forecast: defects are rare, so "at most 2" should be very likely — above 95% ?
Recognise cell C. "At most 2" = k ∈ { 0 , 1 , 2 } — a short sum. Why this step? P ( X ≤ m ) is not a single PMF value; it is a cumulative probability, so we must add every allowed count. Here only three terms qualify, so direct addition is quicker than any complement.
Term k = 0 . ( 0 8 ) ( 0.95 ) 8 = ( 0.95 ) 8 ≈ 0.6634 . Why this step? One arrangement (all good), so the coefficient is 1 and every one of the 8 items must be non-defective.
Term k = 1 . ( 1 8 ) ( 0.05 ) ( 0.95 ) 7 = 8 ⋅ 0.05 ⋅ 0.6983 ≈ 0.2793 . Why this step? ( 1 8 ) = 8 — the single defect can be any of the 8 items, and each such arrangement carries one 0.05 and seven 0.95 factors.
Term k = 2 . ( 2 8 ) ( 0.05 ) 2 ( 0.95 ) 6 = 28 ⋅ 0.0025 ⋅ 0.7351 ≈ 0.0514 . Why this step? ( 2 8 ) = 28 counts the pairs of positions the two defects can occupy, each with two 0.05 and six 0.95 factors.
Add. 0.6634 + 0.2793 + 0.0514 ≈ 0.9941 . Why this step? The three counts k = 0 , 1 , 2 are mutually exclusive outcomes, so the probability of "at most 2" is their sum.
Verify: ≈ 0.994 — above 95% , matching the forecast. Cross-check: P ( X ≥ 3 ) = 1 − 0.9941 = 0.0059 , a small tail, exactly what "rare defects" predicts. ✓
Definition Standard deviation, before we use it
The variance Var ( X ) = n p ( 1 − p ) measures spread in squared units of the count. To get spread back in the same units as X (plain "number of successes"), take the square root. That square root is the standard deviation , written σ (Greek "sigma"):
σ = Var ( X ) = n p ( 1 − p ) .
So σ is just "how many successes we typically drift away from the mean". We abbreviate standard deviation as SD .
Worked example Typical range of correct answers
A student guesses on n = 40 four-option multiple-choice questions, so p = 0.25 . Give the mean, variance, standard deviation, and a "typical" range of correct answers.
Forecast: on 40 questions at 25%, roughly how many correct on average? And is 20 correct plausible by luck?
Mean (cell D). E [ X ] = n p = 40 ( 0.25 ) = 10 . Why this step? Linearity of expectation : each question contributes p correct on average, and there are 40 of them.
Variance. Var ( X ) = n p ( 1 − p ) = 40 ( 0.25 ) ( 0.75 ) = 7.5 . Why this step? Trials are independent, so variances add — each Bernoulli contributes p ( 1 − p ) .
Standard deviation. σ = 7.5 ≈ 2.739 , using the definition above.
Typical range. E [ X ] ± 2 σ = 10 ± 5.48 , i.e. roughly 5 to 15 correct. Why this step? Most mass of a bell-ish distribution lies within two standard deviations of the mean.
Verify: 20 correct is ( 20 − 10 ) /2.739 ≈ 3.65 standard deviations above the mean — extremely unlikely by pure guessing, so a score of 20 signals real knowledge. Units: "correct answers", a count. Mean 10 < n = 40 . ✓
The mean and the ± 2 σ band are drawn over the distribution in Figure 3.
PMF of Bin ( 40 , 0.25 ) with mean and spread marked. The lavender bars peak near k = 10 (the mean, dashed slate line). The mint band spans 10 ± 2 σ ≈ [ 4.5 , 15.5 ] and captures almost all the height. The coral marker at k = 20 sits far to the right of the band — visibly out in the tail — which is the geometric meaning of "3.65 standard deviations above the mean": scoring 20 by pure guessing is off the chart.
Definition The convention
0 0 = 1
One factor below is ( 0 ) 0 . In combinatorics we define 0 0 = 1 , not because 0 0 is a settled arithmetic value (as a limit it is genuinely indeterminate), but because 0 0 = 1 is the choice that makes the PMF, the Binomial Theorem , and "one empty product = 1 " all agree. Read every 0 0 on this page as this convention, i.e. "no failures to multiply in, so that piece is just 1 ".
Worked example When randomness disappears
A biased coin has p = 1 (always heads). It is flipped n = 7 times. Find the distribution of X = number of heads. Then repeat for p = 0 .
Forecast: if it always lands heads, how much uncertainty is left?
Plug p = 1 into the PMF. P ( X = k ) = ( k 7 ) ( 1 ) k ( 0 ) 7 − k . Why this step? We test the formula at its boundary to see it stay sane.
Zero kills every term except k = 7 . For k < 7 the factor ( 0 ) 7 − k = 0 ; only k = 7 gives ( 0 ) 0 = 1 (the convention above). So P ( X = 7 ) = 1 , all other probabilities 0 . Why this step? A factor of 0 wipes out any term, so the whole probability piles onto the one outcome with no failure factor.
Check the summary stats. E [ X ] = n p = 7 , Var = n p ( 1 − p ) = 7 ⋅ 1 ⋅ 0 = 0 . Why this step? Zero variance means no spread — the outcome is certain, matching a spike at 7 .
Mirror case p = 0 . Now every term with k > 0 carries ( 0 ) k = 0 ; only k = 0 survives, P ( X = 0 ) = 1 , and Var = n ⋅ 0 ⋅ 1 = 0 . Why this step? By the same zero-kills-terms logic with success and failure swapped, all mass lands on "no heads".
Verify: both variances are 0 — the "max at p = 0.5 , zero at the ends" rule from the parent note holds exactly. The distribution collapses to a single point, no randomness left, matching the forecast. ✓
Worked example The two tails of a coin experiment
Flip a fair coin n = 5 times (p = 0.5 ). Find P ( X = 0 ) and P ( X = 5 ) , and confirm they are equal.
Forecast: for a fair coin, should "all tails" and "all heads" be equally likely?
Bottom tail k = 0 . ( 0 5 ) = 1 , so P ( X = 0 ) = ( 0.5 ) 0 ( 0.5 ) 5 = ( 0.5 ) 5 = 32 1 ≈ 0.03125 . Why this step? k = 0 is the "all failures" corner — one arrangement, five failure factors.
Top tail k = 5 . ( 5 5 ) = 1 , so P ( X = 5 ) = ( 0.5 ) 5 = 32 1 ≈ 0.03125 . Why this step? k = n is the "all successes" corner — again one arrangement, five success factors.
Why equal here? Because p = 1 − p = 0.5 : swapping successes for failures leaves each term's value unchanged. Why this step? Symmetry only appears at p = 0.5 ; for biased coins the tails differ.
Verify: both equal 32 1 . If instead p = 0.3 : P ( X = 0 ) = 0. 7 5 ≈ 0.1681 but P ( X = 5 ) = 0. 3 5 ≈ 0.00243 — no longer equal, confirming symmetry is special to p = 0.5 . ✓
Worked example The without-replacement trap
A box has 10 balls: 4 red, 6 blue. You draw 3 balls without replacement . Find P ( exactly 2 red ) . Can you use binomial?
Forecast: does p (chance of red) stay the same on each draw?
Test BINS. After removing a red ball, only 3 reds remain out of 9 — so p changes from 10 4 to 9 3 . Why this step? The "Same p " and "Independent" conditions both fail; binomial is illegal here.
Switch to Hypergeometric distribution . Count favourable over total:
P ( 2 red ) = ( 3 10 ) ( 2 4 ) ( 1 6 ) = 120 6 ⋅ 6 = 120 36 = 0.3.
Why this step? Choose 2 of 4 reds and 1 of 6 blues, over all ways to choose 3 of 10 .
Compare with the wrong binomial answer. Naively with p = 0.4 : ( 2 3 ) ( 0.4 ) 2 ( 0.6 ) = 0.288 — close but wrong . Why this step? Seeing the two numbers side by side shows the size of the error you make by forcing binomial onto a dependent draw.
Verify: true answer 0.3 ; the binomial shortcut gives 0.288 , an error of 0.012 . Small n relative to population size is why they're near but not equal. ✓
Worked example Rare typos in a long document
A typist makes an error with probability p = 0.002 per word, over n = 1500 words (independent). Find P ( exactly 2 errors ) using the Poisson distribution approximation.
Forecast: big n , tiny p — how many errors on average, and how likely is exactly 2?
Recognise cell H. n = 1500 is huge, p = 0.002 is tiny, but λ = n p = 3 is moderate. Why this step? Summing binomial terms with n = 1500 is painful; the Poisson limit replaces it with one clean formula.
Set λ = n p = 1500 ⋅ 0.002 = 3 . This is the expected number of errors. Why this step? The Poisson approximation is governed entirely by its mean λ , which must match the binomial mean n p .
Apply the Poisson PMF P ( X = k ) = e − λ k ! λ k :
P ( X = 2 ) = e − 3 2 ! 3 2 = e − 3 ⋅ 2 9 ≈ 0.2240.
Why this step? As n → ∞ , p → 0 with n p = λ fixed, the binomial converges to Poisson, so we may read the answer off the simpler formula.
Verify: the exact binomial gives ( 2 1500 ) ( 0.002 ) 2 ( 0.998 ) 1498 ≈ 0.2242 — agreeing to three decimals, confirming the approximation. ✓
Worked example Polling with continuity correction
In a poll of n = 100 voters, each supports a measure with p = 0.5 . Find P ( X ≤ 45 ) using the Normal approximation to binomial .
Forecast: 45 is below the mean of 50 — should this be well under 50% ?
Check the rule of thumb. The continuity-corrected Normal is only trustworthy when both n p ≥ 10 and n ( 1 − p ) ≥ 10 . Here n p = 50 and n ( 1 − p ) = 50 , both comfortably above 10 . Why this step? Those conditions guarantee the distribution is tall and symmetric enough for a smooth bell to fit its bars; skipping the check is how people misuse the approximation on skewed, small-n cases.
Recognise cell I. n = 100 is large and p = 0.5 is central, so the distribution is close to a bell curve — summing 46 PMF terms by hand is absurd, and the Normal curve gives it in one lookup. Why this step? Choosing the Normal limit here is what turns a 46-term sum into a single standardised lookup.
Match mean and variance. μ = n p = 50 , σ = n p ( 1 − p ) = 25 = 5 . Why this step? The approximating bell must share the binomial's centre and spread, or it would sit over the wrong place.
Continuity correction. Discrete X ≤ 45 becomes continuous X ≤ 45.5 . Why this step? A whole bar of width 1 sits over each integer; include the half-bar up to 45.5 so the area matches.
Standardise using Z . Let Z be the standard normal random variable , Z ∼ N ( 0 , 1 ) — a bell curve centred at 0 with standard deviation 1 . We convert our count into a Z -value by subtracting the mean and dividing by σ :
z = 5 45.5 − 50 = − 0.9.
Why this step? Standardising lets us read any Normal probability off one universal Z -table instead of a fresh curve for every μ , σ .
Read the probability. From the standard-normal table, P ( Z ≤ − 0.9 ) ≈ 0.1841 . Why this step? Once we have a single z -value, the tail area to its left is the answer we wanted.
Verify: the exact binomial sum P ( X ≤ 45 ) ≈ 0.1841 too — the continuity-corrected Normal nails it. And 0.184 < 0.5 , matching the forecast that 45 sits below the mean. ✓
The half-bar shift and the bell overlay are shown in Figure 4.
Normal curve over Bin ( 100 , 0.5 ) bars, near the cut X ≤ 45 . The lavender bars are the true binomial; the slate curve is N ( 50 , 5 2 ) laid on top — they track closely because n p = n ( 1 − p ) = 50 . The coral vertical line at 45.5 (not 45 ) is the continuity correction: we shade the mint area left of it, which is P ( Z ≤ − 0.9 ) ≈ 0.184 . The picture makes the half-step obvious — the line splits the k = 45 bar down its right edge, so the whole bar for 45 is counted in.
Recall Which cell is "at least one", and why the complement?
Cell B. "At least one" spans many k values, but its complement is the single easy term P ( X = 0 ) = ( 1 − p ) n , so P ( X ≥ 1 ) = 1 − ( 1 − p ) n .
Recall What makes Example 7 not binomial, and what replaces it?
Drawing without replacement changes p each draw (and breaks independence), so the "Same p " condition fails. Use the Hypergeometric distribution instead.
Recall When do you reach for Poisson vs Normal?
Poisson when n is huge and p tiny with λ = n p moderate (rare events). Normal when n is large and p is not extreme so that n p ≥ 10 and n ( 1 − p ) ≥ 10 (bell-shaped) — remember the continuity correction and that Z ∼ N ( 0 , 1 ) .
Mnemonic Routing a binomial word problem
"Legal? Then Ask: one, all-but-none, or a slice — or just the average." Legal = BINS check (cell G). "one" = exact (A), "all-but-none" = complement (B), "slice" = range (C), "average" = summary stats (D). Extremes and limits (E, F, H, I) fall out of the same formulas.
Binomial distribution — PMF, mean, variance — the parent formulas every example above applies.
Bernoulli distribution — each single trial in these examples.
Binomial Theorem — why the PMF sums to 1.
Linearity of expectation — the mean in Example 4.
Variance and covariance — why variances add in Example 4.
Poisson distribution — the rare-event limit in Example 8.
Normal approximation to binomial — the large-n limit in Example 9.
Hypergeometric distribution — the correct model in Example 7.