Counting: The Multiplication Principle and Combinations
The shortcuts that count without listing — from outfit choices to committees
By Daon Opus · Updated September 23, 2026
My daughter has exactly three t-shirts and two pairs of shorts, and before I taught her anything she knew she could make six outfits. She didn't list them — she just knew three times two. That instinct is the multiplication principle, the quiet engine behind every "how many ways...?" question in math. Count the choices at each step, multiply them, done. When the sets get bigger — ten shirts, a starter to pick, a committee to choose — the same move still counts, as long as we learn when order makes the answer different. The probability guides draw the trees and weigh the and/or rules; this guide counts the possibilities those pages depend on — fast, no listing required.
The Multiplication Principle: Multiply the Choices
If choosing a first thing can end N ways and choosing a second thing can end M ways, the pair can end N × M ways. Three shirts and two shorts: 3 × 2 = 6 outfits. A 6-sided die followed by a coin: 6 × 2 = 12 results. Each new step multiplies whatever came before, because every earlier outcome can still pair with every later one.
Pizza night: 3 crusts × 4 sauces × 5 toppings = 60 pizzas
License plate: 26 letters × 26 letters × 10 digits = 6,760
Remember: multiple at each step, never add.
The only warning is the order of the steps. If a choice removes an option from the next step — pick a captain, then a co-captain, from five kids — the second step has one fewer option. Multiply, but keep the crowd shrinking, exactly like drawing cards without replacement.
Factorials: Ordering Everything
Line up four books on a shelf: how many orders? Four choices for the first spot, three for the second, two for the third, one left. 4 × 3 × 2 × 1 = 24. That "multiply everything down to 1" spelling is a factorial, written 4! = 24. The factorial counts orderings — the group is fixed, only the sequence changes.
5! = 5 × 4 × 3 × 2 × 1 = 120
3! = 6
A shelf with n books: n! possible orders.
Factorials grow alarmingly fast: a ten-book shelf already holds three and a half million arrangements. That explosion is exactly why the count must come from multiplication and not from a teenage finger-list — the list would never end.
When Order Matters: Permutations
The classic question: five kids, pick one as president and one as secretary. President and secretary are different jobs, so the pair (Ana, Ben) is not the same as (Ben, Ana). Order matters. Count it with the shrinking multiplication: 5 × 4 = 20. That's a permutation — an ordered pick of a smaller group out of a bigger one.
P(n, k) = n × (n − 1) × ... down to k choices
P(5, 2) = 5 × 4 = 20
Order decides everything here: same two people, different titles, different outcome. Assigning roles, arranging podium spots, seating order around a table — all permutations, all the same shrinking multiply.
When Order Doesn't Matter: Combinations
Same five kids, but now pick two for the cleanup duty — no titles, both just scrub. (Ana, Ben) is the same crew as (Ben, Ana), so the permutation overcounted by a factor of two. Divide it out and the answer drops from 20 to 10 crews.
C(n, k) = P(n, k) ÷ k!
C(5, 2) = (5 × 4) ÷ (2 × 1) = 10
The k! in the denominator is the "duplicate repeater": a crew of k comes in k! orderings, and since our crews ignore order, every k! looks the same to us. Combinations are for committees, teams, hand shakes, lottery picks — every "choose a group" where the insides are interchangeable.
The lottery is the loudest example. Pick 6 numbers from 49: C(49, 6) = 13,983,816 different tickets. Company order — which ball came out first — never mattered, so the repeats got divided out, and what remains is one number so large it explains every "why never me?" in one look.
The One Question That Picks the Tool
- Are you scoring one full arrangement of everything? Multiply down — a factorial.
- Picking a smaller group where titles matter? Ordered pick — a permutation.
- Picking a smaller group where the insides are interchangeable? Ordered pick minus the repeats — a combination.
One yes/no question — "would swapping two members change the answer?" — routes the whole problem. Swap changes it: permutation. Swap changes nothing: combination. If in doubt, ask the swap.
Slip Points That Predict Wrong Answers
- Adding the choices instead of multiplying. "3 AND 2" is multiply; "3 OR 2" is add. The suffix on that word tells the operation before any formula appears.
- Forgetting to divide by k! for combinations. A committee of Ana+Ben is one committee, not two. The k! in the denominator is not decoration.
- Reusing the same member twice. Once a person is picked, they leave the pool. Shrinking counts every step; flat counts quietly assume reuse is fine.
The swap test catches almost all of it. My own grittiest mistake was counting handshakes among six people as a permutation — 30 — before dividing by 2. Six people share 15 handshakes. The group inside doesn't have a captain.
Quick Practice Problems
- 4 tops and 3 skirts. How many outfits?
Answer: 4 × 3 = 12.
- Arrange 3 books on a shelf. How many orders?
Answer: 3! = 6.
- 4 kids; pick a captain and a co-captain?
Answer: 4 × 3 = 12 — order matters.
- 4 kids; pick a 2-person team?
Answer: (4 × 3) ÷ (2 × 1) = 6 crews.
- How many ways to choose 2 desserts from a menu of 7?
Answer: (7 × 6) ÷ (2 × 1) = 21 plates.
Frequently Asked Questions
Why is the combination formula divided by k! and not something else?
Every staff of k people can be listed in k! different orders, and to a committee those k! lines are the same team. Dividing by k! collapses all those duplicates into one.
Does this counting appear in probability?
Constantly. "How likely is this exact group drawn?" needs the count of groups first. Counting tells you the denominator of a chance; the probability rules do the rest.
Is 0! really 1?
Yes, by convention — and it makes every formula hold together. One empty shelf arrangement, one empty committee. Learning to accept 0! = 1 early saves confusion at every table.
Why do calculations explode so fast?
Because each new option multiplies everything before it. A 52-card deck has 52! ≈ 8 × 10⁶⁷ arrangements — more than atoms on Earth. Multiplication compounds, which is exactly why the principle beats listing: the list ends long before the math does.