MHT-CET Maths · Binomial Distribution

The Binomial Setting and Probability Mass Function

Fix n independent trials, each a success (p) or failure (q = 1 − p); then X = number of successes follows B(n, p), and P(X = r) = ⁿCᵣ pʳ qⁿ⁻ʳ — the single formula every question in this subtopic runs on.

Why this matters

This is the foundation of the whole chapter: 10 PYQs sit here (5 EASY, 4 MODERATE, 1 HARD). Every later idea (mean np, variance npq, at-least/at-most tails) is built on top of this one PMF. The recurring skills are three: reading n, p and q correctly from the wording (with-replacement draws, 'success = …'), evaluating a single P(X = r), and writing out the full P(X = 0…n) distribution table for a small experiment.

Concept 1 of 3

The Binomial Setting — n Fixed Independent Success or Failure Trials

Intuition

Picture the same simple experiment repeated a fixed number of times, each time with only two possible outcomes labelled success and failure, and each repeat unaffected by the others. Count how many successes you get — that count is a binomial random variable. Tossing a coin 10 times and counting heads, or drawing a ball with replacement 3 times and counting reds, are the everyday pictures.

Definition

Four conditions define a binomial setting (Bernoulli trials):

  • Fixed number of trials nn, decided in advance.
  • Two outcomes per trial — a success (probability pp) and a failure (probability q=1pq = 1 - p).
  • Constant pp — the success probability is the same on every trial (drawing WITH replacement keeps this true; without replacement breaks it).
  • Independent trials — one trial's result does not change another's.

Then XX, the number of successes in the nn trials, is a binomial variable, written XB(n,p)X \sim B(n, p). It takes values 0,1,2,,n0, 1, 2, \dots, n.

Binomial variable and its parameters

XB(n,p),q=1p,X{0,1,2,,n}X \sim B(n, p),\qquad q = 1 - p,\qquad X \in \{0, 1, 2, \dots, n\}
  • nnumber of trials (fixed in advance)
  • pprobability of success on a single trial
  • qprobability of failure, q = 1 − p
  • Xnumber of successes across the n trials

Worked example

A fair coin is tossed 8 times and XX counts the number of tails. Identify nn, pp and qq, and state which values XX can take.
Practice this conceptself-check · 4 quick reps

Binomial needs WITH-replacement (or constant p), not without-replacement

The binomial formula assumes every trial has the SAME success probability. Drawing objects one-by-one WITHOUT replacement changes pp each draw — that is the hypergeometric setting, not binomial. Exam wording like 'a ball is drawn, its colour noted and REPLACED, and the process repeated' is the signal to use the binomial formula.

q = 1 − p is derived, so a binomial has only TWO parameters

A binomial distribution is fixed by exactly two numbers, nn and pp; the failure probability is q=1pq = 1 - p, never an independent third parameter. If a problem gives you qq directly, get p=1qp = 1 - q before doing anything else.

Concept 2 of 3

The Binomial PMF — Probability of Exactly r Successes

Intuition

To get exactly rr successes in nn trials you need rr successes (each contributing pp) and nrn - r failures (each contributing qq); that is prqnrp^r q^{n-r} for one particular ordering. Since the rr successes can sit in any of nCr{}^{n}C_r positions, multiply by that count. Reading nn, pp, qq off the wording is half the battle.

Definition

For XB(n,p)X \sim B(n, p), the probability mass function (the probability of exactly rr successes) is

P(X=r)=nCrprqnr,r=0,1,2,,n.P(X = r) = {}^{n}C_r\, p^{r} q^{\,n-r},\qquad r = 0, 1, 2, \dots, n.

  • The nCr{}^{n}C_r counts the ways to choose WHICH trials succeed; prqnrp^{r} q^{n-r} is the probability of any one such pattern.
  • All-successes: P(X=n)=pnP(X = n) = p^{n}. No-successes: P(X=0)=qnP(X = 0) = q^{n} (both binomial coefficients are 1).
  • Set up pp, qq, nn first, then plug in rr. 'None defective' means r=0r = 0 with success = defective, i.e. qnq^{n} where qq = P(good).

Binomial probability mass function

P(X=r)=nCrprqnrP(X = r) = {}^{n}C_r\, p^{r}\, q^{\,n-r}
  • ⁿCᵣnumber of ways to place the r successes among the n trials
  • probability of r successes
  • qⁿ⁻ʳprobability of the remaining n − r failures

Worked example

A fair die is rolled 5 times. Find the probability of getting a six exactly twice.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 2Binomial DistributionEASY
The probability that a student is not a swimmer is 15\frac{1}{5}. The probability that out of 5 students selected at random 4 are swimmers is

[Q112 · 25 April Shift II · 2025]

'Not a swimmer is 1/5' means success p = 4/5, not p = 1/5

When the wording gives the probability of the FAILURE ('not a swimmer', 'defective', 'does not recover'), that number is qq, not pp. Get p=1qp = 1 - q first. If P(not a swimmer) =15= \tfrac15 then p=45p = \tfrac45, and P(4 of 5 swim) =5C4(45)4(15)=(45)4= {}^5C_4\left(\tfrac45\right)^4\left(\tfrac15\right) = \left(\tfrac45\right)^4.

'None defective' is P(X = 0) = qⁿ, and it needs WITH-replacement

