The Fundamental Counting Principle
Simple Explanation
When a choice involves several independent stages, the total number of possible outcomes is found by MULTIPLYING the number of options at each stage together: if one task can be done in m ways and a second task in n ways, doing both together can be done in m×n ways.
Why Do We Need It?
This is the foundation every other counting technique in this chapter builds on — permutations and combinations are really just special, structured applications of this one simple idea.
Formula
The Fundamental Counting Principle
If one task can be done m ways and a second task n ways, both together = m × n ways
When a choice involves multiple independent stages, the total number of possible outcomes is the product of the number of options at each stage.
- m, n
- — the number of ways to complete each independent stage of the choice
When to use it: Whenever a total count is needed for a process made up of several independent stages, each with its own number of options.
Worked Example
Apply the Fundamental Counting Principle
A restaurant menu has 4 appetizers, 6 main courses, and 3 desserts. How many different 3-course meals (one from each category) are possible?
Why Does This Work?
For every single choice of appetizer, there are 6 possible mains, and for every one of those 4×6 combinations, there are 3 possible desserts — listing every combination this way naturally produces exactly 4×6×3 total combinations, with no double-counting or gaps.
Real-Life Example
Designing a secure password system
A password system requires one uppercase letter, followed by one digit, followed by one symbol.
The Fundamental Counting Principle gives the total number of possible passwords directly, by multiplying the number of choices at each of the three stages.
Practice
A password requires one letter (26 choices) followed by one digit (10 choices). How many different passwords are possible?
EasyCommon mistake
Adding the number of choices at each stage instead of multiplying them — the Fundamental Counting Principle always requires MULTIPLICATION, never addition, for independent stages.
Quick Review
- Total ways = (ways for stage 1) × (ways for stage 2) × ... for independent stages.
- This is the foundation for every counting technique in this chapter.
- Always multiply, never add, the number of choices at each stage.