{"id":459,"date":"2019-07-15T22:45:16","date_gmt":"2019-07-15T22:45:16","guid":{"rendered":"https:\/\/courses.lumenlearning.com\/waymakercollegealgebracorequisite\/chapter\/finding-the-number-of-permutations-of-n-distinct-objects\/"},"modified":"2019-07-15T22:45:16","modified_gmt":"2019-07-15T22:45:16","slug":"finding-the-number-of-permutations-of-n-distinct-objects","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/chapter\/finding-the-number-of-permutations-of-n-distinct-objects\/","title":{"raw":"Permutations","rendered":"Permutations"},"content":{"raw":"\n<div class=\"textbox learning-objectives\">\n<h3>Learning Outcomes<\/h3>\n<ul>\n \t<li>Use the addition principle to determine the total number of options&nbsp;for a given scenario.<\/li>\n \t<li>Use the multiplication principle to find the number of permutation of n distinct objects.<\/li>\n \t<li>Find the number of permutations of n distinct objects using a formula.<\/li>\n \t<li>Find the Number of Permutations of n Non-Distinct Objects.<\/li>\n<\/ul>\n<\/div>\n\n<div class=\"textbox examples\">\n<h3>tip for success<\/h3>\nIt is important to try each of the examples in this section on paper and on your calculator as indicated to build up a good intuition for basic counting principles. The principles may seem fairly straightforward as you read through them, but future concepts will be more challenging without a good understanding of these.\n\n<\/div>\n<h2>Using the Addition Principle<\/h2>\nThe company that sells customizable cases offers cases for tablets and smartphones. There are 3 supported tablet models and 5 supported smartphone models. The <strong>Addition Principle<\/strong> 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.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231533\/CNX_Precalc_Figure_11_05_001n2.jpg\" alt=\"The addition of 3 iPods and 4 iPhones.\" width=\"487\" height=\"358\">\n<div class=\"textbox\">\n<h3>A General Note: The Addition Principle<\/h3>\nAccording to the <strong>Addition Principle<\/strong>, 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 <em>or<\/em> second event can occur in [latex]m+n[\/latex] ways.\n\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Using the Addition Principle<\/h3>\nThere are 2 vegetarian entr\u00e9e options and 5 meat entr\u00e9e options on a dinner menu. What is the total number of entr\u00e9e options?\n\n[reveal-answer q=\"477104\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"477104\"]\n\nWe can add the number of vegetarian options to the number of meat options to find the total number of entr\u00e9e options.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231539\/CNX_Precalc_Figure_11_05_0022.jpg\" alt=\"The addition of the type of options for an entree.\">\n\nThere are 7 total options.\n\n[\/hidden-answer]\n\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\nA 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?\n\n[reveal-answer q=\"856363\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"856363\"]\n\n7\n\n[\/hidden-answer]\n\n<\/div>\n<h2>Using the Multiplication Principle<\/h2>\nThe <strong>Multiplication Principle<\/strong> applies when we are making more than one selection. Suppose we are choosing an appetizer, an entr\u00e9e, and a dessert. If there are 2 appetizer options, 3 entr\u00e9e 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.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231541\/CNX_Precalc_Figure_11_05_0032.jpg\" alt=\"A tree diagram of the different menu combinations.\" width=\"975\" height=\"287\">\n\nThe possible choices are:\n<ol>\n \t<li>soup, chicken, cake<\/li>\n \t<li>soup, chicken, pudding<\/li>\n \t<li>soup, fish, cake<\/li>\n \t<li>soup, fish, pudding<\/li>\n \t<li>soup, steak, cake<\/li>\n \t<li>soup, steak, pudding<\/li>\n \t<li>salad, chicken, cake<\/li>\n \t<li>salad, chicken, pudding<\/li>\n \t<li>salad, fish, cake<\/li>\n \t<li>salad, fish, pudding<\/li>\n \t<li>salad, steak, cake<\/li>\n \t<li>salad, steak, pudding<\/li>\n<\/ol>\nWe can also find the total number of possible dinners by multiplying.\n\nWe could also conclude that there are 12 possible dinner choices simply by applying the Multiplication Principle.\n<a href=\"https:\/\/courses.candelalearning.com\/precalctwo1xmaster\/wp-content\/uploads\/sites\/923\/2015\/10\/Screen-Shot-2015-10-22-at-10.01.45-AM.png\"><img class=\"aligncenter wp-image-12344 size-full\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231543\/Screen-Shot-2015-10-22-at-10.01.45-AM.png\" alt=\"Number of appetizer options (2) times number of entree options (3) times number of dessert options (2)\" width=\"663\" height=\"64\"><\/a>\n<div class=\"textbox\">\n<h3>A General Note: The Multiplication Principle<\/h3>\nAccording to the <strong>Multiplication Principle<\/strong>, 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 <strong>Fundamental Counting Principle<\/strong>.\n\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Using the Multiplication Principle<\/h3>\nDiane 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.\n\n[reveal-answer q=\"912778\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"912778\"]\n\nTo 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.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231545\/CNX_Precalc_Figure_11_05_0042.jpg\" alt=\"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.\" width=\"487\" height=\"82\">\n\nThere are 16 possible outfits.\n\n[\/hidden-answer]\n\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\nA 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.\n\n[reveal-answer q=\"559695\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"559695\"]\n\nThere are 60 possible breakfast specials.\n\n[\/hidden-answer]\n\n<\/div>\nThe 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 <strong>permutation<\/strong>.\n<h2>Finding the Number of Permutations of [latex]n[\/latex] Distinct Objects Using the Multiplication Principle<\/h2>\nTo 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.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231547\/CNX_Precalc_Figure_11_05_0052.jpg\" alt=\"\">\n\nThere are four options for the first place, so we write a 4 on the first line.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231549\/CNX_Precalc_Figure_11_05_0062.jpg\" alt=\"Four times two blanks spots.\">\n\nAfter the first place has been filled, there are three options for the second place so we write a 3 on the second line.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231550\/CNX_Precalc_Figure_11_05_0072.jpg\" alt=\"Four times three times one blank spot.\">\n\nAfter 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.\n\n<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231553\/CNX_Precalc_Figure_11_05_0082.jpg\" alt=\"\">\n\nThere are 24 possible permutations of the paintings.\n<div class=\"textbox\">\n<h3>How To: Given [latex]n[\/latex] distinct options, determine how many permutations there are.<\/h3>\n<ol>\n \t<li>Determine how many options there are for the first situation.<\/li>\n \t<li>Determine how many options are left for the second situation.<\/li>\n \t<li>Continue until all of the spots are filled.<\/li>\n \t<li>Multiply the numbers together.<\/li>\n<\/ol>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations Using the Multiplication Principle<\/h3>\nAt a swimming competition, nine swimmers compete in a race.\n<ol>\n \t<li>How many ways can they place first, second, and third?<\/li>\n \t<li>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.)<\/li>\n \t<li>How many ways can all nine swimmers line up for a photo?<\/li>\n<\/ol>\n[reveal-answer q=\"268922\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"268922\"]\n<ol>\n \t<li>Draw lines for each place.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231555\/CNX_Precalc_Figure_11_05_0092.jpg\" alt=\"\">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.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231556\/CNX_Precalc_Figure_11_05_0102.jpg\" alt=\"\">Multiply to find that there are 504 ways for the swimmers to place.<\/li>\n \t<li>Draw lines for describing each place.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231558\/CNX_Precalc_Figure_11_05_0112.jpg\" alt=\"\">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.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231600\/CNX_Precalc_Figure_11_05_0122.jpg\" alt=\"\">Multiply to find that there are 56 ways for the swimmers to place if Ariel wins first.<\/li>\n \t<li>Draw lines for describing each place in the photo.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231602\/CNX_Precalc_Figure_11_05_0132.jpg\" alt=\"\">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.<img class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231604\/CNX_Precalc_Figure_11_05_0142.jpg\" alt=\"\">There are 362,880 possible permutations for the swimmers to line up.<\/li>\n<\/ol>\n<h4>Analysis of the Solution<\/h4>\nNote 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].\n\n[\/hidden-answer]\n\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\nA family of five is having portraits taken. Use the Multiplication Principle to find the following.\nHow many ways can the family line up for the portrait?\n\n[reveal-answer q=\"847892\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"847892\"]\n\n120\n\n[\/hidden-answer]\n\nHow many ways can the photographer line up 3 family members?\n\n[reveal-answer q=\"416580\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"416580\"]\n\n60\n\n[\/hidden-answer]\n\nHow many ways can the family line up for the portrait if the parents are required to stand on each end?\n\n[reveal-answer q=\"518944\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"518944\"]\n\n12\n\n[\/hidden-answer]\n\n[embed]https:\/\/ohm.lumenlearning.com\/multiembedq.php?id=7155&amp;theme=oea&amp;iframe_resize_id=mom1[\/embed]\n\n<\/div>\n<h2>Finding the Number of Permutations of <em>n<\/em> Distinct Objects Using a Formula<\/h2>\nFor 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\u2019s 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.\n<div class=\"textbox examples\">\n<h3>tip for success<\/h3>\nIn mathematics, we sometimes use the same notation to mean different things in different contexts. In the notation given above, note that [latex]P\\left(n, r\\right)[\/latex] indicates we wish to calculate the&nbsp;<em>Permutation<\/em><em>&nbsp;<\/em>of [latex]r[\/latex] objects out of a set of [latex]n[\/latex]&nbsp;objects. It looks similar to an ordered pair, but does not indicate an (input, output) relationship between [latex]n[\/latex] and [latex]r[\/latex].\n\n<\/div>\nLet\u2019s 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.\n<p style=\"text-align: center\">[latex]\\dfrac{6!}{3!}=\\dfrac{6\\cdot 5\\cdot 4\\cdot 3!}{3!}=6\\cdot 5\\cdot 4=120[\/latex]<\/p>\nThere 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.\n<p style=\"text-align: center\">[latex]P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!}[\/latex]<\/p>\nNote that the formula stills works if we are choosing <u>all<\/u> [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]\n<div class=\"textbox\">\n<h3>A General Note: Formula for Permutations of <em>n<\/em> Distinct Objects<\/h3>\nGiven [latex]n[\/latex] distinct objects, the number of ways to select [latex]r[\/latex] objects from the set in order is\n<p style=\"text-align: center\">[latex]P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!}[\/latex]<\/p>\n\n<\/div>\n<div class=\"textbox\">\n<h3>How To: Given a word problem, evaluate the possible permutations.<\/h3>\n<ol>\n \t<li>Identify [latex]n[\/latex] from the given information.<\/li>\n \t<li>Identify [latex]r[\/latex] from the given information.<\/li>\n \t<li>Replace [latex]n[\/latex] and [latex]r[\/latex] in the formula with the given values.<\/li>\n \t<li>Evaluate.<\/li>\n<\/ol>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations Using the Formula<\/h3>\nA 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?\n\n[reveal-answer q=\"888411\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"888411\"]\n\nSubstitute [latex]n=12[\/latex] and [latex]r=9[\/latex] into the permutation formula and simplify.\n<p style=\"text-align: center\">[latex]\\begin{align}&amp;P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!} \\\\[1mm] &amp;P\\left(12,9\\right)=\\dfrac{12!}{\\left(12 - 9\\right)!}=\\dfrac{12!}{3!}=79\\text{,}833\\text{,}600 \\end{align}[\/latex]<\/p>\nThere are 79,833,600 possible permutations of exam questions!\n<h4>Analysis of the Solution<\/h4>\nWe can also use a calculator to find permutations. For this problem, we would enter 12, press the [latex]{}_{n}{P}_{r}[\/latex]&nbsp;function, enter 9, and then press Enter. The [latex]{}_{n}{P}_{r}[\/latex]&nbsp;function may be located under the MATH menu with probability commands.\n\n[\/hidden-answer]\n\n<\/div>\n<div class=\"textbox\">\n<h3>Q &amp; A<\/h3>\n<h4>Could we have solved &nbsp;using the Multiplication Principle?<\/h4>\n<em>Yes. We could have multiplied<\/em> [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] <em>to find the same answer<\/em>.\n\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\nA play has a cast of 7 actors preparing to make their curtain call. Use the permutation formula to find the following.\n\nHow many ways can the 7 actors line up?\n\n[reveal-answer q=\"288859\"]Show Solution[\/reveal-answer]\n\n[hidden-answer a=\"288859\"]\n\n[latex]P\\left(7,7\\right)=5\\text{,}040[\/latex]\n\n[\/hidden-answer]\n\nHow many ways can 5 of the 7 actors be chosen to line up?\n\n[reveal-answer q=\"754095\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"754095\"]\n\n[latex]P\\left(7,5\\right)=2\\text{,}520[\/latex]\n\n[\/hidden-answer]\n\n[ohm_question]32832[\/ohm_question]\n\n<\/div>\n<h2>Finding the Number of Permutations of n Non-Distinct Objects<\/h2>\nWe 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.\n<p style=\"text-align: center\">[latex]\\dfrac{n!}{{r}_{1}!{r}_{2}!\\dots {r}_{k}!}[\/latex]<\/p>\nIn 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.\n<p style=\"text-align: center\">[latex]\\dfrac{12!}{4!3!}=3\\text{,}326\\text{,}400[\/latex]<\/p>\nThere are 3,326,400 ways to order the sheet of stickers.\n<div class=\"textbox\">\n<h3>A General Note: Formula for Finding the Number of Permutations of <em>n<\/em> Non-Distinct Objects<\/h3>\nIf 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\n<p style=\"text-align: center\">[latex]\\dfrac{n!}{{r}_{1}!{r}_{2}!\\dots {r}_{k}!}[\/latex]<\/p>\n\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations of <em>n<\/em> Non-Distinct Objects<\/h3>\nFind the number of rearrangements of the letters in the word DISTINCT.\n\n[reveal-answer q=\"162138\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"162138\"]\n\nThere 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.\n<p style=\"text-align: center\">[latex]\\dfrac{8!}{2!2!}=10\\text{,}080 [\/latex]<\/p>\nThere are 10,080 arrangements.\n\n[\/hidden-answer]\n\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\nFind the number of rearrangements of the letters in the word CARRIER.\n\n[reveal-answer q=\"688005\"]Show Solution[\/reveal-answer]\n[hidden-answer a=\"688005\"]\n\n840\n\n[\/hidden-answer]\n\n[embed]https:\/\/ohm.lumenlearning.com\/multiembedq.php?id=73855&amp;theme=oea&amp;iframe_resize_id=mom5[\/embed]\n\n<\/div>\n","rendered":"<div class=\"textbox learning-objectives\">\n<h3>Learning Outcomes<\/h3>\n<ul>\n<li>Use the addition principle to determine the total number of options&nbsp;for a given scenario.<\/li>\n<li>Use the multiplication principle to find the number of permutation of n distinct objects.<\/li>\n<li>Find the number of permutations of n distinct objects using a formula.<\/li>\n<li>Find the Number of Permutations of n Non-Distinct Objects.<\/li>\n<\/ul>\n<\/div>\n<div class=\"textbox examples\">\n<h3>tip for success<\/h3>\n<p>It is important to try each of the examples in this section on paper and on your calculator as indicated to build up a good intuition for basic counting principles. The principles may seem fairly straightforward as you read through them, but future concepts will be more challenging without a good understanding of these.<\/p>\n<\/div>\n<h2>Using the Addition Principle<\/h2>\n<p>The company that sells customizable cases offers cases for tablets and smartphones. There are 3 supported tablet models and 5 supported smartphone models. The <strong>Addition Principle<\/strong> 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.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231533\/CNX_Precalc_Figure_11_05_001n2.jpg\" alt=\"The addition of 3 iPods and 4 iPhones.\" width=\"487\" height=\"358\" \/><\/p>\n<div class=\"textbox\">\n<h3>A General Note: The Addition Principle<\/h3>\n<p>According to the <strong>Addition Principle<\/strong>, 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 <em>or<\/em> second event can occur in [latex]m+n[\/latex] ways.<\/p>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Using the Addition Principle<\/h3>\n<p>There are 2 vegetarian entr\u00e9e options and 5 meat entr\u00e9e options on a dinner menu. What is the total number of entr\u00e9e options?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q477104\">Show Solution<\/span><\/p>\n<div id=\"q477104\" class=\"hidden-answer\" style=\"display: none\">\n<p>We can add the number of vegetarian options to the number of meat options to find the total number of entr\u00e9e options.<\/p>\n<p><img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231539\/CNX_Precalc_Figure_11_05_0022.jpg\" alt=\"The addition of the type of options for an entree.\" \/><\/p>\n<p>There are 7 total options.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\n<p>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?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q856363\">Show Solution<\/span><\/p>\n<div id=\"q856363\" class=\"hidden-answer\" style=\"display: none\">\n<p>7<\/p>\n<\/div>\n<\/div>\n<\/div>\n<h2>Using the Multiplication Principle<\/h2>\n<p>The <strong>Multiplication Principle<\/strong> applies when we are making more than one selection. Suppose we are choosing an appetizer, an entr\u00e9e, and a dessert. If there are 2 appetizer options, 3 entr\u00e9e 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.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231541\/CNX_Precalc_Figure_11_05_0032.jpg\" alt=\"A tree diagram of the different menu combinations.\" width=\"975\" height=\"287\" \/><\/p>\n<p>The possible choices are:<\/p>\n<ol>\n<li>soup, chicken, cake<\/li>\n<li>soup, chicken, pudding<\/li>\n<li>soup, fish, cake<\/li>\n<li>soup, fish, pudding<\/li>\n<li>soup, steak, cake<\/li>\n<li>soup, steak, pudding<\/li>\n<li>salad, chicken, cake<\/li>\n<li>salad, chicken, pudding<\/li>\n<li>salad, fish, cake<\/li>\n<li>salad, fish, pudding<\/li>\n<li>salad, steak, cake<\/li>\n<li>salad, steak, pudding<\/li>\n<\/ol>\n<p>We can also find the total number of possible dinners by multiplying.<\/p>\n<p>We could also conclude that there are 12 possible dinner choices simply by applying the Multiplication Principle.<br \/>\n<a href=\"https:\/\/courses.candelalearning.com\/precalctwo1xmaster\/wp-content\/uploads\/sites\/923\/2015\/10\/Screen-Shot-2015-10-22-at-10.01.45-AM.png\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-12344 size-full\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231543\/Screen-Shot-2015-10-22-at-10.01.45-AM.png\" alt=\"Number of appetizer options (2) times number of entree options (3) times number of dessert options (2)\" width=\"663\" height=\"64\" \/><\/a><\/p>\n<div class=\"textbox\">\n<h3>A General Note: The Multiplication Principle<\/h3>\n<p>According to the <strong>Multiplication Principle<\/strong>, 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 <strong>Fundamental Counting Principle<\/strong>.<\/p>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Using the Multiplication Principle<\/h3>\n<p>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.<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q912778\">Show Solution<\/span><\/p>\n<div id=\"q912778\" class=\"hidden-answer\" style=\"display: none\">\n<p>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.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231545\/CNX_Precalc_Figure_11_05_0042.jpg\" alt=\"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.\" width=\"487\" height=\"82\" \/><\/p>\n<p>There are 16 possible outfits.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\n<p>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.<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q559695\">Show Solution<\/span><\/p>\n<div id=\"q559695\" class=\"hidden-answer\" style=\"display: none\">\n<p>There are 60 possible breakfast specials.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<p>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 <strong>permutation<\/strong>.<\/p>\n<h2>Finding the Number of Permutations of [latex]n[\/latex] Distinct Objects Using the Multiplication Principle<\/h2>\n<p>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.<\/p>\n<p><img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231547\/CNX_Precalc_Figure_11_05_0052.jpg\" alt=\"\" \/><\/p>\n<p>There are four options for the first place, so we write a 4 on the first line.<\/p>\n<p><img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231549\/CNX_Precalc_Figure_11_05_0062.jpg\" alt=\"Four times two blanks spots.\" \/><\/p>\n<p>After the first place has been filled, there are three options for the second place so we write a 3 on the second line.<\/p>\n<p><img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231550\/CNX_Precalc_Figure_11_05_0072.jpg\" alt=\"Four times three times one blank spot.\" \/><\/p>\n<p>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.<\/p>\n<p><img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231553\/CNX_Precalc_Figure_11_05_0082.jpg\" alt=\"\" \/><\/p>\n<p>There are 24 possible permutations of the paintings.<\/p>\n<div class=\"textbox\">\n<h3>How To: Given [latex]n[\/latex] distinct options, determine how many permutations there are.<\/h3>\n<ol>\n<li>Determine how many options there are for the first situation.<\/li>\n<li>Determine how many options are left for the second situation.<\/li>\n<li>Continue until all of the spots are filled.<\/li>\n<li>Multiply the numbers together.<\/li>\n<\/ol>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations Using the Multiplication Principle<\/h3>\n<p>At a swimming competition, nine swimmers compete in a race.<\/p>\n<ol>\n<li>How many ways can they place first, second, and third?<\/li>\n<li>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.)<\/li>\n<li>How many ways can all nine swimmers line up for a photo?<\/li>\n<\/ol>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q268922\">Show Solution<\/span><\/p>\n<div id=\"q268922\" class=\"hidden-answer\" style=\"display: none\">\n<ol>\n<li>Draw lines for each place.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231555\/CNX_Precalc_Figure_11_05_0092.jpg\" alt=\"\" \/>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.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231556\/CNX_Precalc_Figure_11_05_0102.jpg\" alt=\"\" \/>Multiply to find that there are 504 ways for the swimmers to place.<\/li>\n<li>Draw lines for describing each place.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231558\/CNX_Precalc_Figure_11_05_0112.jpg\" alt=\"\" \/>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.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231600\/CNX_Precalc_Figure_11_05_0122.jpg\" alt=\"\" \/>Multiply to find that there are 56 ways for the swimmers to place if Ariel wins first.<\/li>\n<li>Draw lines for describing each place in the photo.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231602\/CNX_Precalc_Figure_11_05_0132.jpg\" alt=\"\" \/>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.<img decoding=\"async\" class=\"aligncenter\" src=\"https:\/\/s3-us-west-2.amazonaws.com\/courses-images\/wp-content\/uploads\/sites\/896\/2016\/11\/03231604\/CNX_Precalc_Figure_11_05_0142.jpg\" alt=\"\" \/>There are 362,880 possible permutations for the swimmers to line up.<\/li>\n<\/ol>\n<h4>Analysis of the Solution<\/h4>\n<p>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].<\/p>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\n<p>A family of five is having portraits taken. Use the Multiplication Principle to find the following.<br \/>\nHow many ways can the family line up for the portrait?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q847892\">Show Solution<\/span><\/p>\n<div id=\"q847892\" class=\"hidden-answer\" style=\"display: none\">\n<p>120<\/p>\n<\/div>\n<\/div>\n<p>How many ways can the photographer line up 3 family members?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q416580\">Show Solution<\/span><\/p>\n<div id=\"q416580\" class=\"hidden-answer\" style=\"display: none\">\n<p>60<\/p>\n<\/div>\n<\/div>\n<p>How many ways can the family line up for the portrait if the parents are required to stand on each end?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q518944\">Show Solution<\/span><\/p>\n<div id=\"q518944\" class=\"hidden-answer\" style=\"display: none\">\n<p>12<\/p>\n<\/div>\n<\/div>\n<p><iframe loading=\"lazy\" id=\"ohm7155\" class=\"resizable\" src=\"https:\/\/ohm.lumenlearning.com\/multiembedq.php?id=7155&#38;theme=oea&#38;iframe_resize_id=ohm7155&#38;show_question_numbers\" width=\"100%\" height=\"150\"><\/iframe><\/p>\n<\/div>\n<h2>Finding the Number of Permutations of <em>n<\/em> Distinct Objects Using a Formula<\/h2>\n<p>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\u2019s 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.<\/p>\n<div class=\"textbox examples\">\n<h3>tip for success<\/h3>\n<p>In mathematics, we sometimes use the same notation to mean different things in different contexts. In the notation given above, note that [latex]P\\left(n, r\\right)[\/latex] indicates we wish to calculate the&nbsp;<em>Permutation<\/em><em>&nbsp;<\/em>of [latex]r[\/latex] objects out of a set of [latex]n[\/latex]&nbsp;objects. It looks similar to an ordered pair, but does not indicate an (input, output) relationship between [latex]n[\/latex] and [latex]r[\/latex].<\/p>\n<\/div>\n<p>Let\u2019s 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.<\/p>\n<p style=\"text-align: center\">[latex]\\dfrac{6!}{3!}=\\dfrac{6\\cdot 5\\cdot 4\\cdot 3!}{3!}=6\\cdot 5\\cdot 4=120[\/latex]<\/p>\n<p>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.<\/p>\n<p style=\"text-align: center\">[latex]P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!}[\/latex]<\/p>\n<p>Note that the formula stills works if we are choosing <u>all<\/u> [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]<\/p>\n<div class=\"textbox\">\n<h3>A General Note: Formula for Permutations of <em>n<\/em> Distinct Objects<\/h3>\n<p>Given [latex]n[\/latex] distinct objects, the number of ways to select [latex]r[\/latex] objects from the set in order is<\/p>\n<p style=\"text-align: center\">[latex]P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!}[\/latex]<\/p>\n<\/div>\n<div class=\"textbox\">\n<h3>How To: Given a word problem, evaluate the possible permutations.<\/h3>\n<ol>\n<li>Identify [latex]n[\/latex] from the given information.<\/li>\n<li>Identify [latex]r[\/latex] from the given information.<\/li>\n<li>Replace [latex]n[\/latex] and [latex]r[\/latex] in the formula with the given values.<\/li>\n<li>Evaluate.<\/li>\n<\/ol>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations Using the Formula<\/h3>\n<p>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?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q888411\">Show Solution<\/span><\/p>\n<div id=\"q888411\" class=\"hidden-answer\" style=\"display: none\">\n<p>Substitute [latex]n=12[\/latex] and [latex]r=9[\/latex] into the permutation formula and simplify.<\/p>\n<p style=\"text-align: center\">[latex]\\begin{align}&P\\left(n,r\\right)=\\dfrac{n!}{\\left(n-r\\right)!} \\\\[1mm] &P\\left(12,9\\right)=\\dfrac{12!}{\\left(12 - 9\\right)!}=\\dfrac{12!}{3!}=79\\text{,}833\\text{,}600 \\end{align}[\/latex]<\/p>\n<p>There are 79,833,600 possible permutations of exam questions!<\/p>\n<h4>Analysis of the Solution<\/h4>\n<p>We can also use a calculator to find permutations. For this problem, we would enter 12, press the [latex]{}_{n}{P}_{r}[\/latex]&nbsp;function, enter 9, and then press Enter. The [latex]{}_{n}{P}_{r}[\/latex]&nbsp;function may be located under the MATH menu with probability commands.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"textbox\">\n<h3>Q &amp; A<\/h3>\n<h4>Could we have solved &nbsp;using the Multiplication Principle?<\/h4>\n<p><em>Yes. We could have multiplied<\/em> [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] <em>to find the same answer<\/em>.<\/p>\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\n<p>A play has a cast of 7 actors preparing to make their curtain call. Use the permutation formula to find the following.<\/p>\n<p>How many ways can the 7 actors line up?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q288859\">Show Solution<\/span><\/p>\n<div id=\"q288859\" class=\"hidden-answer\" style=\"display: none\">\n<p>[latex]P\\left(7,7\\right)=5\\text{,}040[\/latex]<\/p>\n<\/div>\n<\/div>\n<p>How many ways can 5 of the 7 actors be chosen to line up?<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q754095\">Show Solution<\/span><\/p>\n<div id=\"q754095\" class=\"hidden-answer\" style=\"display: none\">\n<p>[latex]P\\left(7,5\\right)=2\\text{,}520[\/latex]<\/p>\n<\/div>\n<\/div>\n<p><iframe loading=\"lazy\" id=\"ohm32832\" class=\"resizable\" src=\"https:\/\/ohm.lumenlearning.com\/multiembedq.php?id=32832&theme=oea&iframe_resize_id=ohm32832&show_question_numbers\" width=\"100%\" height=\"150\"><\/iframe><\/p>\n<\/div>\n<h2>Finding the Number of Permutations of n Non-Distinct Objects<\/h2>\n<p>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.<\/p>\n<p style=\"text-align: center\">[latex]\\dfrac{n!}{{r}_{1}!{r}_{2}!\\dots {r}_{k}!}[\/latex]<\/p>\n<p>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.<\/p>\n<p style=\"text-align: center\">[latex]\\dfrac{12!}{4!3!}=3\\text{,}326\\text{,}400[\/latex]<\/p>\n<p>There are 3,326,400 ways to order the sheet of stickers.<\/p>\n<div class=\"textbox\">\n<h3>A General Note: Formula for Finding the Number of Permutations of <em>n<\/em> Non-Distinct Objects<\/h3>\n<p>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<\/p>\n<p style=\"text-align: center\">[latex]\\dfrac{n!}{{r}_{1}!{r}_{2}!\\dots {r}_{k}!}[\/latex]<\/p>\n<\/div>\n<div class=\"textbox exercises\">\n<h3>Example: Finding the Number of Permutations of <em>n<\/em> Non-Distinct Objects<\/h3>\n<p>Find the number of rearrangements of the letters in the word DISTINCT.<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q162138\">Show Solution<\/span><\/p>\n<div id=\"q162138\" class=\"hidden-answer\" style=\"display: none\">\n<p>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.<\/p>\n<p style=\"text-align: center\">[latex]\\dfrac{8!}{2!2!}=10\\text{,}080[\/latex]<\/p>\n<p>There are 10,080 arrangements.<\/p>\n<\/div>\n<\/div>\n<\/div>\n<div class=\"textbox key-takeaways\">\n<h3>Try It<\/h3>\n<p>Find the number of rearrangements of the letters in the word CARRIER.<\/p>\n<div class=\"qa-wrapper\" style=\"display: block\"><span class=\"show-answer collapsed\" style=\"cursor: pointer\" data-target=\"q688005\">Show Solution<\/span><\/p>\n<div id=\"q688005\" class=\"hidden-answer\" style=\"display: none\">\n<p>840<\/p>\n<\/div>\n<\/div>\n<p><iframe loading=\"lazy\" id=\"ohm73855\" class=\"resizable\" src=\"https:\/\/ohm.lumenlearning.com\/multiembedq.php?id=73855&#38;theme=oea&#38;iframe_resize_id=ohm73855&#38;show_question_numbers\" width=\"100%\" height=\"150\"><\/iframe><\/p>\n<\/div>\n\n\t\t\t <section class=\"citations-section\" role=\"contentinfo\">\n\t\t\t <h3>Candela Citations<\/h3>\n\t\t\t\t\t <div>\n\t\t\t\t\t\t <div id=\"citation-list-459\">\n\t\t\t\t\t\t\t <div class=\"licensing\"><div class=\"license-attribution-dropdown-subheading\">CC licensed content, Original<\/div><ul class=\"citation-list\"><li>Revision and Adaptation. <strong>Provided by<\/strong>: Lumen Learning. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em><\/li><\/ul><div class=\"license-attribution-dropdown-subheading\">CC licensed content, Shared previously<\/div><ul class=\"citation-list\"><li>College Algebra. <strong>Authored by<\/strong>: OpenStax College. <strong>Provided by<\/strong>: OpenStax. <strong>Located at<\/strong>: <a target=\"_blank\" href=\"http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface\">http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface<\/a>. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em><\/li><li>College Algebra. <strong>Authored by<\/strong>: Abramson, Jay et al.. <strong>Provided by<\/strong>: OpenStax. <strong>Located at<\/strong>: <a target=\"_blank\" href=\"http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\">http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2<\/a>. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em>. <strong>License Terms<\/strong>: Download for free at http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2<\/li><li>Question ID 7155. <strong>Authored by<\/strong>: unknown, mb Lippman,David, mb Sousa,James. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em>. <strong>License Terms<\/strong>: IMathAS Community LicenseCC-BY + GPL<\/li><li>Question ID 7164. <strong>Authored by<\/strong>: WebWork-Rochester. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em>. <strong>License Terms<\/strong>: IMathAS Community License CC-BY + GPL<\/li><li>Question ID 32832. <strong>Authored by<\/strong>: David Lippman. <strong>License<\/strong>: <em><a target=\"_blank\" rel=\"license\" href=\"https:\/\/creativecommons.org\/licenses\/by\/4.0\/\">CC BY: Attribution<\/a><\/em>. <strong>License Terms<\/strong>: IMathAS Community License CC-BY + GPL<\/li><\/ul><\/div>\n\t\t\t\t\t\t <\/div>\n\t\t\t\t\t <\/div>\n\t\t\t <\/section>","protected":false},"author":17533,"menu_order":6,"template":"","meta":{"_candela_citation":"[{\"type\":\"cc\",\"description\":\"College Algebra\",\"author\":\"OpenStax College\",\"organization\":\"OpenStax\",\"url\":\"http:\/\/cnx.org\/contents\/fd53eae1-fa23-47c7-bb1b-972349835c3c@5.175:1\/Preface\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"\"},{\"type\":\"original\",\"description\":\"Revision and Adaptation\",\"author\":\"\",\"organization\":\"Lumen Learning\",\"url\":\"\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"\"},{\"type\":\"cc\",\"description\":\"College Algebra\",\"author\":\"Abramson, Jay et al.\",\"organization\":\"OpenStax\",\"url\":\"http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"Download for free at http:\/\/cnx.org\/contents\/9b08c294-057f-4201-9f48-5d6ad992740d@5.2\"},{\"type\":\"cc\",\"description\":\"Question ID 7155\",\"author\":\"unknown, mb Lippman,David, mb Sousa,James\",\"organization\":\"\",\"url\":\"\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"IMathAS Community LicenseCC-BY + GPL\"},{\"type\":\"cc\",\"description\":\"Question ID 7164\",\"author\":\"WebWork-Rochester\",\"organization\":\"\",\"url\":\"\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"IMathAS Community License CC-BY + GPL\"},{\"type\":\"cc\",\"description\":\"Question ID 32832\",\"author\":\"David Lippman\",\"organization\":\"\",\"url\":\"\",\"project\":\"\",\"license\":\"cc-by\",\"license_terms\":\"IMathAS Community License CC-BY + GPL\"}]","CANDELA_OUTCOMES_GUID":"6b87d3b7-4e0e-45ed-b43d-29d78bb52cce","pb_show_title":"on","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[],"contributor":[],"license":[],"class_list":["post-459","chapter","type-chapter","status-publish","hentry"],"part":453,"_links":{"self":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/chapters\/459","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/wp\/v2\/users\/17533"}],"version-history":[{"count":0,"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/chapters\/459\/revisions"}],"part":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/parts\/453"}],"metadata":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/chapters\/459\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/wp\/v2\/media?parent=459"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/pressbooks\/v2\/chapter-type?post=459"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/wp\/v2\/contributor?post=459"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/courses.lumenlearning.com\/ntcc-collegealgebracorequisite\/wp-json\/wp\/v2\/license?post=459"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}