An urn holds balls of a few colors and you draw some at random. With replacement the draws are independent; without replacement each draw changes the bag, and the next probability must be updated.
Recognize the problem
Trigger words: urn, bag, box, marbles, balls, drawn at random, with replacement, without replacement, both red, exactly two. Also any setting that works the same way: choosing people from a group, picking items from a batch.
Set it up
1. ContentsWrite how many balls of each color, and the total.
2. ReplacementWith replacement, every draw has the same bag; multiply equal probabilities. Without replacement, reduce the color and the total after each draw.
3. OrderFor a sequence ("red then blue"), multiply along one order. For "exactly" or "one of each", add every order that fits.
4. Counting shortcutWithout replacement and order ignored, count combinations: (a+cr+b)(ar)(cb).
5. CheckThe probabilities of all possible color counts add to 1.
Interpret the result. Give a simplified fraction or a decimal rounded to 4 places. A count of a fixed number of one color in a fixed-size draw without replacement follows the hypergeometric probability method; with replacement it is binomial.
Worked examples
Example 1 · two red, with replacement
independent draws
bag of 4 red, 6 blue
104⋅104=10016=254
bag restored each time
Example 2 · two red, without replacement
dependent draws
104⋅93=9012
one red fewer, one ball fewer
=152
Example 3 · exactly two red in three draws
combinations
(24)(16)=6⋅6=36
2 red, 1 blue
(310)=120
all sets of three
P=12036=103
See it happen
Without replacement, each draw removes a ball, so the tree changes its branch labels at every level. With replacement, every level has the same labels. Watch the second-level branches change in the tree diagram tool.
Common mistakes
Replacement ignored
✗without replacement: 104⋅104
✓104⋅93
Only one order counted
✗exactly two red in three draws: 104⋅93⋅86
✓three orders (RRB, RBR, BRR), each 101: total 103