If an event can occur in m different ways, following which another event can occur in n different ways, then the two events in that order can occur in m × n ways. For three events with m, n and p ways, the count is m × n × p, and so on.
Counting by filling places
- Draw the places One box for each position to be filled.
- Fill restricted places first Units digit, first letter, and so on.
- Write the number of choices in each box Allow for repetition or not.
- Multiply By the fundamental principle.
| Situation | Choices | Count |
|---|---|---|
| 4 kurtas, 3 dupattas | 4 × 3 | 12 |
| 3-letter words from 5 letters, no repeats | 5 × 4 × 3 | 60 |
| 3-letter words from 5 letters, repeats allowed | 5 × 5 × 5 | 125 |
| 3-digit odd numbers from 1-6, repeats allowed | 3 × 6 × 6 | 108 |
| 4 coin tosses | 2 × 2 × 2 × 2 | 16 |
Key takeaways: when choices are made one after another, multiply the number of ways at each stage. Without repetition the number of choices falls by one at each stage; with repetition it stays the same. Fill restricted places first, and add the counts of separate cases.