We've updated our
Privacy Policy effective December 15. Please read our updated Privacy Policy and tap

Guides d'étude > College Algebra

Permutations

Learning Objectives

  • 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. The addition of 3 iPods and 4 iPhones.

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?

Answer: We can add the number of vegetarian options to the number of meat options to find the total number of entrée options. The addition of the type of options for an entree. There are 7 total 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?

Answer: 7

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. A tree diagram of the different menu combinations. The possible choices are:
  1. soup, chicken, cake
  2. soup, chicken, pudding
  3. soup, fish, cake
  4. soup, fish, pudding
  5. soup, steak, cake
  6. soup, steak, pudding
  7. salad, chicken, cake
  8. salad, chicken, pudding
  9. salad, fish, cake
  10. salad, fish, pudding
  11. salad, steak, cake
  12. 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. Number of appetizer options (2) times number of entree options (3) times number of dessert options (2)

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.

Answer: To find the total number of outfits, find the product of the number of skirt options, the number of blouse options, and the number of sweater options. The multiplication of number of skirt options (2) times the number of blouse options (4) times the number of sweater options (2) which equals 16. There are 16 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.

Answer: There are 60 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. Four times two blanks spots. After the first place has been filled, there are three options for the second place so we write a 3 on the second line. Four times three times one blank spot. 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.

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

Example: Finding the Number of Permutations Using the Multiplication Principle

At a swimming competition, nine swimmers compete in a race.
  1. How many ways can they place first, second, and third?
  2. 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.)
  3. How many ways can all nine swimmers line up for a photo?

Answer:

  1. Draw lines for each place.There are 9 options for first place. Once someone has won first place, there are 8 remaining options for second place. Once first and second place have been won, there are 7 remaining options for third place.Multiply to find that there are 504 ways for the swimmers to place.
  2. Draw lines for describing each place.We know Ariel must win first place, so there is only 1 option for first place. There are 8 remaining options for second place, and then 7 remaining options for third place.Multiply to find that there are 56 ways for the swimmers to place if Ariel wins first.
  3. Draw lines for describing each place in the photo.There are 9 choices for the first spot, then 8 for the second, 7 for the third, 6 for the fourth, and so on until only 1 person remains for the last spot.There are 362,880 possible permutations for the swimmers to line up.

Analysis of the Solution

Note that in part c, we found there were 9! ways for 9 people to line up. The number of permutations of [latex]n[/latex] distinct objects can always be found by [latex]n![/latex].

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?

Answer: 120

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

Answer: 60

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

Answer: 12

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]\frac{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]\frac{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]\frac{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.

Answer: There are 8 letters. Both I and T are repeated 2 times. Substitute [latex]n=8, {r}_{1}=2, [/latex] and [latex] {r}_{2}=2 [/latex] into the formula.

[latex]\frac{8!}{2!2!}=10\text{,}080 [/latex]

There are 10,080 arrangements.

Try It

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

Answer: 840

Licenses & Attributions

CC licensed content, Original

CC licensed content, Shared previously

  • College Algebra. Provided by: OpenStax Authored by: OpenStax College. Located at: https://cnx.org/contents/[email protected]:1/Preface. License: CC BY: Attribution.
  • College Algebra. Provided by: OpenStax Authored by: Abramson, Jay et al.. License: CC BY: Attribution. License terms: Download for free at http://cnx.org/contents/[email protected].
  • Question ID 7155. Authored by: unknown, mb Lippman,David, mb Sousa,James. License: CC BY: Attribution. License terms: IMathAS Community LicenseCC-BY + GPL.
  • Question ID 7164. Authored by: WebWork-Rochester. License: CC BY: Attribution. License terms: IMathAS Community License CC-BY + GPL.
  • Question ID 32832. Authored by: David Lippman. License: CC BY: Attribution. License terms: IMathAS Community License CC-BY + GPL.