Are these separate cases?
If you are counting one valid outcome from several non-overlapping buckets, you usually add.
Are these separate cases?
If you are counting one valid outcome from several non-overlapping buckets, you usually add.
Are these stages of one process?
If you make one choice and then another, you usually multiply.
How many ways can you choose a dessert if the menu offers 4 cakes or 3 ice creams, and you choose exactly one dessert?
Quick check. If there are 5 teas or 4 coffees and you choose exactly one drink, how many choices are there?
Answer: 9.
How many 3-character codes can be made from 2 letters followed by 1 digit, if letters can be A, B, or C and digits can be 0 through 9?
Quick check. If you have 4 shirts and 6 hats, how many shirt-hat outfits can you make?
Answer: 24.
Permutations
If you line things up, assign ranks, or care who sits where, order matters.
Use P(n, r) = n! / (n-r)!.
Combinations
If you just pick a group and swapping names changes nothing, order does not matter.
Use C(n, r) = n! / (r!(n-r)!).
Suppose 5 students are available.
P(5,2) = 5 × 4 = 20.C(5,2) = 10.Same people, same number chosen, different answer, because the structure of the task changed.
Quick check. From 5 players, how many 3-player teams can you choose?
Answer: 10.
That little bit of friction is useful. It builds storage strength, not just recognition.
Read the counting section in Discrete Mathematics: An Open Introduction for a clear textbook treatment, then dip into the MIT notes when you want a denser reference.
If any example felt shaky, ask me about it. I can generate more practice, explain why a method fits, or build the next lesson from where you got stuck.
Next: Counting cheat sheet