Almost every probability calculation in this course starts by counting a sample space. Almost every sample space is built in stages: flip, then flip again, or draw a card, then draw another. The product rule and the sum rule are the two engines behind every one of those counts.
Product rule: picking an outfit from 4 shirts and 3 pants is a two-stage job. Every shirt can pair with every pair of pants, so the count is 4 \times 3 = 12 outfits. Sum rule: picking one drink from a menu with 5 sodas or 3 juices is a single choice with 8 total options. You take one path or the other, never both. Multiply when a full outcome needs every stage filled in. Add when only one branch happens at all.
Product rule. If a multi-stage choice has n_1 options for stage one, n_2 options for stage two (regardless of stage one's outcome), and so on through n_k stages, the total number of complete outcomes is n_1 \times n_2 \times \cdots \times n_k. Sum rule. If a choice is made in exactly one of k mutually exclusive ways, with n_i options in way i, the total number of outcomes is n_1 + n_2 + \cdots + n_k. The product rule counts a sequence of independent stages; the sum rule counts disjoint alternatives.
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.
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
Seating 4 distinct people in 4 distinct chairs, one per chair, is NOT a plain product-rule task because:
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.
The chairs are distinct positions -- that is exactly what makes this an ordering problem.
Order matters a great deal here -- which chair a person sits in is the whole point.
Why
Each stage's count shrinks by one as people are seated, violating the plain product rule's independence requirement -- this is a permutation, covered in Section 5.
A two-flip, then a die roll
Reveal each stage and watch the leaf count multiply — this is the product rule as a picture.
Loading interactive…
Product rule or sum rule?
Read each scenario and reason about multiply-every-stage versus add-one-branch, then compare your reasoning with the worked examples below.
Loading interactive…
Worked example
Product rule: a 4-digit passcode
-
1
A passcode uses 4 digits, each from 0-9, and digits may repeat. How many passcodes are possible?
-
2
Each of the 4 positions is its own independent stage with 10 options.
-
3\boxed{10 \times 10 \times 10 \times 10 = 10{,}000}
Worked example
Sum rule: choosing one representative
-
1
A committee has 6 students and 4 faculty. One person is chosen to speak, either a student or a faculty member. How many choices are there?
-
2
"Student or faculty" is a single choice split into two disjoint groups. Add the group sizes; don't multiply them.
-
3\boxed{6 + 4 = 10}
Worked example
Combining both rules
-
1
A password is one letter (26 choices) followed by one digit (10 choices), or two digits in a row. How many passwords are possible?
-
2
The letter-then-digit path multiplies (26 \times 10), and the two-digit path multiplies (10 \times 10). The two paths are disjoint alternatives, so their counts add.
-
3\boxed{(26 \times 10) + (10 \times 10) = 260 + 100 = 360}
Loading interactive…
Where this goes next
Chapter 1 (Sample spaces) and Chapter 2 (Counting for probability)
Every "equally likely outcomes" probability in this course is a fraction of counts. Both the numerator (favorable outcomes) and the denominator (total outcomes) are almost always found with the product rule, the sum rule, or both together. Getting the stage-by-stage structure of a problem right here is most of the work. The division at the end is the easy part.
Check your understanding (counts toward your progress)
A parking garage has 25 spots on level 1 and 30 spots on level 2 (no spot exists on both levels). In how many ways can a single car choose ONE spot to park in?
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.
750 is 25×30 — that's the product rule, which applies to combining independent stages, not choosing one spot from two disjoint groups.
25 only counts level 1's spots, ignoring level 2 entirely.
30 only counts level 2's spots, ignoring level 1 entirely.
Why
Choosing one spot from two disjoint groups (a spot is on level 1 or level 2, never both) is the sum rule: 25 + 30 = 55.
A spot is on level 1 OR level 2, never both — that's the sum rule's exact setup.
A vending machine sells snacks in 3 flavors and drinks in 4 flavors. A customer buys either one snack, one drink, or one of each (but never more than one item from either category). How many different purchases 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
There are three disjoint cases: snack only (3 ways), drink only (4 ways), or one of each (3×4=12 ways, product rule since it's two independent stages). A purchase falls into exactly one case, so add: 3 + 4 + 12 = 19.
Correct answer
Also accepted:
Why
Break this into three separate, non-overlapping cases: snack alone, drink alone, or both together — then add the counts.
The 'one of each' case uses the product rule (3 snack choices × 4 drink choices).
A vending machine offers exactly one drink, chosen from 9 teas, 2 waters, 7 juices (no drink belongs to two categories). How many total choices are there?
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
Choosing one drink from disjoint categories is a single choice split across non-overlapping groups, so the counts add: 9 + 2 + 7 = 18.
Correct answer
Also accepted:
Why
A vending machine offers exactly one drink, chosen from 2 sodas, 7 smoothies (no drink belongs to two categories). How many total choices are there?
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
Choosing one drink from disjoint categories is a single choice split across non-overlapping groups, so the counts add: 2 + 7 = 9.
Correct answer
Also accepted:
Why
Practice: Combining the product rule and the sum rule (5 problems · doesn’t affect your progress)
You're buying a sandwich: pick ONE type of bread (3 options) and ONE type of filling (5 options), always choosing both. Does counting the total sandwiches use the product rule or the sum rule?
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.
The sum rule is for choosing from disjoint alternatives (this OR that) — here you need a bread choice AND a filling choice together.
There's a shortcut here — you don't need to list every combination by hand.
The sum rule (3+5=8) and product rule (3×5=15) give different counts here — they're not interchangeable.
Why
Choosing bread AND filling together, with every combination of the two allowed, is exactly the product rule's structure: independent stages combined with AND.
Product rule
A gym locker code uses 3 digits, each digit 0-9, and digits CAN repeat. How many codes 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 of the 3 positions independently has 10 choices (repeats allowed): 10×10×10=1000.
Correct answer
Also accepted:
Why
A student must choose one elective from Group A (5 courses) or Group B (6 courses), with no course listed in both groups. How many electives could the student choose 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 groups are disjoint, so this is the sum rule: 5 + 6 = 11 total choices.
Correct answer
Also accepted:
Why
Since no course is in both groups, this is choosing from two separate, non-overlapping lists.
A restaurant's lunch special is either an 8 combo (1 of 2 sandwiches paired with 1 of 3 soups) or a 6 single dish (1 of 4 salads). How many distinct lunch orders 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
The combo has 2×3=6 options (product rule), and the salad option adds 4 more disjoint choices: 6+4=10 total.
Correct answer
Also accepted:
Why
Compute the combo count and the salad count separately (product rule inside the combo), then add them (sum rule) since an order is one or the other.
A raffle sells tickets numbered with 2 letters (A-Z) followed by 3 digits (0-9). Letters may repeat within a ticket, but the 3 digits must all be different from each other. How many distinct tickets 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
Letters: 26×26=676 (repeats allowed). Digits: 10×9×8=720 (no repeats). Multiply the two independent stages: 676×720=486,720.
Correct answer
Also accepted:
Why
Handle the letters and digits as two separate stages, and multiply the two stage totals.
Letters repeat freely (26 choices each time), but each digit position has one fewer available digit than the last since digits can't repeat.
Practice: Product rule or sum rule? Deciding first (4 problems · doesn’t affect your progress)
A task requires flipping a coin AND THEN rolling a die. Which rule finds the total number of outcomes?
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.
The sum rule is for choosing ONE of several disjoint paths — this task requires BOTH stages.
One of the two rules always applies to a clean multi-stage or multi-category count like this.
The two rules generally give different answers — picking the wrong one changes the result.
Why
Both the coin flip AND the die roll must happen — a multi-stage requirement is exactly the product rule's setup.
The product rule — both stages must happen, one after the other
A task requires choosing ONE dessert, either a cake slice (5 flavors) OR a pie slice (3 flavors), never both. Which rule applies?
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.
The product rule is for stages that must ALL happen — this task picks exactly one category, not both.
One of the two rules always applies to a clean choice between disjoint categories like this.
The rule that applies doesn't depend on which specific flavor ends up chosen.
Why
Choosing exactly one item from two disjoint categories (cake OR pie, never both) is the sum rule's setup.
The sum rule — one path from two disjoint categories, not both
A sandwich shop lets you pick ONE bread (3 options) AND ONE filling (4 options), OR instead pick from a fixed list of 2 combo specials. How many total sandwich choices are there?
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.
Adding the bread and filling COUNTS instead of multiplying them undercounts the custom-sandwich path badly.
Multiplying the combo count into the custom count treats the two paths as if both had to happen together.
This total happens to match by coincidence, but the reasoning behind it is wrong — the bread and filling should multiply, not add, before combining with the specials.
Why
Building a custom sandwich needs BOTH bread and filling chosen (product rule: 3×4=12), and a customer picks EITHER a custom sandwich OR a combo special, never both paths (sum rule: 12+2=14).
3×4 + 2 = 14 — the product rule inside one path, the sum rule combining the two paths
State the one question that most reliably decides between the product rule and the sum rule.
AI grading isn't configured on this deployment.
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.
First mistake
Correct answer
Also accepted:
Why
Why
Does completing the count require every stage to happen (multiply, product rule), or does it require choosing exactly one path out of several disjoint alternatives (add, sum rule)? Answering that question first, before reaching for a formula, prevents most counting errors.