For a box of 100 bulbs with 10 defective, P(a bulb is good) =910= \tfrac{9}{10}. Drawing 5 (with replacement) gives P(none defective) =(910)5= \left(\tfrac{9}{10}\right)^5, i.e. q5q^{5} with q=q = P(good). Do NOT switch to a without-replacement (hypergeometric) count — the binomial answer is the intended one.

Don't forget the ⁿCᵣ multiplier

prqnrp^r q^{n-r} is the probability of ONE specific arrangement of rr successes. There are nCr{}^{n}C_r arrangements, so the full probability is nCrprqnr{}^{n}C_r\,p^r q^{n-r}. Writing just prqnrp^r q^{n-r} (omitting the coefficient) is the most common single-term slip — except at the extremes r=0r = 0 or r=nr = n, where nCr=1{}^{n}C_r = 1.

Match the exponents to r and n − r, in that order

In nCrprqnr{}^{n}C_r\,p^r q^{n-r}, the success probability pp carries the exponent rr (the number of successes) and the failure probability qq carries nrn - r. Swapping them — e.g. writing 6C5q5p1{}^{6}C_5\,q^5 p^1 when 5 successes are wanted — is a standard distractor built into MHT-CET option sets.

Concept 3 of 3

Building the Full Probability Distribution Table

Intuition

For a small experiment you often want the whole picture: the probability of 0 successes, 1 success, up to nn successes, laid out in a table. You just evaluate the PMF at every r=0,1,,nr = 0, 1, \dots, n. A neat check: all the probabilities must add to 1, exactly matching the binomial expansion of (q+p)n(q + p)^n.

Definition

A probability distribution of XB(n,p)X \sim B(n, p) lists each value with its probability:

  • Evaluate P(X=r)=nCrprqnrP(X = r) = {}^{n}C_r\,p^r q^{n-r} for r=0,1,,nr = 0, 1, \dots, n.
  • The successive probabilities are exactly the terms of (q+p)n(q + p)^n, so they must sum to (q+p)n=1(q + p)^n = 1 — the built-in validity check.
  • For n=2n = 2 (e.g. a die tossed twice): P(0)=q2P(0) = q^2, P(1)=2pqP(1) = 2pq, P(2)=p2P(2) = p^2. For n=3n = 3: q3, 3pq2, 3p2q, p3q^3,\ 3pq^2,\ 3p^2q,\ p^3.

Distribution terms sum to one via the binomial expansion

r=0nP(X=r)=r=0nnCrprqnr=(q+p)n=1\sum_{r=0}^{n} P(X = r) = \sum_{r=0}^{n} {}^{n}C_r\, p^r q^{n-r} = (q + p)^{n} = 1

Visualization · change n and p, watch the distribution reshape

mean = 4012345678Pnumber of successes k
trials n:
p:

At p = 0.5 the bars are symmetric about the centre. Push p to 0.2 and the peak slides left (few successes likely); push it to 0.8 and it slides right. The dashed line always sits at the mean np — raising n stretches the distribution and moves that centre.

Worked example

A fair coin is tossed twice and XX is the number of heads. Write the probability distribution of XX.
Practice this conceptself-check · 4 quick reps

From the bank · past-year question

Example 3Binomial DistributionMODERATE
A bag contains 4 red and 3 black balls. One ball is drawn and then replaced in the bag and the process is repeated. Let X denote the number of times black ball is drawn in 3 draws. Assuming that at each draw each ball is equally likely to be selected, then probability distribution of X is given by

[Q144 · 9th May Shift 2 · 2023]

Order the table by ascending r — P(X = 0) uses qⁿ, P(X = n) uses pⁿ

In a distribution table the first entry is P(X=0)=qnP(X = 0) = q^{n} (all failures) and the last is P(X=n)=pnP(X = n) = p^{n} (all successes). MHT-CET distractors reverse this order or swap the middle terms — for a die tossed twice, the correct row is P(0)=2536, P(1)=518, P(2)=136P(0) = \tfrac{25}{36},\ P(1) = \tfrac{5}{18},\ P(2) = \tfrac{1}{36}, decreasing because q>pq > p.

Fix which colour is 'success' before building the table

For a bag with 4 red and 3 black balls drawn with replacement, if XX counts BLACK then p=37p = \tfrac37 (black) and q=47q = \tfrac47 (red) — so P(X=0)=(47)3P(X=0) = \left(\tfrac47\right)^3 uses the RED probability. Assigning pp to the wrong colour flips the whole table and lands on the mirror-image distractor.

The probabilities must sum to 1 — use it as a check

Because the entries are the terms of (q+p)n(q + p)^n, they always total 1. After writing a distribution table, add the entries: if they do not sum to 1 you have miscomputed a coefficient or an exponent. This single check catches most table errors before you pick an option.

Middle term of B(2, p) carries a factor 2 (not 1)

For two trials, P(X=1)=2C1pq=2pqP(X = 1) = {}^{2}C_1\,pq = 2pq, because there are two orderings (success-then-failure and failure-then-success). Writing P(X=1)=pqP(X = 1) = pq drops the count and is a classic two-trial slip; likewise P(X=1)P(X = 1) for three trials is 3pq23pq^2, not pq2pq^2.

Summary — formulas & gotchas at a glance

A revision cheat-sheet for the formulas and gotchas above. Click any concept name to jump back to its full explanation.

Formulas (3)

Watch out for (10)

Drill every past-year question on this subtopic

10 questions from the bank — paginated, with cart and Word-export support.