Hypergeometric Probability Formula
What you'll learn: You'll learn how to calculate exact probabilities when sampling without replacement from a finite population using the hypergeometric formula with combinations.
The Core Idea
The hypergeometric distribution arises when you draw items from a finite population without replacement, where each item can be classified as a "success" or "failure." Unlike the binomial distribution (which assumes independence), the hypergeometric accounts for the changing composition of the population after each draw.
Think of drawing cards from a deck without putting them back, or selecting defective items from a batch. Each draw affects the probability of the next.
The Formula
The probability of getting exactly k successes in n draws from a population of N items containing K successes is:
P(X = k) = [C(K, k) × C(N - K, n - k)] / C(N, n)
Where:
- N = total population size
- K = number of success items in population
- n = number of items drawn (sample size)
- k = number of successes desired in the sample
- C(a, b) = combinations ("a choose b")
Breaking It Down
- C(K, k): Ways to choose k successes from K available successes
- C(N - K, n - k): Ways to choose the remaining (n - k) failures from (N - K) available failures
- C(N, n): Total ways to choose n items from N
The numerator counts favorable outcomes; the denominator counts all possible outcomes.
Example
A box contains 8 red balls and 12 blue balls. If you draw 5 balls without replacement, what's the probability of getting exactly 3 red balls?
P(X = 3) = [C(8, 3) × C(12, 2)] / C(20, 5)
= [56 × 66] / 15,504
= 3,696 / 15,504
≈ 0.238
Key Takeaway: The hypergeometric formula uses combinations to compute exact probabilities for sampling without replacement by counting favorable arrangements divided by total possible arrangements.