Permutations and Combinations
A permutation counts arrangements, where order matters; a combination counts plain selections, where it doesn't. Counting in order counts every selection k! times, once for each way to line it up, so dividing by k! gives C(n, k) = P(n, k) / k!.
What the symbols mean
- Permutations
Ordered arrangements of k items chosen from n.
- Combinations
Unordered selections of k items from n, read 'n choose k'.
- Items available
How many items there are to choose from.
- Items chosen
How many are picked.
Explanation
A permutation is simply an arrangement, where order matters (who gets gold, silver and bronze), and a combination is a plain selection, where it doesn't (who's on the committee). "Permute" means to rearrange, which is where the first name comes from; "combination" just means a group put together. They're good for odds of all kinds, from lotteries to poker hands. The formulas look heavy with all the exclamation marks, but just means (every way to line up things). is lining up of them (the leftover cancels the part you don't use), and divides that by one more (because when order doesn't matter, each group was counted once per ordering). It's just the product rule plus one division.
Remember the PIN with no repeated digits from last lesson: 10 choices, then 9, then 8, then 7. The count shrinks by one at each stage because each pick uses something up. That pattern shows up so often it gets its own name.
Permutations. Hand out gold, silver and bronze among 8 runners. There are 8 choices for gold, then 7 left for silver, then 6 for bronze, so . If you keep going until everything's placed, all items in a row can be arranged in ways. The formula is just that product with the unused tail cancelled off.
Combinations. Now pick a 3-person committee from 10 people. A committee doesn't care about order: Ana, Ben, Cy is the same committee as Cy, Ana, Ben. So what can we do? Count as if order mattered, , and then think about how many times each committee got counted. Its 3 members can be lined up in orders, and the ordered count included every one of them. So each committee was counted 6 times, and .
Symmetry. Choosing people to include is the same as choosing the to leave out, so . You'll see that symmetry in the picture below.
Is order relevant? Ask whether swapping two chosen items gives a different outcome. Podium places: yes, so it's a permutation. A hand of cards: no, so it's a combination. A lottery ticket: no, which is why the odds of choosing 6 numbers from 49 are 1 in .
A common mistake. It's tempting to use a combination whenever a problem says "choose," because that's the word in "n choose k." It isn't the word that decides, it's whether order changes the outcome. "Choose a president and a treasurer" gives different outcomes when you swap the two people, so that's a permutation even though it says "choose."
See it
Worked examples
How many ways can a club of 12 choose a president, a treasurer and a 3-person events team (from the remaining members)?
- 1
President and treasurer are different jobs, so swapping two people changes the outcome. That's a permutation: .
Practice
Type your answer and check it. Solve them all to complete the lesson.
How many ways can 8 runners finish first, second and third?
How many 3-person committees can be chosen from 10 people?
In how many ways can the letters of MATH be arranged?
A lottery draws 6 numbers from 49. How many different tickets are possible?
How many different 5-card poker hands can be dealt from a standard 52-card deck?
How many 10-bit strings contain exactly four 1s?
The hardest one here. Get it, and you've got this lesson.
How many 5-card poker hands are a full house: three cards of one rank and two of another?
Where it's used
Lottery odds, poker hand probabilities and the number of possible test schedules are all counted with permutations and combinations.