Seyed Masoud Hosseini · Overview · Study log · Weekly summaries · Ideas · Search · Transcript · RSS feed

Probability · Lecture 16 of 76 · 5:48

Hypergeometric Probabilities

Study guide

What this lecture covers

This short problem derives the hypergeometric probability formula: given an urn of n balls where m are red, what is the probability that exactly i of k balls drawn (without replacement) are red? It applies the discrete uniform law together with counting arguments already developed in the course, then works a numerical example using a deck of cards.

After watching, you should be able to derive and apply the hypergeometric probability formula, and recognize problems that fit this pattern, such as drawing a fixed number of a specific card rank from a deck.

Key ideas

Hypergeometric setup: an urn has n balls total, m of which are red; k balls are drawn without replacement, and the question asks for the probability that exactly i are red.
Sample space size: the total number of ways to draw k balls out of n is n choose k.
Counting favorable outcomes: the number of ways to get exactly i red balls is the product of choosing i red balls from the m red balls and choosing the remaining k-i balls from the n-m non-red balls, i.e. (m choose i) * (n-m choose k-i).
Hypergeometric formula: combining these gives P = (m choose i)(n-m choose k-i) / (n choose k).
Card example: for a 52-card deck with 4 aces, drawing 7 cards, the probability of getting exactly 3 aces is (4 choose 3)(48 choose 4) / (52 choose 7).

Before you watch

Review the discrete uniform law and binomial coefficients (n choose k) from earlier lectures in this course.

Check your understanding

Why is the total number of ways to draw k balls from n equal to n choose k?
Why does counting the favorable outcomes require multiplying two separate binomial coefficients rather than adding them?
How would the formula change if the balls were drawn with replacement instead?

Vocabulary

hypergeometric (adjective): Describing a probability model for drawing a fixed sample from a group without putting items back.
The hypergeometric formula gives the chance of drawing exactly 3 aces.
urn (noun): A classic container used in probability examples to hold a mix of items.
The urn contains a mix of red and non-red balls.
without replacement (phrase): Describing a draw where each chosen item is removed and cannot be picked again.
The cards are drawn without replacement from the deck.
favorable outcome (noun): An outcome that counts as a success for the event being measured.
Favorable outcomes here are draws with exactly 3 aces.
draw (cards) (verb): To take items out of a group at random, one at a time.
You draw seven cards from the deck.
combine (counts) (verb): To bring separate counted quantities together into one formula.
The two binomial coefficients are combined by multiplying.
product (noun): The result of multiplying two or more numbers together.
The favorable-outcome count is a product of two binomial coefficients.
recognize (a pattern) (verb): To notice that a problem fits a familiar type.
You should recognize problems that fit this hypergeometric pattern.
numerical example (noun): A worked case using specific numbers instead of general symbols.
A numerical example with cards makes the formula concrete.
total (number) (adjective): Referring to the full count of items, not a subgroup.
The urn has n total balls.
rank (of a card) (noun): The value of a playing card, such as ace, king, or two.
Drawing a fixed number of a specific card rank uses this formula.
apply (a formula) (verb): To use a known rule or formula to solve a new problem.
You apply the hypergeometric formula to the card example.
derivation (noun): The step-by-step process of arriving at a formula.
The derivation combines the discrete uniform law with counting.
short (problem) (adjective): Brief, covering only a small amount of material.
This is a short problem that builds directly on earlier counting ideas.
fixed (number) (adjective): Set in advance and not changing during the problem.
A fixed number of balls are drawn from the urn.
recognize (structure) (verb): To notice the underlying pattern behind a specific problem.
Recognizing the hypergeometric structure lets you skip re-deriving the formula.
short derivation (noun): A brief chain of reasoning leading to a formula.
This short derivation builds the hypergeometric formula step by step.
sample (of items) (noun): A subset chosen from a larger group.
The problem draws a fixed sample from an urn of balls.
concrete (example) (adjective): Specific and real rather than abstract or general.
The card example makes the formula concrete.
already developed (phrase): Built earlier and ready to be reused.
The formula uses counting arguments already developed in the course.

From the YouTube description

MIT 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013
View the complete course: http://ocw.mit.edu/6-041SCF13
Instructor: Kuang Xu

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

← Rooks on a Chessboard · Lecture 5: Discrete Random Variables I →