Fundamental Principle of Counting: Explained with Examples

The fundamental principle of counting says that if one task can be done in m ways and, after it, a second task can be done in n ways, then the two tasks together can be done in m × n ways. This is the multiplication rule, and it extends to any number of stages: multiply the number of choices at each stage.

This matters because nearly every counting problem — number of PINs, passwords, seating plans, or card hands — is solved by breaking it into stages and multiplying. It is the single most-used tool in combinatorics and the foundation of all probability calculations.

Key Concepts

• Multiplication principle (AND rule): if all stages must happen together, multiply the choices: m × n.
• Addition principle (OR rule): if exactly one of several alternatives happens, add the choices: m + n.
• Stage: one step of the task, such as "choose the first digit".
• Independent choices: the number of choices at a later stage does not depend on earlier selections (unless stated otherwise).

How It Works

1. Break the task into clear stages, one for each decision or slot.
2. Count how many choices are available at the first stage.
3. Count how many choices are available at each later stage, checking whether repetition is allowed.
4. If every stage must happen (an AND situation), multiply all the counts.
5. If the task is one of several mutually exclusive alternatives (an OR situation), add the counts instead.

Worked Example

How many 3-digit numbers can be formed from the digits {1, 2, 3, 4, 5} if digits cannot be repeated? Treat the number as three stages: hundreds, tens, units. The hundreds digit has 5 choices. With no repetition, the tens digit then has 4 choices, and the units digit has 3 choices. All three stages must happen, so multiply: 5 × 4 × 3 = 60. If repetition were allowed, each stage would have 5 choices, giving 5 × 5 × 5 = 125 numbers.

Common Misconceptions

• "Add the choices instead of multiplying." Wrong — adding applies only to OR alternatives. When stages combine, multiply.
• "Repetition does not change anything." Wrong — as the example shows, 60 becomes 125 when repetition is allowed. Always check the repetition rule.
• "The stages can overlap." Wrong — each stage must be a distinct decision; double-counting happens when stages are not cleanly separated.

Real-World Applications

• Passwords and PINs: counting how many codes are possible for a given length.
• Licence plates and phone numbers: counting registrations under format rules.
• Probability: finding the size of the sample space before computing any probability.
• Menus and outfits: counting combinations of independent choices in everyday decisions.

The fundamental principle of counting is simple but powerful: break the task into stages, count the choices at each stage, multiply when they combine and add when they are alternatives. Get this reflex right, and every harder counting formula becomes easy.