How this calculator works
If one stage offers m choices and every one of those choices has n continuations, there are mn complete outcomes. Repeating this multiplication across all stages gives the total. Counts need not describe probabilities, but the same continuation count must apply to every path at each stage.
Formula
Total outcomes = c1 × c2 × ... × ck, where ci is the number of choices at stage i.
Worked example
A meal with 3 starters, 4 mains and 2 desserts has 3 × 4 × 2 = 24 possible selections. A code with 10 choices for each of four positions has 10000 outcomes.
Advertisement
Frequently asked questions
What if a stage has zero choices?
No complete path can pass through it, so the total is zero.
Does the rule require statistical independence?
It requires the stated number of continuations at each stage for every earlier choice. Probabilistic independence is a separate concept.
Can I use this for selections without replacement?
Yes if you enter the decreasing choice counts, such as 5, 4, 3 for three ordered picks from five objects.