Probability trees & sampling
Expected red count1.2
Samples0
P(R=0)0.1
P(R=1)0.6
P(R=2)0.3
P(R=3)0
Experiment settings
Explore and explain
Each trial starts with the original bag, which must contain at least one ball. With replacement gives a binomial count; without replacement gives a hypergeometric count. Sampling uses a saved deterministic seed and generator version.
The tree includes zero-probability paths in pale lines. Readouts compare theoretical probabilities with observed frequencies; finite samples need not match exactly.
OpenStax · Probability distributions