### Learning Outcomes

- Use the addition principle to determine the total number of options for a given scenario.
- Use the multiplication principle to find the number of permutation of n distinct objects.
- Find the number of permutations of n distinct objects using a formula.
- Find the Number of Permutations of n Non-Distinct Objects.

## Using the Addition Principle

The company that sells customizable cases offers cases for tablets and smartphones. There are 3 supported tablet models and 5 supported smartphone models. The **Addition Principle** tells us that we can add the number of tablet options to the number of smartphone options to find the total number of options. By the Addition Principle there are 8 total options.

### A General Note: The Addition Principle

According to the **Addition Principle**, if one event can occur in [latex]m[/latex] ways and a second event with no common outcomes can occur in [latex]n[/latex] ways, then the first *or* second event can occur in [latex]m+n[/latex] ways.

### Example: Using the Addition Principle

There are 2 vegetarian entrée options and 5 meat entrée options on a dinner menu. What is the total number of entrée options?

### Try It

A student is shopping for a new computer. He is deciding among 3 desktop computers and 4 laptop computers. What is the total number of computer options?

## Using the Multiplication Principle

The **Multiplication Principle** applies when we are making more than one selection. Suppose we are choosing an appetizer, an entrée, and a dessert. If there are 2 appetizer options, 3 entrée options, and 2 dessert options on a fixed-price dinner menu, there are a total of 12 possible choices of one each as shown in the tree diagram.

The possible choices are:

- soup, chicken, cake
- soup, chicken, pudding
- soup, fish, cake
- soup, fish, pudding
- soup, steak, cake
- soup, steak, pudding
- salad, chicken, cake
- salad, chicken, pudding
- salad, fish, cake
- salad, fish, pudding
- salad, steak, cake
- salad, steak, pudding

We can also find the total number of possible dinners by multiplying.

We could also conclude that there are 12 possible dinner choices simply by applying the Multiplication Principle.

### A General Note: The Multiplication Principle

According to the **Multiplication Principle**, if one event can occur in [latex]m[/latex] ways and a second event can occur in [latex]n[/latex] ways after the first event has occurred, then the two events can occur in [latex]m\times n[/latex] ways. This is also known as the **Fundamental Counting Principle**.

### Example: Using the Multiplication Principle

Diane packed 2 skirts, 4 blouses, and a sweater for her business trip. She will need to choose a skirt and a blouse for each outfit and decide whether to wear the sweater. Use the Multiplication Principle to find the total number of possible outfits.

### Try It

A restaurant offers a breakfast special that includes a breakfast sandwich, a side dish, and a beverage. There are 3 types of breakfast sandwiches, 4 side dish options, and 5 beverage choices. Find the total number of possible breakfast specials.

The Multiplication Principle can be used to solve a variety of problem types. One type of problem involves placing objects in order. We arrange letters into words and digits into numbers, line up for photographs, decorate rooms, and more. An ordering of objects is called a **permutation**.

## Finding the Number of Permutations of *n* Distinct Objects Using the Multiplication Principle

To solve permutation problems, it is often helpful to draw line segments for each option. That enables us to determine the number of each option so we can multiply. For instance, suppose we have four paintings, and we want to find the number of ways we can hang three of the paintings in order on the wall. We can draw three lines to represent the three places on the wall.

There are four options for the first place, so we write a 4 on the first line.

After the first place has been filled, there are three options for the second place so we write a 3 on the second line.

After the second place has been filled, there are two options for the third place so we write a 2 on the third line. Finally, we find the product.

There are 24 possible permutations of the paintings.

### How To: Given [latex]n[/latex] distinct options, determine how many permutations there are.

- Determine how many options there are for the first situation.
- Determine how many options are left for the second situation.
- Continue until all of the spots are filled.
- Multiply the numbers together.

### Example: Finding the Number of Permutations Using the Multiplication Principle

At a swimming competition, nine swimmers compete in a race.

- How many ways can they place first, second, and third?
- How many ways can they place first, second, and third if a swimmer named Ariel wins first place? (Assume there is only one contestant named Ariel.)
- How many ways can all nine swimmers line up for a photo?

### Try It

A family of five is having portraits taken. Use the Multiplication Principle to find the following.

How many ways can the family line up for the portrait?

How many ways can the photographer line up 3 family members?

How many ways can the family line up for the portrait if the parents are required to stand on each end?

## Finding the Number of Permutations of *n* Distinct Objects Using a Formula

