Introduction
The Fundamental Counting Principle (FCP) is the foundation of all Permutation and Combination problems. It helps us find the total number of possible outcomes when there are multiple independent choices or actions.
This pattern is important because it allows us to count efficiently without listing every possible case - a crucial skill for solving complex arrangement and selection problems quickly.
Pattern: Fundamental Counting Principle (FCP)
Pattern
If one event can occur in m ways and another in n ways, then both events together can occur in m × n ways.
For more than two events, multiply the number of ways for each: Total outcomes = m × n × p × …
Step-by-Step Example
Question
A restaurant offers 3 types of starters and 4 types of main courses. In how many ways can a person choose one starter and one main course?
Solution
-
Step 1: Identify what is given.
Number of starters = 3
Number of main courses = 4 -
Step 2: Apply the Fundamental Counting Principle.
Total possible meal combinations = (Ways to choose starter) × (Ways to choose main course) -
Step 3: Substitute and calculate.
= 3 × 4 = 12 -
Final Answer:
The person can choose the meal in 12 different ways. -
Quick Check:
3 starters × 4 mains = 12 total combinations ✅
Quick Variations
1. Three or more independent choices - e.g., starter, main course, dessert → multiply all three.
2. Used in forming passwords, license plates, or outfit combinations.
3. Sometimes involves choices with restrictions (e.g., only certain digits or letters allowed).
Trick to Always Use
- Step 1: Identify the number of options for each event.
- Step 2: Multiply all possibilities (if independent).
- Step 3: Apply restrictions only after finding total combinations.
Summary
Summary
In the Fundamental Counting Principle (FCP):
- Use multiplication to count outcomes for independent choices.
- Extend the rule for any number of sequential decisions.
- FCP forms the base of permutations, combinations, and probability calculations.
