A handful of distributions come up again and again because the same stories do: repeated trials, waiting for a success, sampling from a box, rare events. Learn the five stories and you can name the distribution from the wording, and write down its mean and variance without calculating.
One trial with two outcomes: the customer buys or doesn’t, the coin lands heads or doesn’t. Code success as 1 and failure as 0, with P(1) = p. That is a Bernoulli random variable, and it is the indicator from Lesson 5 under another name.
p(1 − p) is largest at p = ½, where it equals ¼. A coin that almost always lands heads is predictable, so its variance is small. Every binomial fact about “maximum variance” comes from this.
Repeat a Bernoulli trial n times and count the successes. The count is binomial when three things hold, which Hyderabad 2019 listed as its options: a fixed number of trials, two outcomes each time, and independent trials. Implicit in “the same experiment” is that p stays the same from trial to trial.
Where does the formula come from? Any particular sequence with k successes and n − k failures, say SSF…F, has probability pᵏ(1 − p)ⁿ⁻ᵏ by independence. There are C(n, k) such sequences, one for each way of choosing which k trials succeed (Lesson 1). Add them up:
Choose an exam set-up below or set n and p yourself. Tap a bar or use the sliders to pick the values you want; the shaded total is their probability.
Heads in 25 tosses of a fair coin. The mean, 12.5, is not a value X can take.
Tap a bar to pick a single value, or set a range with the sliders.
Recover n and p from the mean and variance. Divide: Var/Mean = np(1 − p)/np = 1 − p. JNU 2019 gave E(X) = 2 and Var(X) = 4/3, so 1 − p = 2/3, p = 1/3 and n = 2/(1/3) = 6. JNU 2021 gave 4 and 4/3: 1 − p = 1/3, p = 2/3, n = 6.
Compare two neighbouring probabilities. Their ratio cancels most of the formula:
The same ratio answers DSE 2015: P(k) = P(k + 1) exactly when (n − k)p = (k + 1)(1 − p), that is when k = (n + 1)p − 1. So (n + 1)p must be a whole number. And CUET 2024 asked you to order P(1 head in 1 toss) = 0.5, P(5 heads in 10) ≈ 0.246, P(10 in 20) ≈ 0.176 and P(50 in 100) ≈ 0.080: with more tosses, hitting exactly half becomes less likely, even though the proportion of heads gets closer to ½.
Keep tossing until the first head. X, the number of tosses, is geometric: the first k − 1 tries fail and the k-th succeeds. Unlike the binomial, the number of trials is the random part. Waiting for several successes instead of one is the negative binomial.
Draw n items at once from a box of N, of which K are “successes”. The draws are not independent, because each one changes what’s left, so the count is not binomial. It is hypergeometric, and its formula is pure Lesson 1 counting: choose k of the K successes and n − k of the N − K failures, out of all C(N, n) samples.
JNU 2020 took 5 bulbs from 100 with 10 faulty and asked for P(none faulty). Exactly, that is C(90, 5)/C(100, 5) ≈ 0.584. The answer key used (0.9)⁵ ≈ 0.590, the binomial, which treats the bulbs as put back. Lesson 1 worked through that discrepancy. With a sample this small compared with the box, the two are close; pick “Faulty bulbs” in the explorer and switch on the binomial overlay to compare.
Misprints on a page, accidents at a junction in a month, calls to a helpline in an hour. There are many chances for the event and each is unlikely, and what you know is the average count, λ. Such counts follow the Poisson distribution.
“At least one” works as it did in Lesson 1: P(X ≥ 1) = 1 − P(X = 0) = 1 − e^(−λ). With 3 misprints a page on average and e⁻³ = 0.049787 given, P(some mistake) = 1 − 0.049787 ≈ 0.9502 (JNU 2012). CUET 2024 printed a single Poisson probability, e⁻²2³/3!, and asked for the mean: read λ = 2 off the e⁻².
The distributions are relatives, and exam questions test the family tree.
CUET 2024 asked what a binomial with “a very large N” can be approximated by, with Poisson and normal both among the options. Both are correct large-n approximations; which one applies depends on p, which the question doesn’t give. The provisional answer key chose Poisson. If you meet this question, look for any hint that p is small (“rare”), which points to Poisson.
| Distribution | The story | P(X = k) | Mean | Variance |
|---|---|---|---|---|
| Bernoulli(p) | One trial: success (1) or failure (0) | P(1) = p, P(0) = 1 − p | p | p(1 − p) |
| Binomial(n, p) | Successes in n independent trials | C(n, k) pᵏ (1 − p)ⁿ⁻ᵏ, k = 0 … n | np | np(1 − p) |
| Geometric(p) | Trials up to the first success | (1 − p)ᵏ⁻¹ p, k = 1, 2, … | 1/p | (1 − p)/p² |
| Hypergeometric(N, K, n) | Successes in n draws without replacement | C(K, k) C(N − K, n − k) / C(N, n) | nK/N | n(K/N)(1 − K/N)(N − n)/(N − 1) |
| Poisson(λ) | Count of rare events at rate λ | e^(−λ) λᵏ / k!, k = 0, 1, 2, … | λ | λ |
Ask two questions. Is the number of trials fixed (binomial, hypergeometric) or are you waiting (geometric)? Are the trials independent, with replacement (binomial), or drawn from a finite box without it (hypergeometric)? A count with no fixed number of trials, only an average rate, is Poisson.
A card is drawn from a well-shuffled pack n times, replaced and reshuffled each time. X is the number of aces drawn. (Hyderabad 2013)
Five bulbs are taken together from a box of 100, of which 10 are faulty. X is the number of faulty bulbs among the five. (JNU 2020)
A fair coin is tossed until a head appears. X is the number of tosses needed. (DSE 2010)
The number of printing mistakes on a page of a book. (JNU 2012)
Each customer who enters a shop buys something with probability 0.3. X is the number of buyers among 10 customers. (CUET 2023)
X is 1 if the next customer buys something and 0 if not.
The number of phone calls a call centre receives between 10 and 11 in the morning, when it averages 40 an hour.
A basketball player makes each free throw with probability 0.8. X is the number of throws until her first miss.
Definitions and one-step problems. Most CUET and UGC NET questions sit here.
Two or three steps, up to the hardest JAM, JNU and Hyderabad questions.
This topic’s hardest questions, from the DSE entrance, are worked through in Lesson 9: Distributions.
These are questions from the TestStop bank. A free account answers 10 a day, each with its worked solution; All-Access opens every set with no daily limit.