For some permutation problems, it is inconvenient to use the Multiplication Principle because there are so many numbers to multiply. Fortunately, we can solve these problems using a formula. Before we learn the formula, let’s look at two common notations for permutations. If we have a set of [latex]n[/latex] objects and we want to choose [latex]r[/latex] objects from the set in order, we write [latex]P\left(n,r\right)[/latex]. Another way to write this is [latex]{}_{n}{P}_{r}[/latex], a notation commonly seen on computers and calculators. To calculate [latex]P\left(n,r\right)[/latex], we begin by finding [latex]n![/latex], the number of ways to line up all [latex]n[/latex] objects. We then divide by [latex]\left(n-r\right)![/latex] to cancel out the [latex]\left(n-r\right)[/latex] items that we do not wish to line up.

Let’s see how this works with a simple example. Imagine a club of six people. They need to elect a president, a vice president, and a treasurer. Six people can be elected president, any one of the five remaining people can be elected vice president, and any of the remaining four people could be elected treasurer. The number of ways this may be done is [latex]6\times 5\times 4=120[/latex]. Using factorials, we get the same result.

[latex]\dfrac{6!}{3!}=\dfrac{6\cdot 5\cdot 4\cdot 3!}{3!}=6\cdot 5\cdot 4=120[/latex]

There are 120 ways to select 3 officers in order from a club with 6 members. We refer to this as a permutation of 6 taken 3 at a time. The general formula is as follows.

[latex]P\left(n,r\right)=\dfrac{n!}{\left(n-r\right)!}[/latex]

Note that the formula stills works if we are choosing __all__ [latex]n[/latex] objects and placing them in order. In that case we would be dividing by [latex]\left(n-n\right)![/latex] or [latex]0![/latex], which we said earlier is equal to 1. So the number of permutations of [latex]n[/latex] objects taken [latex]n[/latex] at a time is [latex]\frac{n!}{1}[/latex] or just [latex]n!\text{.}[/latex]

### A General Note: Formula for Permutations of *n* Distinct Objects

Given [latex]n[/latex] distinct objects, the number of ways to select [latex]r[/latex] objects from the set in order is

[latex]P\left(n,r\right)=\dfrac{n!}{\left(n-r\right)!}[/latex]

### How To: Given a word problem, evaluate the possible permutations.

- Identify [latex]n[/latex] from the given information.
- Identify [latex]r[/latex] from the given information.
- Replace [latex]n[/latex] and [latex]r[/latex] in the formula with the given values.
- Evaluate.

### Example: Finding the Number of Permutations Using the Formula

A professor is creating an exam of 9 questions from a test bank of 12 questions. How many ways can she select and arrange the questions?

### Q & A

#### Could we have solved using the Multiplication Principle?

*Yes. We could have multiplied* [latex]15\cdot 14\cdot 13\cdot 12\cdot 11\cdot 10\cdot 9\cdot 8\cdot 7\cdot 6\cdot 5\cdot 4[/latex] *to find the same answer*.

### Try It

A play has a cast of 7 actors preparing to make their curtain call. Use the permutation formula to find the following.

How many ways can the 7 actors line up?

How many ways can 5 of the 7 actors be chosen to line up?

## Finding the Number of Permutations of n Non-Distinct Objects

We have studied permutations where all of the objects involved were distinct. What happens if some of the objects are indistinguishable? For example, suppose there is a sheet of 12 stickers. If all of the stickers were distinct, there would be [latex]12![/latex] ways to order the stickers. However, 4 of the stickers are identical stars, and 3 are identical moons. Because all of the objects are not distinct, many of the [latex]12![/latex] permutations we counted are duplicates. The general formula for this situation is as follows.

[latex]\dfrac{n!}{{r}_{1}!{r}_{2}!\dots {r}_{k}!}[/latex]

In this example, we need to divide by the number of ways to order the 4 stars and the ways to order the 3 moons to find the number of unique permutations of the stickers. There are [latex]4![/latex] ways to order the stars and [latex]3![/latex] ways to order the moon.

[latex]\dfrac{12!}{4!3!}=3\text{,}326\text{,}400[/latex]

There are 3,326,400 ways to order the sheet of stickers.

### A General Note: Formula for Finding the Number of Permutations of *n* Non-Distinct Objects

If there are [latex]n[/latex] elements in a set and [latex]{r}_{1}[/latex] are alike, [latex]{r}_{2}[/latex] are alike, [latex]{r}_{3}[/latex] are alike, and so on through [latex]{r}_{k}[/latex], the number of permutations can be found by

[latex]\dfrac{n!}{{r}_{1}!{r}_{2}!\dots {r}_{k}!}[/latex]

### Example: Finding the Number of Permutations of *n* Non-Distinct Objects

Find the number of rearrangements of the letters in the word DISTINCT.

### Try It

Find the number of rearrangements of the letters in the word CARRIER.