Skip to main content

The binomial distribution (VCE Maths Methods Unit 2)

Syllabus dot point

“Define and apply the binomial distribution to model the number of successes in nn independent Bernoulli trials, including computing probabilities, expected value npnp and variance np(1−p)np(1-p)”

7 min read

Quick answer

For nn independent trials each with success probability pp, X∼Bin(n,p)X\sim\text{Bin}(n,p) and P(X=k)=(nk)pk(1−p)n−kP(X=k)=\binom{n}{k}p^k(1-p)^{n-k}. The mean is E[X]=npE[X]=np and the variance is Var(X)=np(1−p)\text{Var}(X)=np(1-p).

Jump to a section
  1. What this dot point is asking
  2. Bernoulli trial
  3. Binomial distribution
  4. Conditions
  5. Expected value and variance
  6. Cumulative probabilities
  7. Cumulative and "at least" probabilities
  8. Finding nn or pp from a condition
  9. In one sentence
  10. Examples in context
  11. Try this
  12. Exam-style questions

What this dot point is asking

VCAA wants you to recognise binomial situations, write the probability mass function, and use the standard formulas for the expected value and variance.

Bernoulli trial

A single experiment with two possible outcomes (success or failure) and probability pp of success. Examples: coin toss, single quality-control inspection, single penalty kick.

Binomial distribution

If nn independent Bernoulli trials are run with the same success probability pp, then XX = number of successes is binomially distributed: X∼Bin(n,p)X \sim \text{Bin}(n, p).

Probability of exactly kk successes:

P(X=k)=(nk)pk(1−p)n−k,k=0,1,…,nP(X = k) = \binom{n}{k} p^k (1 - p)^{n - k}, \quad k = 0, 1, \ldots, n

where (nk)=nCk=n!k!(n−k)!\binom{n}{k} = ^nC_k = \dfrac{n!}{k!(n - k)!}.

Conditions

To apply the binomial:

  • nn is fixed in advance.
  • Each trial has two outcomes (success / failure).
  • Probability of success is the same on every trial.
  • Trials are independent.

Expected value and variance

E[X]=npE[X] = n p

Var(X)=np(1−p)\text{Var}(X) = n p (1 - p)

σ=np(1−p)\sigma = \sqrt{n p (1 - p)}

The mean npnp is intuitive: in 1010 tosses of a fair coin, expect 55 heads. The variance peaks at p=0.5p = 0.5 (most uncertain outcome).

Cumulative probabilities

P(X≤k)=∑j=0k(nj)pj(1−p)n−jP(X \le k) = \sum_{j=0}^k \binom{n}{j} p^j (1 - p)^{n - j}.

CAS calculators give cumulative probabilities directly via BinomialCDF(n, p, k).

Cumulative and "at least" probabilities

Most exam questions ask for ranges, not single values, so fluency with cumulative probabilities is essential. "At most kk" is P(X≤k)P(X \le k), computed directly with the CAS binomCdf. "At least kk" is best handled with the complement: P(X≥k)=1−P(X≤k−1)P(X \ge k) = 1 - P(X \le k - 1), which avoids summing a long tail. "Between aa and bb inclusive" is P(X≤b)−P(X≤a−1)P(X \le b) - P(X \le a - 1). The single most common boundary error is forgetting that P(X≥k)=1−P(X≤k−1)P(X \ge k) = 1 - P(X \le k - 1), not 1−P(X≤k)1 - P(X \le k).

Finding nn or pp from a condition

VCAA also poses inverse problems: given a required probability, find the number of trials nn or the success probability pp. The "at least one" structure is the classic case: P(X≥1)=1−(1−p)nP(X \ge 1) = 1 - (1 - p)^n, set against a target, then solved for nn using logarithms (since the unknown is an exponent). Solving for pp from a single-term equation such as (nk)pk(1−p)n−k=c\binom{n}{k} p^k (1-p)^{n-k} = c is done with CAS solve, restricting to 0<p<10 < p < 1 to discard non-physical roots.

Mean, variance and a single probability

Step 1: Identify the distribution parameters

