How this instrument works
The fundamental counting principle says that when a result is built from a sequence of independent choices, the total number of possible outcomes is the product of the number of options at each choice. If the first choice has n1 options, the second has n2, and the third has n3, and none of those choices restricts what the others can be, the total number of distinct outcomes is n1 × n2 × n3. It's the same multiplying-through logic used to count permutations and passwords, just written for choices that don't all have to offer the same number of options.
The key requirement is independence — each choice's option count has to stay fixed no matter what was picked earlier. A license plate with 2 letters followed by 1 digit fits this cleanly: the letters and the digit are drawn from separate, unrelated character sets, so the count is 26 × 26 × 10 regardless of which letters or digit actually get used. That's different from drawing cards from a shrinking deck, where an earlier pick changes what's available next — situations like that need a permutation or combination formula instead, not a straight product of fixed counts.
This is the most general of the counting-principle instruments on this site: permutation-with-repetition and password-combination are both special cases of it where every stage happens to offer the identical number of options, which is why those collapse to n^r. Here, each stage can have its own option count — 3 sizes, 4 colors, 2 styles — which is the more common shape for real multi-step choices like ordering a product, building a meal, or generating an ID that mixes different character types.
- Enter the number of options for the first independent choice into Choice 1 options.
- Enter the number of options for the second choice into Choice 2 options, and the third into Choice 3 options — leave a stage at 1 if your scenario only has two real choices.
- Read Total possible combinations beneath the inputs; the instrument multiplies all three counts together.
- Check the choices are genuinely independent first — if an earlier pick changes a later stage's option count, this straight product is wrong; use a permutation or combination formula instead.
- For a fixed-length code where every position offers the same option count — a PIN or password — the permutation-with-repetition or password-combination instruments compute that identical n^r case more directly.
Worked example — a 2-letter, 1-digit license plate
A license plate format uses 2 letters followed by 1 digit, with each character position filled independently — the letters can repeat, and the digit doesn't depend on which letters were chosen. Enter n1 = 26 (options for the first letter), n2 = 26 (options for the second letter), and n3 = 10 (options for the digit). The instrument multiplies 26 × 26 × 10 = 6,760. Total possible combinations reads 6,760.
That's every valid plate the format allows, from AA0 through ZZ9. Because each stage's option count stayed fixed regardless of the other stages' picks — the second letter always has all 26 options, whatever the first letter was — a straight product was the right tool; if the format instead forbade repeating the same letter twice, the second letter's count would drop to 25 depending on the first, and the fixed-product shortcut would no longer apply directly.
Questions
What is the fundamental counting principle?
It states that when an outcome is built from a sequence of independent choices, the total number of possible outcomes equals the product of the number of options at each choice. For a license plate with 2 letters (26 options each) and 1 digit (10 options), the total is 26 × 26 × 10 = 6,760.
What does "independent" mean here, and why does it matter?
It means the number of options at one stage doesn't change based on what was picked at another stage. A license plate's digit position always has 10 options no matter which letters came before it, so multiplying straight through is valid. If an earlier pick did change a later count — like drawing cards without replacement — a straight product would give the wrong answer, and a permutation or combination formula is needed instead.
How is this different from the permutation-with-repetition calculator?
Permutation-with-repetition is the special case of this same multiplication principle where every stage happens to offer the identical number of options, r times in a row — which is why it simplifies to n^r. This calculator handles the more general case where each stage can have its own option count, like 3 sizes, 4 colors and 2 styles, rather than requiring all stages to match.
Can I use this for more than three choices?
Yes — the principle extends to any number of independent stages; just keep multiplying in one more factor per additional stage. This instrument is built for three stages, but the same n1 × n2 × n3 ×⋯ logic applies whether you have two choices or ten.
What if one of my choices doesn't actually apply?
Set that stage's option count to 1. Multiplying by 1 leaves the total unchanged, which correctly represents a choice with only one possible outcome — effectively no real choice at all — without distorting the product from the stages that do matter.
Why does 3 coin flips give 8 possible sequences?
Each flip is an independent choice between 2 outcomes, heads or tails, and none of the flips affects what's available on the others. Multiplying the three option counts together — 2 × 2 × 2 — gives 8, matching every possible sequence from HHH through TTT.