A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
The addition rule states that if two tasks are mutually exclusive, they can be performed in m + n ways total. The multiplication rule states that if task A can be done in m ways and task B in n ways independently, both can be done in m × n ways. These two principles are the foundation of systematic counting in combinatorics. Together with permutations and combinations, they handle the vast majority of counting problems encountered in discrete mathematics.
Start with concrete examples: how many ways to travel from city A to C via B if there are 3 roads A→B and 4 roads B→C? Build intuition before formalizing. Have students categorize problems as 'OR situations' (addition) or 'AND sequences' (multiplication).
The two fundamental counting rules — addition and multiplication — are deceptively simple but underlie virtually all of combinatorics. The key to applying them correctly is recognizing the structure of the counting problem before doing any arithmetic.
The multiplication rule applies when you are completing a sequence of tasks one after another, and the tasks are independent. If task A can be done in m ways and task B in n ways, and the choice for B doesn't affect the number of options for A (or vice versa), then both together can be done in m × n ways. The intuition: for each of the m ways to do A, there are n ways to do B, giving m groups of n — hence m × n total. Selecting a username AND a password, filling 5 character slots in sequence, dealing cards to multiple players — these are all AND structures.
The addition rule applies when you are choosing exactly one option from among several mutually exclusive alternatives. If you can accomplish a goal in m ways via route 1, or in n ways via route 2, and these routes are mutually exclusive (doing one precludes the other), then the total is m + n. The intuition: the two groups of outcomes don't overlap, so they can be combined by counting each group and adding. Choosing between taking bus OR train, selecting a dish from one category OR another — these are OR structures.
Most real problems combine both rules in layers. A system might require choosing one of three protocols (OR, so add) and then assigning independent credentials for each (AND within each branch, so multiply within each branch, then add the results). The discipline is to decompose the problem into its OR and AND structure before applying any numbers. Asking "am I choosing one thing from alternatives, or completing all tasks in sequence?" at each step will resolve the vast majority of add-vs-multiply decisions.
One important caveat: the multiplication rule requires that the number of options for later steps does not depend on the choices made in earlier steps. If you are selecting 3 people from a group of 10 without replacement, the choices are not independent (10, then 9, then 8), and you must account for this explicitly — which is where permutations and combinations come in.