Sample spaces and why listing outcomes matters
In probability, the sample space \(\Omega\) is the set of all possible outcomes of an experiment.
Once \(\Omega\) is clearly defined, an event \(A\) is simply a subset of \(\Omega\), and probabilities are assigned to events.
For many introductory problems (coin flips, dice rolls, drawing cards), \(\Omega\) is finite, so you can often list outcomes explicitly.
That is the idea behind a sample space enumerator: it helps you make the “universe of outcomes” concrete before you compute probabilities.
Repeated trials and Cartesian products
Many experiments are built by repeating a single trial \(n\) times. If one trial has a set of possible outcomes
\(S=\{s_1,s_2,\dots,s_m\}\), then repeating the trial \(n\) times produces sequences of length \(n\).
Mathematically, the sample space is the Cartesian product
\[
\Omega = S^n = \underbrace{S\times S\times \cdots \times S}_{n\ \text{times}}.
\]
Every element of \(\Omega\) is an ordered sequence \((x_1,x_2,\dots,x_n)\) where each \(x_i\in S\).
The order matters: for two coin flips, \(HT\) and \(TH\) are different outcomes.
Counting outcomes: the multiplication rule
A key benefit of this structure is that counting becomes straightforward. If \(|S|=m\) and you repeat \(n\) times, then
\[
|\Omega| = m^n.
\]
For \(n\) coin flips, \(m=2\) and \(|\Omega|=2^n\). For \(n\) dice rolls with \(s\) sides, \(m=s\) and \(|\Omega|=s^n\).
This is the same logic as the multiplication principle: if there are \(m\) choices at each step and you make \(n\) independent choices,
then there are \(m^n\) total sequences.
Outcome trees and sequence intuition
An outcome tree visualizes the product structure. The root represents the start of the experiment.
Each level corresponds to one trial, and each node branches into \(|S|\) children (one for each possible symbol).
Following a path from the root to a leaf produces a complete outcome sequence. Trees are especially helpful for avoiding common mistakes:
forgetting order, missing outcomes, or counting the same outcome twice.
Beyond finite spaces (a brief tease)
Not all sample spaces can be listed. If an outcome is a real number (like a measurement on an interval), then \(\Omega\) is infinite and uncountable.
In that setting, probability is built using measures rather than simple counting, and “uniform” ideas require more care.
Even in finite settings, some problems (like lotto-style combinations) grow so quickly that listing outcomes becomes impractical,
which is why counting formulas and careful modeling are essential.
How to use this tool
Choose coins, dice, or custom symbols, enter \(n\), and the calculator will generate a portion of \(\Omega\) in a readable format,
compute \(|\Omega|\), and draw an outcome tree. For large spaces, the diagram switches to a schematic view so the visualization stays clear.
This workflow mirrors good problem solving: define \(\Omega\), count it, then define events and compute probabilities.
