Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Solve Counting Word Problems

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. 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. 2. OrderSwap two parts of your outcome. A different outcome means order matters (permutations); the same outcome means it does not (combinations).
  3. 3. RepetitionAsk whether an item can appear twice: digits in a code can, people on a committee cannot.
  4. 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. 5. StagesSplit the outcome into stages, count each stage with its formula, and multiply; add only for separate cases that cannot happen together.
→Now solve it: How to count combinationsCount each stage with combinations or permutations; if you are not sure which, follow the counting decision tree.
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,00015{,}600{,}000.

Worked examples

Example 1 · a committee with a chair

committee
88 people: choose 33 for a committee and name one the chair
roles for one member only
chair: 88 ways; other two: (72)=21\binom{7}{2} = 21
two stages
8⋅21=1688 \cdot 21 = 168 committees
multiplication principle

Example 2 · license plates

codes
33 different letters, then 33 digits (digits may repeat)
two kinds of stage
letters: 26⋅25⋅24=15,60026 \cdot 25 \cdot 24 = 15{,}600
no repeated letter
digits: 103=100010^3 = 1000
repeats allowed
15,600⋅1000=15,600,00015{,}600 \cdot 1000 = 15{,}600{,}000 plates
multiply the stages

Example 3 · a couple sits together

seating
66 people in a row, one couple side by side
restriction
glue the couple: 55 units, 5!=1205! = 120
block counts as one
120⋅2=240120 \cdot 2 = 240 seatings
couple in either order

Example 4 · at least one defective

at least one
1212 bulbs, 33 defective; choose 44
order does not matter
all: (124)=495\binom{12}{4} = 495; no defective: (94)=126\binom{9}{4} = 126
count the opposite
495−126=369495 - 126 = 369 choices
subtract
Check each stage in the counting calculator.

See it happen

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 33 from 88: 8⋅7⋅6=3368 \cdot 7 \cdot 6 = 336
✓ members have no roles: (83)=56\binom{8}{3} = 56

Forgetting the order inside a block

✗ couple together: 5!=1205! = 120
✓ the couple can swap places: 2⋅5!=2402 \cdot 5! = 240

Counting "at least one" by fixing one

✗ at least one defective: 3⋅(113)=4953 \cdot \binom{11}{3} = 495
✓ that counts sets with two or three defectives several times; use 495−126=369495 - 126 = 369