Skip to Main Content

Fundamental Counting Principle


Mike McGarry
Lesson by Mike McGarry
Magoosh Expert

Summary
The Fundamental Counting Principle solves multi-step counting problems by multiplying the number of choices available at each stage. It also leads directly to counting arrangements of distinct items, where the number of choices decreases step by step as positions are filled.
  • The key idea is that whenever a task can be broken into stages, the total number of outcomes equals the product of the choices in each stage.
  • A meal-selection example shows the principle in a setting with independent choices: 4 salads, 5 appetizers, 12 entrees, and 4 desserts produce 4 × 5 × 12 × 4 = 960 possible meals.
  • An ordering example with 6 different books shows how stage-by-stage counting changes when choices are no longer independent, because each selection removes one option for the next stage.
  • Arranging 6 distinct books gives 6 × 5 × 4 × 3 × 2 × 1 = 720 orders, and this generalizes to arranging n distinct items by multiplying n by every positive integer below it.
  • A steering-committee problem reinforces that order matters when roles are different: choosing a facilitator, union rep, and secretary from 25 employees gives 25 × 24 × 23 = 13,800 outcomes.
  • Counting problems often grow very quickly, especially when order matters, so recognizing stages and deciding whether choices remain available is essential for ACT success.
Chapters
00:00
The Fundamental Counting Principle
01:00
Applying Multiplication to Independent Choices
02:13
Counting Arrangements When Choices Decrease
04:48
Using Roles to Show When Order Matters
06:45
General Rule and Takeaway for Counting Problems