4.7 Discrete Distribution (Playing Card Experiment)

Playing cards offer a hands-on way to explore probability distributions. Drawing cards without replacement creates a shifting probability landscape where each draw changes the odds of the next one. This makes card experiments ideal for studying the hypergeometric distribution and understanding how discrete random variables behave when sampling without replacement.

Discrete Probability Distributions

more resources to help you study

practice questions

Card experiment for probability distributions

A standard 52-card deck contains 4 suits (hearts, diamonds, clubs, spades) and 13 ranks (Ace through King). In this experiment, you draw cards without replacement, meaning each card you pull stays out of the deck before the next draw.

This setup produces a discrete probability distribution, which assigns a probability to each possible outcome in a countable sample space. Here, the random variable might be something like "the number of hearts drawn in 5 cards."

The key feature: probability changes with each draw. If you draw the King of Hearts first, only 3 Kings remain among 51 cards. That shift is what makes this experiment different from rolling dice or flipping coins, where probabilities stay fixed.

Hypergeometric distribution in card draws

The hypergeometric distribution models the probability of getting a specific number of "successes" in a fixed number of draws from a finite population without replacement. A "success" is whatever you define it to be: drawing a heart, drawing an Ace, drawing a face card, etc.

The probability mass function is:

$P(X = k) = \frac{\binom{K}{k} \binom{N-K}{n-k}}{\binom{N}{n}}$

where:

• $N$ = total population size (52 for a standard deck)
• $K$ = number of successes in the population (e.g., 13 hearts)
• $n$ = number of draws (e.g., 5 cards drawn)
• $k$ = number of observed successes (e.g., 2 hearts among your 5 cards)

How to use this formula, step by step:

1. Define your "success" (e.g., drawing a heart).
2. Identify $N$, $K$, $n$, and $k$ from the problem.
3. Calculate $\binom{K}{k}$: the number of ways to choose $k$ successes from the $K$ available.
4. Calculate $\binom{N-K}{n-k}$: the number of ways to choose the remaining draws from the non-successes.
5. Calculate $\binom{N}{n}$: the total number of ways to choose $n$ cards from the full deck.
6. Divide the product of steps 3 and 4 by step 5.

Example: What's the probability of drawing exactly 2 hearts in a 5-card hand?

• $N = 52$, $K = 13$, $n = 5$, $k = 2$

$P(X = 2) = \frac{\binom{13}{2} \binom{39}{3}}{\binom{52}{5}} = \frac{78 \times 9139}{2{,}598{,}960} \approx 0.2743$

So there's about a 27.4% chance of getting exactly 2 hearts in a 5-card hand.

Independence and replacement in card experiments

Without replacement (dependent draws): Two events are independent if one occurring doesn't change the probability of the other. In this card experiment, draws are not independent. If you draw a heart first, the probability of drawing another heart drops from $\frac{13}{52}$ to $\frac{12}{51}$. This dependence between draws is exactly why the hypergeometric distribution applies.

With replacement (independent draws): If you returned each card to the deck and reshuffled before drawing again, every draw would have the same probability of success. The draws become independent, and the situation follows a binomial distribution instead. The binomial applies whenever you have a fixed number of independent trials, each with the same probability of success (like flipping a coin multiple times).

Probability Theory and Combinatorics in Card Experiments

Combinatorics is the counting tool that makes card probability calculations possible. The combination formula $\binom{n}{r}$ tells you how many ways you can choose $r$ items from $n$ items when order doesn't matter. For instance, the total number of possible 5-card hands from a 52-card deck is $\binom{52}{5} = 2{,}598{,}960$.

The sampling process in this experiment is without replacement, which is why combinatorics pairs naturally with the hypergeometric formula: you're counting favorable groupings and dividing by total possible groupings.

One more connection worth noting: before any cards are drawn, every card has an equal $\frac{1}{52}$ chance of being selected first. That initial equal-chance setup is a discrete uniform distribution. But once you start counting successes across multiple draws, you've moved into hypergeometric territory.