Every counting argument in this course eventually reduces to one of two moves: multiply across independent stages, or add across disjoint alternatives. Getting comfortable spotting which move a problem calls for — often both, in the same problem — is worth a fast refresher before anything more elaborate gets built on top of it.
Ask one question at every step. Is this an "and" or an "or"? A meal needing a drink and a side multiplies. A trip by train or by bus, never both, adds. Most real problems ask that question more than once. Get the drink-and-side stage right first. Then notice the whole trip is itself one option in a bigger "or." People sometimes call this "the counting principle" as if it were one single rule. It really means two short steps. Add up any stage that splits into non-overlapping choices first. Then multiply those per-stage counts together.
The product rule multiplies option counts across stages that don't restrict each other; the sum rule adds counts across mutually exclusive methods, ones where no single outcome can satisfy more than one method at once. The two rarely appear alone. A menu with 3 appetizers and either 4 meat entrées or 2 vegetarian entrées needs the sum rule first — 4+2=6 entrée choices, since no entrée is both — and then the product rule to combine that with the appetizer stage: 3 \cdot 6 = 18. The two rules together are sometimes bundled under one name, the fundamental counting principle: multiply the sizes of every independent stage, and whenever a stage itself splits into disjoint sub-cases, add those sub-case counts first before treating the whole stage as one number. Misreading which rule a step needs is the single most common counting error this course will spend Chapter 1 building habits against.
Quick review
Practice from earlier coursework, pulled in for this topic.
From Discrete Mathematics I — Logic, Proof, and Structure
A task's product-rule count is only valid when...
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Stages can have different option counts entirely -- that is not the requirement.
The rule generalizes to any number of stages, not just two.
Why
Independence of each stage's count from earlier choices is the entire requirement for the product rule.
From Discrete Mathematics I — Logic, Proof, and Structure
A coin is flipped 4 times. How many distinct outcome sequences are possible?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
Each flip has 2 outcomes, independent of the others: 2 to the 4th power equals 16.
Correct answer
Also accepted:
Why
Quick review
Practice from earlier coursework, pulled in for this topic.
From Discrete Mathematics I — Logic, Proof, and Structure
A store has 18 novels and 12 short-story collections, with no title in both categories. How many books can a customer pick from?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
The two categories are disjoint, so their counts add directly: 18 plus 12 equals 30.
Correct answer
Also accepted:
Why
From Discrete Mathematics I — Logic, Proof, and Structure
A deck's 13 hearts and 12 face cards overlap (the jack, queen, king of hearts are both). Counting "hearts or face cards" as 13+12 is:
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Check whether any card belongs to both categories -- if so, plain addition overcounts it.
Why
The three heart face cards belong to both groups, so plain addition double-counts them -- the sum rule needs disjoint groups.
Theorem
The Fundamental Counting Principle
Recalled from College Algebra · Counting, permutations, combinations, and probability — first taught there.
If one choice can be made in m ways, and a second, independent choice can be made in n ways, then the two choices together can be made in m \times n ways. More generally, for a sequence of k independent choices with n_1, n_2, \ldots, n_k options respectively, the total number of outcomes is n_1 \times n_2 \times \cdots \times n_k.
This isn't really a theorem to prove so much as a fact to see. Lay the first choice's m options down the rows of a grid and the second choice's n options across the columns. Every cell of that grid is exactly one valid pairing — one option from the first choice matched with one option from the second — and every valid pairing lands in exactly one cell. A grid with m rows and n columns has m \times n cells. Counting the pairings and counting the cells are the same question, so they have the same answer. Chaining a third independent choice onto the pair just replaces each cell of that grid with a fresh n_3-row stack, and multiplication absorbs each new stage the same way.
A two-stage, then a three-stage count
Reveal each level of the tree and confirm the leaf count matches the product of the branching factors.
Loading interactive…
Worked example
Combining sum and product in one problem
-
1
A café serves a lunch special that is one drink from 3 options, plus one of either 2 hot sandwiches or 5 cold sandwiches. How many lunch specials exist?
-
2
The sandwich stage is an "or" between two disjoint groups — a sandwich is never both hot and cold — so add first: 2+5=7 sandwich choices.
-
3
The drink stage and the (now single) sandwich stage are independent, so multiply: 3 \cdot 7.
-
4\boxed{21 \text{ lunch specials}}
Loading interactive…
Worked example
Spotting the hidden sum inside a product
-
1
A 4-digit code's first digit must be odd, and the other three digits are unrestricted. Is this a single product, or does it hide a sum too?
-
2
"First digit is odd" is itself one stage with a fixed count — 5 odd digits — so it's a plain 4-stage product, no hidden sum: 5 options for digit one, 10 each for the rest.
-
3
Multiply straight across: 5 \cdot 10 \cdot 10 \cdot 10.
-
4\boxed{5000 \text{ codes}}
Contrast this with "first digit is odd OR the code is a palindrome" — that version genuinely needs the sum rule, since a code can satisfy both conditions and must not be counted twice.
Loading interactive…
Where this goes next
Algorithm analysis
Every "how many operations does this loop nest run" question in an algorithms course is this same pair of rules in disguise: nested loops multiply their iteration counts (a product-rule stage each), and an if/else branch that runs one block or the other adds the two blocks' costs as disjoint cases. Confusing the two — adding when the loops are actually nested, or multiplying two branches that never both execute — produces a complexity estimate that's wrong by an entire factor, not just a rounding error.
Check your understanding (counts toward your progress)
A quiz has 4 true/false questions. Using the product rule, how many distinct answer sheets are possible?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
That's 4 times 2, not each question's 2 options multiplied across all 4 questions.
That only counts one question's options, ignoring the other three stages.
Why
Each of the 4 questions independently has 2 options: 2 x 2 x 2 x 2 = 16.
Multiply the number of options per question by itself once for every question, not by the number of questions.
A committee seat goes to one of 5 senior members or one of 9 junior members, never both. How many people could fill the seat?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
Mutually exclusive groups add: 5 + 9 = 14.
Correct answer
Also accepted:
Why
Check whether any one person could count toward both groups at once -- disjoint groups combine by adding, not multiplying.
Which task does NOT satisfy the product rule's independence requirement?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Coin and die outcomes never restrict each other -- independent.
Every tie is available regardless of which shirt was picked -- independent.
Why
Dealing without replacement means the second card's options depend on which card was dealt first -- the count shrinks, violating independence.
For each option, ask whether making the first choice ever shrinks or changes the choices available for the second.
A student picks one elective from either 4 art classes or 6 music classes, never both. Which rule finds the total number of choices?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Multiplying treats this as an AND (art and music both chosen), but the student picks only one elective.
Why
The two groups are mutually exclusive alternatives -- an OR -- so the sum rule adds them: 4 + 6 = 10.
Practice: The product rule and the sum rule, side by side (5 problems · doesn’t affect your progress)
A cafe's lunch special is one soup OR one sandwich, never both, chosen from 3 soups and 5 sandwiches -- and separately, a drink chosen from 4 options is added to every order. Which combination of rules finds the total number of possible lunch orders?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Soup-or-sandwich needs the sum rule since they're mutually exclusive, but the drink is a separate additional stage -- it needs to be multiplied in, not added.
Multiplying the soup and sandwich counts treats them as two independent stages chosen together, but the order is one OR the other, never both.
The drink stage isn't exclusive with the soup-or-sandwich stage -- every order gets a drink AND (soup or sandwich) -- so the drink multiplies in, not adds.
Why
The soup-or-sandwich choice is mutually exclusive (sum rule: 3+5=8 options), and a drink is chosen independently on top of that (product rule): 8 * 4 = 32 possible orders.
Sum rule for the soup-or-sandwich choice, then product rule to bring in the drink: (3+5) * 4
A car comes in 6 colors and 3 trim levels, every color available with every trim. How many color-trim combinations exist?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
Two independent stages multiply: 6 times 3 equals 18.
Correct answer
Also accepted:
Why
A committee seat goes to one of 5 senior members or one of 9 junior members, never both. How many people could fill the seat?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
Mutually exclusive groups add: 5 + 9 = 14.
Correct answer
Also accepted:
Why
Check whether any one person could count toward both groups at once -- disjoint groups combine by adding, not multiplying.
A license plate uses 2 letters (from 26) followed by 3 digits (from 10), every position independent of the others. How many license plates are possible?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
Five independent stages multiply: 26 * 26 * 10 * 10 * 10 = 676,000.
Correct answer
Also accepted:
Why
Multiply the option counts for all five independent positions together, in any order.
Of a class's 20 students, 8 play soccer and 5 play tennis; 2 students play both sports. A student claims the number playing soccer or tennis is 8 + 5 = 13. What's wrong with applying the sum rule here?
Right on try — credit. Right — the answer had already been shown, so no credit this time. Next try is worth Answer shown after three tries — this one no longer earns credit. You chose to see the answer — this one earns no credit.
Why
8+5 counts the 2 students who play both sports twice. The sum rule needs disjoint groups; here, inclusion-exclusion (8+5-2=11) is needed instead.
The sum rule's requirement isn't just 'two groups' -- recheck exactly what condition those groups must satisfy before their counts can be added.
Trace what happens to one of the 2 students who plays both sports when the two counts are simply added -- how many times does that student get tallied?
The two groups overlap (2 students play both), so the sum rule doesn't apply directly -- those 2 get double-counted