# 4.4.1: Permutations

- Page ID
- 11505

Learning Objectives

In this section you will learn to

- Count the number of possible permutations (ordered arrangement) of n items taken r at a time
- Count the number of possible permutations when there are conditions imposed on the arrangements
- Perform calculations using factorials

In the previous section, we were asked to find the word sequences formed by using the letters { A, B, C } if no letter is to be repeated. The tree diagram gave us the following six arrangements.

ABC, ACB, BAC, BCA, CAB, and CBA.

Arrangements like these, where order is important and no element is repeated, are called permutations.

Definition: Permutations

A permutation of a set of elements is an ordered arrangement where each element is used once.

Example \(\PageIndex{1}\)

How many three-letter word sequences can be formed using the letters { A, B, C, D }?* *

*Solution*

There are four choices for the first letter of our word, three choices for the second letter, and two choices for the third.

4 |
3 |
2 |

Applying the multiplication axiom, we get \(4 \cdot 3 \cdot 2 = 24\) different arrangements.

Example \(\PageIndex{2}\)

How many permutations of the letters of the word ARTICLE have consonants in the first and last positions?* *

*Solution*

In the word ARTICLE, there are 4 consonants.

Since the first letter must be a consonant, we have four choices for the first position, and once we use up a consonant, there are only three consonants left for the last spot. We show as follows:

4 |
3 |

Since there are no more restrictions, we can go ahead and make the choices for the rest of the positions.

So far we have used up 2 letters, therefore, five remain. So for the next position there are five choices, for the position after that there are four choices, and so on. We get

4 |
5 |
4 |
3 |
2 |
1 |
3 |

So the total permutations are \(4 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1 \cdot 3 = 1440\).

Example \(\PageIndex{3}\)

Given five letters { A, B, C, D, E }. Find the following:

- The number of four-letter word sequences.
- The number of three-letter word sequences.
- The number of two-letter word sequences.

*Solution*

The problem is easily solved by the multiplication axiom, and answers are as follows:

- The number of four-letter word sequences is \(5 \cdot 4 \cdot 3 \cdot 2 = 120\).
- The number of three-letter word sequences is \(5 \cdot 4 \cdot 3 = 60\).
- The number of two-letter word sequences is \(5 \cdot 4 = 20\).

We often encounter situations where we have a set of n objects and we are selecting r objects to form permutations. We refer to this as **permutations**** of n objects taken r at a time**, and we write it as **nPr**.

Therefore, the above example can also be answered as listed below.

- The number of four-letter word sequences is 5P4 = 120.
- The number of three-letter word sequences is 5P3 = 60.
- The number of two-letter word sequences is 5P2 = 20.

Before we give a formula for nPr, we'd like to introduce a symbol that we will use a great deal in this as well as in the next chapter.

Definition: Factorial

\[\mathrm{n} !=\mathrm{n}(\mathrm{n}-1)(\mathrm{n}-2)(\mathrm{n}-3) \cdots 3 \cdot 2 \cdot 1\]

where \(n\) is a natural number.

\[0! = 1\]

Now we define nPr.

Definition: nPr

**The Number of Permutations of n Objects Taken r at a Time**

\[\mathrm{nPr}=\mathrm{n}(\mathrm{n}-1)(\mathrm{n}-2)(\mathrm{n}-3) \cdots(\mathrm{n}-\mathrm{r}+1)\]

or

\[\mathrm{nPr}=\frac{\mathrm{n} !}{(\mathrm{n}-\mathrm{r}) !} \]

where \(n\) and \(r\) are natural numbers.

The reader should become familiar with both formulas and should feel comfortable in applying either.

Example \(\PageIndex{4}\)

Compute the following using both formulas.

- 6P3
- 7P2

**Solution**

a. 6P3 = \(6 \cdot 5 \cdot 4 = 120\), alternately

\[ 6 \mathrm{P} 3=\frac{6 !}{(6-3) !}=\frac{6 !}{3 !}=\frac{6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1}{3 \cdot 2 \cdot 1}=120 \]

b. 7P2 = \(7 \cdot 6 = 42\), or

\[7 \mathrm{P} 2=\frac{7 !}{5 !}=\frac{7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1}{5 \cdot 4 \cdot 3 \cdot 2 \cdot 1}=42\]

Next we consider some more permutation problems to get further insight into these concepts.

Example \(\PageIndex{5}\)

In how many different ways can 4 people be seated in a straight line if two of them insist on sitting next to each other?* *

**Solution**

The four people are \(\boxed{AB}\) CD. Since \(\boxed{AB}\) is treated as one person, we have the following possible arrangements.

\[ \boxed{AB} CD, \boxed{AB} DC, C \boxed{AB}D, D\boxed{AB}C, CD \boxed{AB}, DC\boxed{AB} \nonumber\]

Note that there are six more such permutations because A and B could also be tied in the order BA. And they are

\[ \boxed{BA}CD, \boxed{BA} DC, C\boxed{BA}D, D\boxed{BA}C, CD\boxed{BA}, DC \boxed{BA} \nonumber\]

So altogether there are 12 different permutations.

Let us now do the problem using the multiplication axiom.

After we tie two of the people together and treat them as one person, we can say we have only three people. The multiplication axiom tells us that three people can be seated in 3! ways. Since two people can be tied together 2! ways, there are 3! 2! = 12 different arrangements

Example \(\PageIndex{6}\)

You have 4 math books and 5 history books to put on a shelf that has 5 slots. In how many ways can the books be shelved if the first three slots are filled with math books and the next two slots are filled with history books?* *

*Solution*

We first do the problem using the multiplication axiom.

Since the math books go in the first three slots, there are 4 choices for the first slot,

3 choices for the second and 2 choices for the third.

The fourth slot requires a history book, and has five choices. Once that choice is made, there are 4 history books left, and therefore, 4 choices for the last slot. The choices are shown below.

4 |
3 |
2 |
5 |
4 |

Therefore, the number of permutations are \(4 \cdot 3 \cdot 2 \cdot 5 \cdot 4 = 480\).

Alternately, we can see that \(4 \cdot 3 \cdot 2\) is really same as 4P3, and \(5 \cdot 4\) is 5P2.

So the answer can be written as (4P3) (5P2) = 480.

Clearly, this makes sense. For every permutation of three math books placed in the first three slots, there are 5P2 permutations of history books that can be placed in the last two slots. Hence the multiplication axiom applies, and we have the answer (4P3) (5P2).

We summarize the concepts of this section:

Note

**1. Permutations**

A permutation of a set of elements is an ordered arrangement where each element is used once.

**2. Factorial**

\[\mathrm{n} !=\mathrm{n}(\mathrm{n}-1)(\mathrm{n}-2)(\mathrm{n}-3) \cdots 3 \cdot 2 \cdot 1 \nonumber\]

Where \(n\) is a natural number.

\[0! = 1 \nonumber\]

**3. Permutations of n Objects Taken r at a Time**

\[\mathrm{nPr}=\mathrm{n}(\mathrm{n}-1)(\mathrm{n}-2)(\mathrm{n}-3) \cdots(\mathrm{n}-\mathrm{r}+1) \nonumber\]

or

\[\mathrm{nPr}=\frac{\mathrm{n} !}{(\mathrm{n}-\mathrm{r}) !} \nonumber\]

where \(n\) and \(r\) are natural numbers.