A multiple-choice quiz has 2020 questions, each with 44 options, answered by random guessing. We define success as choosing the correct option, so the probability of success on each question is p=14=0.25p = \dfrac{1}{4} = 0.25. The number of questions is n=20n = 20, and each question is answered independently, so the total number of correct answers follows a binomial distribution:

X∼Bin(20, 0.25)X \sim \text{Bin}(20,\ 0.25)

Step 2: Calculate the expected value and variance

The expected value tells us the long-run average number of correct answers, and the variance measures how spread out the results are. Applying the standard formulas directly:

E[X]=np=20×0.25=5E[X] = np = 20 \times 0.25 = 5

Var(X)=np(1−p)=20×0.25×0.75=3.75\text{Var}(X) = np(1 - p) = 20 \times 0.25 \times 0.75 = 3.75

Step 3: Compute the probability of exactly 10 correct answers

To find the probability of any specific value kk, we substitute into the binomial probability mass function P(X=k)=(nk)pk(1−p)n−kP(X = k) = \binom{n}{k} p^k (1-p)^{n-k}. Here k=10k = 10, so we need the binomial coefficient (2010)\binom{20}{10} together with the probability factors:

P(X=10)=(2010)(0.25)10(0.75)10P(X = 10) = \binom{20}{10}(0.25)^{10}(0.75)^{10}

Evaluating each part, (2010)=184,756\binom{20}{10} = 184{,}756, and multiplying through gives:

P(X=10)≈0.00992P(X = 10) \approx 0.00992

Step 4: Interpret the result

There is only about a 1%1\% chance of scoring exactly half marks by pure guessing, despite the expected score being just 55 correct. This illustrates that individual outcomes far above the mean are quite unlikely even when the distribution is symmetric around its centre.

Final answer: E[X]=5E[X] = 5, Var(X)=3.75\text{Var}(X) = 3.75, P(X=10)≈0.00992P(X = 10) \approx 0.00992.

Common traps
Misidentifying pp
Define "success" clearly; if the question concerns failures, redefine pp accordingly.
Treating dependent trials as binomial
Drawing without replacement breaks independence (that is a hypergeometric setting, beyond Unit 2 scope).
Using E[X]=pE[X] = p instead of npnp
The mean is npnp; do not forget the factor of nn.
Boundary slips on cumulative probabilities
P(X≥k)=1−P(X≤k−1)P(X \ge k) = 1 - P(X \le k - 1), not 1−P(X≤k)1 - P(X \le k).

In one sentence

The binomial distribution X∼Bin(n,p)X \sim \text{Bin}(n, p) models the number of successes in nn independent Bernoulli trials with success probability pp, with P(X=k)=(nk)pk(1−p)n−kP(X = k) = \binom{n}{k} p^k (1-p)^{n-k}, expected value E[X]=npE[X] = np and variance Var(X)=np(1−p)\text{Var}(X) = np(1 - p).

Examples in context

Example 1. Quality control on a production line. A factory's bottling line has a 5%5\% defect rate. In a random sample of 88 bottles, let XX be the number defective, so X∼Bin(8,0.05)X \sim \text{Bin}(8, 0.05). The probability of exactly one defective is P(X=1)=(81)(0.05)1(0.95)7=8×0.05×0.6983=0.2793P(X = 1) = \binom{8}{1}(0.05)^1(0.95)^7 = 8 \times 0.05 \times 0.6983 = 0.2793. The expected number of defectives per sample is E[X]=8×0.05=0.4E[X] = 8 \times 0.05 = 0.4.

Example 2. Free-throw shooting. A basketballer makes 70%70\% of free throws. In 55 attempts, X∼Bin(5,0.7)X \sim \text{Bin}(5, 0.7). The probability of making at least 44 is P(X≥4)=P(X=4)+P(X=5)=(54)(0.7)4(0.3)+(0.7)5=5(0.2401)(0.3)+0.16807=0.36015+0.16807=0.5282P(X \ge 4) = P(X = 4) + P(X = 5) = \binom{5}{4}(0.7)^4(0.3) + (0.7)^5 = 5(0.2401)(0.3) + 0.16807 = 0.36015 + 0.16807 = 0.5282.

Try this

