Multiply independent event possibilities to discover total distinct outcomes. Essential tool for combinatorics, probability, and real-world decision analysis.
Last updated: May 2026 | By Patchworkr Team
| Scenario | Events | Total |
|---|---|---|
| Coin flips (2 coins) | 2 × 2 | 4 |
| Dice rolls (2 dice) | 6 × 6 | 36 |
| Outfit choices | 4 × 3 × 2 | 24 |
| Pizza customization | 3 × 4 × 2 × 2 | 48 |
| PIN (4 digits) | 10^4 | 10,000 |
The Fundamental Counting Principle states that if you have a sequence of independent events—where event 1 has n₁ possible outcomes, event 2 has n₂ possible outcomes, and event 3 has n₃ possible outcomes—then the total number of distinct outcomes for the complete sequence is the product: n₁ × n₂ × n₃.
This principle forms the foundation of combinatorics and probability theory. It applies whenever choices are independent (the outcome of one event doesn't affect others) and helps answer questions like: "How many different passwords are possible?" "How many outfits can I make?" and "What are all the possible outcomes when rolling two dice?"
Where n₁, n₂, ... nₖ are the number of outcomes for each independent event.
How many distinct coffee orders can a shop prepare?
The total becomes zero. If any single choice is impossible, no valid combinations exist for the entire sequence.
No, the principle requires independent events. For dependent events (like drawing cards without replacement), use conditional probability instead.
The Counting Principle multiplies independent events. Permutations count ordered arrangements; combinations count unordered selections. They're related but different concepts.
Multiplication is commutative: 3 × 2 × 4 = 2 × 4 × 3. The event order doesn't matter—only that each represents an independent choice stage.
Because it's a fundamental rule (principle) that underpins all of combinatorics. It's the foundation for understanding permutations, combinations, and probability.
Password strength, menu combinations, outfit choices, manufacturing SKUs, transportation route options, database queries, and any scenario with independent sequential choices.
Probability divides favorable outcomes by total outcomes. The Counting Principle helps calculate the total outcomes denominator in probability problems.
Yes! 10 choices for each of 5 events = 10⁵ = 100,000 outcomes. Results grow exponentially as you add events, which shows why passwords need sufficient length.