Binomial probability describes the number of successes in a fixed number of independent trials when each trial has the same success probability. “Success” means the event being counted; it does not have to be a favourable result.
The model combines two ideas: a specified success-and-failure sequence has a product probability, and combinations count how many sequences contain the requested number of successes.
On this page
Check the conditions before calculating
Let X count successes in n trials. The binomial model requires a fixed non-negative integer n, two categories per trial, mutually independent trials, and a common success probability p. For a nontrivial model below, n is positive and .
Write
A fair die can produce a binary trial by classifying six as success and every other face as failure, giving . The original experiment need not have only two raw outcomes; it must have two categories for the event being counted.
A changing success probability or dependence generally produces a different count distribution. The NIST binomial reference gives the probability formula and its mean and variance.
Derive the probability of an exact count
For five independent trials with success probability , one specified sequence containing two successes and three failures has probability
There are ways to choose the two success positions. These sequences are mutually exclusive, so add their equal probabilities:
In general,
The combination counts the arrangements of successes; the powers give the probability of one arrangement. Omitting the combination factor calculates only one specified sequence, except in cases where just one sequence is possible.
Read the complete distribution
For , the exact terminating-decimal probabilities are:
| Successes k | ||
|---|---|---|
| 0 | 0.16807 | 0.16807 |
| 1 | 0.36015 | 0.52822 |
| 2 | 0.30870 | 0.83692 |
| 3 | 0.13230 | 0.96922 |
| 4 | 0.02835 | 0.99757 |
| 5 | 0.00243 | 1.00000 |
Ten sequences contain exactly two successes
Diagram explanation and exact data
Each sequence with two successes has probability 0.03087. There are ten such sequences, giving total 0.3087. The six count masses sum to one and their weighted mean is 1.5.
| k | Exact probability | Decimal |
|---|---|---|
| 0 | 16807/100000 | 0.16807 |
| 1 | 7203/20000 | 0.36015 |
| 2 | 3087/10000 | 0.30870 |
| 3 | 1323/10000 | 0.13230 |
| 4 | 567/20000 | 0.02835 |
| 5 | 243/100000 | 0.00243 |
The masses sum to one. The most likely individual count is one, although the mean will be 1.5. Success-count values are not equally likely simply because they are listed in consecutive order.
Translate exact, at most and at least carefully
“At most two” includes 0, 1 and 2:
“At least three” is its complement:
“At least one” instead excludes only zero:
For an integer count, . Subtracting would exclude k itself and answer “more than k”. When using a calculator or software CDF, write the event in symbols before entering the cutoff.
Interpret the mean and spread
For the binomial model,
With and , the expected count is 1.5, the variance is 1.05 and the standard deviation is approximately 1.0247 successes. A non-integer expectation is compatible with an integer-valued variable.
The expectation follows by adding the expectations of the five 0–1 success indicators. The usual variance formula uses independence as well as the common probability. Neither formula is a guarantee that an individual five-trial run will be near the mean.
Compare with sampling without replacement
Two draws from three A and two B tokens have the same marginal A probability at each position, but the draws are dependent without replacement. Their A-count probabilities are , and .
A binomial model with and would instead give
Those are the probabilities under replacement with fresh independent selection, not the original no-replacement experiment. The correct no-replacement model is hypergeometric. A large population with a small sampling fraction may justify a binomial approximation for some purposes, but that is an approximation with conditions, not exact independence.
Model checks and edge cases
If trials continue until the first success, their number is not fixed in advance; a geometric waiting model may apply instead. If individual trials have different success probabilities, the simple binomial formula does not apply even if the trials are independent.
At , the count is zero with probability one. At , it is n with probability one. Handle these endpoint models directly rather than relying on an unexplained calculation. If , there are no trials and the success count is zero.
An estimated p is another source of uncertainty. Entering a sample proportion into a binomial formula treats that estimate as if it were the model parameter for the calculation; it does not automatically account for uncertainty in p. Confidence Intervals addresses that additional inferential problem.
Practice questions
- For , find .
- For that model, find the probability of at least one success.
- In four independent trials with success probability , find the probability of at most one success.
Check your answers
- .
- .
- Add zero and one: .
Related topics
Revisit Combinations for counting success positions and Probability Distributions for PMF and CDF interpretation. Connect the model to Hypothesis Testing when evaluating evidence rather than calculating from a fully specified probability.