Q1. For X∼Bin(12,0.25)X \sim \text{Bin}(12, 0.25), find E[X]E[X] and Var(X)\text{Var}(X). [2 marks]

  • Cue. E[X]=12×0.25=3E[X] = 12 \times 0.25 = 3; Var(X)=12×0.25×0.75=2.25\text{Var}(X) = 12 \times 0.25 \times 0.75 = 2.25.

Q2. A spinner lands on red with probability 0.40.4. It is spun 66 times. Find the probability of exactly 22 reds. [3 marks]

  • Cue. (62)(0.4)2(0.6)4=15×0.16×0.1296=0.311\binom{6}{2}(0.4)^2(0.6)^4 = 15 \times 0.16 \times 0.1296 = 0.311.

Q3. A test has 1010 true/false questions answered by guessing (p=0.5p = 0.5). Find the probability of getting at most 11 correct. [3 marks]

  • Cue. P(X=0)+P(X=1)=(0.5)10+10(0.5)10=11×11024=111024≈0.0107P(X = 0) + P(X = 1) = (0.5)^{10} + 10(0.5)^{10} = 11 \times \frac{1}{1024} = \frac{11}{1024} \approx 0.0107.

Exam-style questions

Questions in the style of VCAA exam questions on this dot point, each with a worked answer. They are written by ExamExplained unless tagged "Past paper"; the year shows the paper a question is modelled on.

Practice4 marks
A biased coin has P(heads)=0.6P(\text{heads}) = 0.6. It is tossed 1010 times. Find (a) P(X=7)P(X = 7), (b) E[X]E[X] and Var(X)\text{Var}(X) for XX the number of heads.
Show worked answer →

X∼Bin(10,0.6)X \sim \text{Bin}(10, 0.6).

(a) P(X=7)=10C7(0.6)7(0.4)3=120⋅0.0280⋅0.064=0.2150P(X = 7) = ^{10}C_7 (0.6)^7 (0.4)^3 = 120 \cdot 0.0280 \cdot 0.064 = 0.2150.

(b) E[X]=np=10⋅0.6=6E[X] = np = 10 \cdot 0.6 = 6.

Var(X)=np(1−p)=10⋅0.6⋅0.4=2.4\text{Var}(X) = np(1-p) = 10 \cdot 0.6 \cdot 0.4 = 2.4.

Markers reward identification of nn and pp, the binomial formula, and the standard npnp and np(1−p)np(1-p) formulas.

Practice5 marks
A seed supplier states that each seed germinates independently with probability 0.80.8. A gardener plants 1515 seeds. (a) Calculate the probability that at least 1313 germinate, correct to four decimal places. (b) Determine the smallest number of seeds the gardener should plant so that the probability of at least one germinating exceeds 0.9990.999.
Show worked answer →

Let X∼Bin(15,0.8)X \sim \text{Bin}(15, 0.8).

(a) P(X≥13)=P(X=13)+P(X=14)+P(X=15)P(X \ge 13) = P(X = 13) + P(X = 14) + P(X = 15). Using the CAS binomCdf(15, 0.8, 13, 15) (or 1−binomCdf(15,0.8,0,12)1 - \text{binomCdf}(15, 0.8, 0, 12)) gives P(X≥13)≈0.3980P(X \ge 13) \approx 0.3980.

(b) With nn seeds, the probability none germinate is (0.2)n(0.2)^n, so P(at least one)=1−(0.2)nP(\text{at least one}) = 1 - (0.2)^n. Require 1−(0.2)n>0.9991 - (0.2)^n > 0.999, i.e. (0.2)n<0.001(0.2)^n < 0.001.

Take logs: nlog⁡10(0.2)<log⁡10(0.001)n \log_{10}(0.2) < \log_{10}(0.001), so n>−3log⁡10(0.2)=−3−0.699≈4.29n > \dfrac{-3}{\log_{10}(0.2)} = \dfrac{-3}{-0.699} \approx 4.29. The smallest integer is n=5n = 5 seeds.

Markers reward the cumulative CAS computation to four decimal places, the complement set-up for part (b), and solving the inequality for the least integer.

Practise this

Sources & how we know this

ExamExplained