The multiplication principle states that if one task can be completed in m ways and a second task in n ways, the sequence can be completed in m × n ways. This principle extends to any number of sequential tasks. It forms the foundation for all combinatorial counting problems.
Start with concrete examples like counting outfits (shirts × pants combinations) or possible routes through a grid. Then abstract to formal notation and larger problems.
The multiplication principle is the engine that drives almost all of combinatorics. It rests on one simple observation: when you make a sequence of independent choices, the total number of outcomes is the product of the number of options at each step. Suppose you're getting dressed and you have 4 shirts and 3 pairs of pants. For each of the 4 shirts, you can pair it with any of the 3 pants — so there are 4 × 3 = 12 distinct outfits. Notice that no shirt choice affects your pants options; the choices are independent, and that independence is what licenses multiplication.
The principle extends to any number of stages. If you also choose from 2 pairs of shoes, your outfit count becomes 4 × 3 × 2 = 24. The key mental move is to think of each decision as a "slot" in a sequence. How many ways can you fill the first slot? The second? The third? Then multiply. This is why counting problems are often called "filling-slots" problems — breaking a complex scenario into sequential independent choices turns a hard question into a multiplication problem.
The addition principle is the companion rule for mutually exclusive situations. If one task can be done in m ways, and a completely different task in n ways, and you're doing *one or the other* (not both), the total is m + n. Deciding when to add versus multiply is the central skill: multiply when tasks happen *sequentially* (and independently), add when they're *alternatives*. A menu with 3 appetizers and 5 entrees gives 3 × 5 = 15 meal combinations (you pick one of each), but if the restaurant has 3 meat options and 5 vegetarian options and you pick exactly one dish, you have 3 + 5 = 8 total choices.
The danger zone is problems that superficially look multiplicative but involve overlap or dependence. If counting the number of four-digit codes where no digit repeats, the first digit has 10 choices, the second has only 9 (one is used up), the third 8, and the fourth 7 — so the answer is 10 × 9 × 8 × 7. The multiplication principle still applies, but you must track how earlier choices constrain later ones. This kind of "dwindling slot" reasoning leads directly into permutations, which you'll encounter next.
This is a foundational topic with no prerequisites.
No prerequisites — this is a starting point.