1 · What are we counting, and when is it Binomial?
Why?
The model must match what X counts. A fixed n gives a known number of positions. Independence allows multiplication, and a common p makes orders with the same success count equally likely. These conditions let one Binomial formula group the orders correctly.
Key idea
Use X ∼ Bin(n, p) when there are a fixed n trials, two outcomes per trial, independent trials, and the same success probability p. X counts successes, so X = 0, 1, …, n.
Worked example
Three independent tosses, with P(H) = 0.6. Let X count heads.
- Define the counted outcome: success = H, so p = 0.6.
- There are n = 3 independent trials; each gives H or T, with unchanged probabilities.
- Therefore X ∼ Bin(3, 0.6), with possible counts 0, 1, 2, 3.