Theorem — Formula of the binomial distribution

Under the hypotheses of the Bernoulli scheme, the probability of kk successes in nn trials is: Pn(k)=(nk)pk(1p)nk,k=0,1,,n.P_n(k) = \binom{n}{k}\, p^k\, (1-p)^{n-k}, \qquad k=0,1,\ldots,n.

Proof

A specific sequence of nn trials with kk successes and nkn-k failures (for example SSISISSSI\ldots SIS) has probability pk(1p)nkp^k(1-p)^{n-k}: the outcomes are independent, so the probabilities multiply. The distinct sequences that have exactly kk successes and nkn-k failures number (nk)\binom{n}{k}: choosing the kk positions where the success sits is equivalent to choosing a subset of kk elements out of nn. Since these outcomes are mutually exclusive, their probabilities add up; being all equal, the total is (nk)pk(1p)nk\binom{n}{k}\,p^k(1-p)^{n-k}. ∎

Topics: Probability
Concepts: Simple combinations · Binomial distribution · Bernoulli scheme
Methods: Binomial
Skills: Probability calculation · Proving · Using formulae