A counting word problem hides a formula behind a story. Decide what one outcome looks like, whether its order matters and whether items can repeat; the rest is one of the standard counts, often several of them joined by the multiplication principle.
Recognize the problem
Trigger words: how many ways, how many different, arrangements, committee, code, password, license plate, seated, at least one, together. The answer is a whole number of outcomes, not a probability.
Set it up
1. One outcomeWrite one possible outcome in full, for example "Ana chair, with Ben and Cy" or "QXT 042". It shows exactly what is being counted.
2. OrderSwap two parts of your outcome. A different outcome means order matters (permutations); the same outcome means it does not (combinations).
3. RepetitionAsk whether an item can appear twice: digits in a code can, people on a committee cannot.
4. RestrictionsMark fixed positions, people who must sit together (glue them into one block), and "at least one" conditions (count the opposite and subtract).
5. StagesSplit the outcome into stages, count each stage with its formula, and multiply; add only for separate cases that cannot happen together.
Interpret the result. The answer is a number of outcomes, so it must be a whole number. Check it against a rough bound: it cannot exceed the count with no restrictions. For a small version of the problem, list the outcomes to see that none is missing or counted twice. Write large counts with separators, such as 15,600,000.
Worked examples
Example 1 · a committee with a chair
committee
8 people: choose 3 for a committee and name one the chair
roles for one member only
chair: 8 ways; other two: (27)=21
two stages
8⋅21=168 committees
multiplication principle
Example 2 · license plates
codes
3 different letters, then 3 digits (digits may repeat)
Picture one outcome as a row of boxes to fill. Each box is a stage with its own number of choices, and the multiplication principle multiplies the boxes. A box that holds a group rather than a single item is filled with a combination. The examples above all fit this picture: a chair box and a two-member box, six plate boxes, five seating units plus the couple order, and one bulb box counted from its opposite.
Common mistakes
Order where there is none
✗committee of 3 from 8: 8⋅7⋅6=336
✓members have no roles: (38)=56
Forgetting the order inside a block
✗couple together: 5!=120
✓the couple can swap places: 2⋅5!=240
Counting "at least one" by fixing one
✗at least one defective: 3⋅(311)=495
✓that counts sets with two or three defectives several times; use 495−126=369