Course contentsShow
← Data Science
Lesson 127 of 2,1454. Discrete Probability DistributionsFree lesson

Binomial Distribution PMF

Learn the binomial PMF formula P(X=k)=C(n,k)p^k(1-p)^(n-k) and understand each component's role.

What You'll Learn

You'll learn the exact formula for calculating the probability of getting a specific number of successes in a fixed number of independent Bernoulli trials.

The Binomial PMF Formula

When you run n independent Bernoulli trials (like flipping a coin 10 times), the binomial distribution tells you the probability of getting exactly k successes. The formula is:

P(X = k) = C(n, k) × p^k × (1 - p)^(n - k)

Let's break down each component:

Understanding Each Part

  • P(X = k): The probability that random variable X equals exactly k successes
  • C(n, k): The number of ways to choose k successes from n trials (called "n choose k" or the binomial coefficient)
  • p^k: The probability of getting k successes (since each success has probability p)
  • (1 - p)^(n - k): The probability of getting (n - k) failures (since each failure has probability 1 - p)
  • n: Total number of trials
  • k: Number of successes you're asking about
  • p: Probability of success on each individual trial

An Intuitive View

Think of it this way: you need two things to happen:

  1. You get successes and failures in the right quantities (that's the p^k and (1-p)^(n-k) part)
  2. Those successes can occur in different orders (that's what C(n, k) counts)

For example, getting 2 heads in 3 coin flips can happen as HHT, HTH, or THH — three different sequences, all with the same individual probability.

Key Takeaway: The binomial PMF multiplies the number of ways to arrange k successes in n trials by the probability of any single arrangement occurring, giving you the total probability of exactly k successes.