Course contentsShow
← Mathematics
Lesson 2875 of 3,12157. Common DistributionsFree lesson

Binomial Probability Mass Function

Derive the binomial PMF using combinations and explain how to calculate probabilities for specific numbers of successes.

Binomial Probability Mass Function

What you'll learn: You'll learn how to derive and use the binomial PMF formula to calculate the exact probability of getting a specific number of successes in a fixed number of independent trials.

The Core Idea

Imagine flipping a coin 5 times and wanting to know: "What's the probability of getting exactly 3 heads?" The binomial PMF answers this.

The binomial distribution models the number of successes in n independent Bernoulli trials, each with success probability p. To find P(X = k), we need two pieces:

  1. How many ways can we arrange k successes among n trials?
  2. What's the probability of any one specific arrangement?

Deriving the Binomial PMF

For any specific sequence with k successes and (n - k) failures, the probability is:

  • p^k (probability of k successes)
  • (1-p)^(n-k) (probability of n-k failures)

But there are multiple ways to get exactly k successes. The number of ways to choose which k trials out of n are successes is the combination C(n,k) = n!/(k!(n-k)!).

The Binomial PMF:

P(X = k) = C(n,k) × p^k × (1-p)^(n-k), for k = 0, 1, 2, ..., n

Example Calculation

For 5 coin flips (n=5, p=0.5), exactly 3 heads (k=3):

P(X = 3) = C(5,3) × (0.5)³ × (0.5)² = 10 × 0.125 × 0.25 = 0.3125

The "10" represents the 10 different orderings of HHHTT.

Key Takeaway: The binomial PMF combines combinatorics (counting arrangements) with probability (success/failure rates) to calculate P(X = k) = C(n,k) × p^k × (1-p)^(n-k), giving the exact probability of k successes in n independent trials.