Decide whether order matters and whether repetition is allowed before choosing a counting formula. The same objects can give different counts under different rules.
Where this helps
Distinguishing selections where order matters from those where it does not.
Before you start
Try the examples to see what you’ll practice. Check the answer form and any stated conditions.
Choose 2 people from 7. There are 7 × 6 ordered choices, but each pair is counted twice.
C(7, 2) = (7 × 6)/2 = 21.
When order does not matter and nobody is chosen twice, use C(n, r) = n!/(r!(n − r)!). The symbol ! means factorial, the product of positive integers down to 1, with 0! = 1. Use integers 0 ≤ r ≤ n. Choosing nobody or choosing everyone each has one possible group.
Count ordered selections
Choose a first, second, and third place from 5 different runners.
5 × 4 × 3 = 60 possible orders.
With no replacement, each choice leaves one fewer option. For r ordered selections from n distinct objects, use n!/(n − r)!, with integers 0 ≤ r ≤ n. Do not divide by r!, because changing the order gives a different result. Selecting nobody gives one empty ordering.
Multiply the numbers of choices
Choose 1 of 3 shirts and 1 of 4 hats.
3 × 4 = 12 outfits.
If a first choice has m options and every first choice allows n second options, there are mn ordered pairs. If the number of second options changes with the first choice, count those branches separately and add them.
Try a few examples
Real practice. Real progress.
Example 1 of 3
complete the combination formula
n and r are integers with 0 <= r <= n and factorial uses nonnegative-integer arguments.