7.2: Permutations
- Use the Multiplication Rule for Counting to determine the number of permutations.
- Compute expressions containing factorials.
- Compute permutations.
- Apply permutations to solve problems.
Swimming events are some of the most popular events at the summer Olympic Games. In the finals of each event, 8 swimmers compete at the same time, making for some exciting finishes. How many different orders of finish are possible in these events? In this section, we’ll extend the Multiplication Rule for Counting to help answer questions like this one, which relate to permutations . A permutation is an ordered list of objects taken from a given population. The length of the list is given, and the list cannot contain any repeated items.
Applying the Multiplication Rule for Counting to Permutations
In the case of the swimming finals, one possible permutation of length 3 would be the list of medal winners (first, second, and third place finishers). A permutation of length 8 would be the full order of finish (first place through eighth place). Let’s use the Multiplication Rule for Counting to figure out how many of each of these permutations there are.
The final heat of Olympic swimming events features 8 swimmers (or teams of swimmers).
- How many different podium placements (first place, second place, and third place) are possible?
- How many different complete orders of finish (first place through eighth place) are possible?
- Answer
-
- Let’s start with the first place finisher. How many options are there? Since 8 swimmers are competing, there are 8 possibilities. Once that first swimmer completes the race, there are 7 swimmers left competing for second place. After the second finisher is decided, there are 6 swimmers remaining who could possibly finish in third place. Thus, there are 8 possibilities for first place, 7 for second place, and 6 for third place. The Multiplication Rule for Counting then tells us there are different ways the winners’ podium can be filled out.
- To look at the complete order of finish, we can continue the pattern we can see in part 1 of this example: There are 5 possibilities for fourth place, 4 for fifth place, 3 for sixth place, 2 for seventh place, and then just 1 swimmer is left to finish in eighth place. Using the Multiplication Rule for Counting, we see that there are possible orders of finish.
You have a hand of 5 cards (that happen to create what’s called a royal flush in the game of poker): 10\(\spadesuit\), J\(\spadesuit\), Q\(\spadesuit\), K\(\spadesuit\), and A\(\spadesuit\). Into how many different orders can you put those cards?
Factorials
The pattern we see in Example 7.4 occurs commonly enough that we have a name for it:
factorial
.
For any positive whole number
, we define the factorial of
(denoted
and read "
factorial") to be the product of every whole number less than or equal to
. We also define 0! to be equal to one. We will use factorials in a couple of different contexts, so let's get some practice doing computations with them.
Compute the following:
- Answer
-
-
There are two ways to approach this calculation. The first way is to compute the factorials first, then divide:
However, there is an easier way! You may notice in the second step that there are several terms that can be canceled; that’s always the case whenever we divide factorials. In this case, notice that we can rewrite the numerator like this:
With that in mind, we can proceed this way by canceling out the 6!:
That’s much easier!
-
Let’s approach this one using our canceling technique. When we see two factorials in either the numerator or denominator, we should focus on the larger one first. So:
Compute the following:
\(6!\)
\(\dfrac{12!}{10!}\)
\(\dfrac{8!}{4!4!}\)
Permutations
As we’ve seen, factorials can pop up when we’re computing permutations. In fact, there is a formula that we can use to make that connection explicit. Let’s define some notation first. If we have a collection of objects and we wish to create an ordered list of of the objects (where ), we’ll call the number of those permutations (read “the number of permutations of objects taken at a time”). We formalize the formula we'll use to compute permutations below.
\({ }_n P_r=\frac{n!}{(n-r)!}\)
If you wondered why we defined earlier, it was to make formulas like this one work; if we have objects and want to order all of them (so, we want the number of permutations of objects taken at a time), we get . Next, we’ll get some practice computing these permutations.
Find the following numbers:
- The number of permutations of 12 objects taken 3 at a time
- The number of permutations of 8 objects taken 5 at a time
- The number of permutations of 32 objects taken 2 at a time
- Answer
-
Find the following numbers:
The number of permutations of 6 objects taken 2 at a time
The number of permutations of 14 objects taken 4 at a time
The number of permutations of 19 objects taken 3 at a time
- A high school graduating class has 312 students. The top student is declared valedictorian, and the second-best is named salutatorian. How many possible outcomes are there for the valedictorian and salutatorian?
- In the card game blackjack, the dealer’s hand of 2 cards is dealt with 1 card faceup and 1 card facedown. If the game is being played with a single deck of (52) cards, how many possible hands could the dealer get?
- The University Combinatorics Club has 3 officers: president, vice president, and treasurer. If there are 18 members of the club, how many ways are there to fill the officer positions?
- Answer
-
- This is the number of permutations of 312 students taken 2 at a time, and .
- We want the number of permutations of 52 cards taken 2 at a time, and .
- Here we’re looking for the number of permutations of 18 members taken 3 at a time, and .
One of the big draws at this year’s state fair is the pig race. There are 15 entrants, and prizes are given to the top three finishers. How many different combinations of top-three finishes could there be?
Permutations involving relatively small sets of objects can get very big, very quickly. A standard deck contains 52 cards. So, the number of different ways to shuffle the cards—in other words, the number of permutations of 52 objects taken 52 at a time—is (written out, that’s an 8 followed by 67 zeroes). The estimated age of the universe is only about seconds. So, if a very bored all-powerful being started shuffling cards at the instant the universe began, it would have to have averaged at least shuffles per second since the beginning of time to have covered every possible arrangement of a deck of cards. That means the next time you pick up a deck of cards and give it a good shuffle, it’s almost certain that the particular arrangement you created has never been created before and likely never will be created again.
Check Your Understanding
- Compute 5!.
- Compute \(\dfrac{10!}{7!3!}\).
- Compute \(_{12}{P_3}\).
- Compute \(_8{P_4}\).
- The standard American edition of the board game Monopoly has a deck of 15 orange Chance cards. In how many different ways could the first 4 Chance cards drawn in a game appear?