{"id":2096,"date":"2015-11-12T18:30:42","date_gmt":"2015-11-12T18:30:42","guid":{"rendered":"https:\/\/courses.candelalearning.com\/collegealgebra1xmaster\/?post_type=chapter&p=2096"},"modified":"2015-11-12T18:30:42","modified_gmt":"2015-11-12T18:30:42","slug":"finding-the-number-of-permutations-of-n-distinct-objects","status":"publish","type":"chapter","link":"https:\/\/courses.lumenlearning.com\/odessa-collegealgebra\/chapter\/finding-the-number-of-permutations-of-n-distinct-objects\/","title":{"raw":"Finding the Number of Permutations of n Distinct Objects","rendered":"Finding the Number of Permutations of n Distinct Objects"},"content":{"raw":"

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<\/strong>.\n<\/p>

Finding the Number of Permutations of n<\/em> 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\"\"\n\nThere are four options for the first place, so we write a 4 on the first line.\n\n\"Four\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\"Four\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\"\"\n\nThere are 24 possible permutations of the paintings.\n
\n

How To: Given [latex]n[\/latex] distinct options, determine how many permutations there are.<\/h3>\n
  1. Determine how many options there are for the first situation.<\/li>\n\t
  2. Determine how many options are left for the second situation.<\/li>\n\t
  3. Continue until all of the spots are filled.<\/li>\n\t
  4. Multiply the numbers together.<\/li>\n<\/ol><\/div>\n
    \n

    Example 2: Finding the Number of Permutations Using the Multiplication Principle<\/h3>\nAt a swimming competition, nine swimmers compete in a race.\n
    1. How many ways can they place first, second, and third?<\/li>\n\t
    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.)<\/li>\n\t
    3. How many ways can all nine swimmers line up for a photo?<\/li>\n<\/ol><\/div>\n
      \n

      Solution<\/h3>\n
      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.\n\n\"\"\n\nMultiply to find that there are 504 ways for the swimmers to place.<\/li>\n\t
      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.\n\n\"\"\n\nMultiply to find that there are 56 ways for the swimmers to place if Ariel wins first.<\/li>\n\t
      3. Draw lines for describing each place in the photo.\"\"\n\nThere 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.\n\n\"\"\n\nThere are 362,880 possible permutations for the swimmers to line up.<\/li>\n<\/ol><\/div>\n
        \n

        Analysis of the Solution<\/h3>\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<\/div>\nA family of five is having portraits taken. Use the Multiplication Principle to find the following.\n
        \n

        Try It 3<\/h3>\nHow many ways can the family line up for the portrait?\n\nSolution<\/a>\n\n<\/div>\n
        \n

        Try It 4<\/h3>\nHow many ways can the photographer line up 3 family members?\n\nSolution<\/a>\n\n<\/div>\n
        \n

        Try It 5<\/h3>\nHow many ways can the family line up for the portrait if the parents are required to stand on each end?\n\nSolution<\/a>\n\n<\/div>\n

        Finding the Number of Permutations of 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\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
        [latex]\\frac{6!}{3!}=\\frac{6\\cdot 5\\cdot 4\\cdot 3!}{3!}=6\\cdot 5\\cdot 4=120[\/latex]<\/div>\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
        [latex]P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}[\/latex]<\/div>\nNote that the formula stills works if we are choosing 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
        \n

        A General Note: Formula for Permutations of 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
        [latex]P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}[\/latex]<\/div>\n<\/div>\n
        \n

        How To: Given a word problem, evaluate the possible permutations.<\/h3>\n
        1. Identify [latex]n[\/latex] from the given information.<\/li>\n\t
        2. Identify [latex]r[\/latex] from the given information.<\/li>\n\t
        3. Replace [latex]n[\/latex] and [latex]r[\/latex] in the formula with the given values.<\/li>\n\t
        4. Evaluate.<\/li>\n<\/ol><\/div>\n
          \n

          Example 3: 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<\/div>\n
          \n

          Solution<\/h3>\nSubstitute [latex]n=12[\/latex] and [latex]r=9[\/latex] into the permutation formula and simplify.\n
          [latex]\\begin{array}{l}\\text{ }P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}\\hfill \\\\ P\\left(12,9\\right)=\\frac{12!}{\\left(12 - 9\\right)!}=\\frac{12!}{3!}=79\\text{,}833\\text{,}600\\hfill \\end{array}[\/latex]<\/div>\nThere are 79,833,600 possible permutations of exam questions!\n\n<\/div>\n
          \n

          Analysis of the Solution<\/h3>\nWe can also use a calculator to find permutations. For this problem, we would enter 15, press the [latex]{}_{n}{P}_{r}[\/latex]\u00a0function, enter 12, and then press the equal sign. The [latex]{}_{n}{P}_{r}[\/latex]\u00a0function may be located under the MATH menu with probability commands.\n\n<\/div>\n
          \n

          Q & A<\/h3>\n

          Could we have solved \u00a0using the Multiplication Principle?<\/h3>\nYes. 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] to find the same answer<\/em>.\n\n<\/div>\nA play has a cast of 7 actors preparing to make their curtain call. Use the permutation formula to find the following.\n
          \n

          Try It 6<\/h3>\nHow many ways can the 7 actors line up?\n\nSolution<\/a>\n\n<\/div>\n
          \n

          Try It 7<\/h3>\nHow many ways can 5 of the 7 actors be chosen to line up?\n\nSolution<\/a>\n\n<\/div>","rendered":"

          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<\/strong>.\n<\/p>\n

          Finding the Number of Permutations of n<\/em> Distinct Objects Using the Multiplication Principle<\/h2>\n

          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>\n

          There are four options for the first place, so we write a 4 on the first line.<\/p>\n

          \"Four<\/p>\n

          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

          \"Four<\/p>\n

          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>\n

          There are 24 possible permutations of the paintings.<\/p>\n

          \n

          How To: Given [latex]n[\/latex] distinct options, determine how many permutations there are.<\/h3>\n
            \n
          1. Determine how many options there are for the first situation.<\/li>\n
          2. Determine how many options are left for the second situation.<\/li>\n
          3. Continue until all of the spots are filled.<\/li>\n
          4. Multiply the numbers together.<\/li>\n<\/ol>\n<\/div>\n
            \n

            Example 2: Finding the Number of Permutations Using the Multiplication Principle<\/h3>\n

            At a swimming competition, nine swimmers compete in a race.<\/p>\n

              \n
            1. How many ways can they place first, second, and third?<\/li>\n
            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.)<\/li>\n
            3. How many ways can all nine swimmers line up for a photo?<\/li>\n<\/ol>\n<\/div>\n
              \n

              Solution<\/h3>\n
                \n
              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.\n

                \"\"<\/p>\n

                Multiply to find that there are 504 ways for the swimmers to place.<\/li>\n

              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.\n

                \"\"<\/p>\n

                Multiply to find that there are 56 ways for the swimmers to place if Ariel wins first.<\/li>\n

              3. Draw lines for describing each place in the photo.\"\"\n

                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.<\/p>\n

                \"\"<\/p>\n

                There are 362,880 possible permutations for the swimmers to line up.<\/li>\n<\/ol>\n<\/div>\n

                \n

                Analysis of the Solution<\/h3>\n

                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

                A family of five is having portraits taken. Use the Multiplication Principle to find the following.<\/p>\n

                \n

                Try It 3<\/h3>\n

                How many ways can the family line up for the portrait?<\/p>\n

                Solution<\/a><\/p>\n<\/div>\n

                \n

                Try It 4<\/h3>\n

                How many ways can the photographer line up 3 family members?<\/p>\n

                Solution<\/a><\/p>\n<\/div>\n

                \n

                Try It 5<\/h3>\n

                How many ways can the family line up for the portrait if the parents are required to stand on each end?<\/p>\n

                Solution<\/a><\/p>\n<\/div>\n

                Finding the Number of Permutations of n<\/em> Distinct Objects Using a Formula<\/h2>\n

                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

                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

                [latex]\\frac{6!}{3!}=\\frac{6\\cdot 5\\cdot 4\\cdot 3!}{3!}=6\\cdot 5\\cdot 4=120[\/latex]<\/div>\n

                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

                [latex]P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}[\/latex]<\/div>\n

                Note that the formula stills works if we are choosing 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

                \n

                A General Note: Formula for Permutations of n<\/em> Distinct Objects<\/h3>\n

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

                [latex]P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}[\/latex]<\/div>\n<\/div>\n
                \n

                How To: Given a word problem, evaluate the possible permutations.<\/h3>\n
                  \n
                1. Identify [latex]n[\/latex] from the given information.<\/li>\n
                2. Identify [latex]r[\/latex] from the given information.<\/li>\n
                3. Replace [latex]n[\/latex] and [latex]r[\/latex] in the formula with the given values.<\/li>\n
                4. Evaluate.<\/li>\n<\/ol>\n<\/div>\n
                  \n

                  Example 3: Finding the Number of Permutations Using the Formula<\/h3>\n

                  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>\n

                  \n

                  Solution<\/h3>\n

                  Substitute [latex]n=12[\/latex] and [latex]r=9[\/latex] into the permutation formula and simplify.<\/p>\n

                  [latex]\\begin{array}{l}\\text{ }P\\left(n,r\\right)=\\frac{n!}{\\left(n-r\\right)!}\\hfill \\\\ P\\left(12,9\\right)=\\frac{12!}{\\left(12 - 9\\right)!}=\\frac{12!}{3!}=79\\text{,}833\\text{,}600\\hfill \\end{array}[\/latex]<\/div>\n

                  There are 79,833,600 possible permutations of exam questions!<\/p>\n<\/div>\n

                  \n

                  Analysis of the Solution<\/h3>\n

                  We can also use a calculator to find permutations. For this problem, we would enter 15, press the [latex]{}_{n}{P}_{r}[\/latex]\u00a0function, enter 12, and then press the equal sign. The [latex]{}_{n}{P}_{r}[\/latex]\u00a0function may be located under the MATH menu with probability commands.<\/p>\n<\/div>\n

                  \n

                  Q & A<\/h3>\n

                  Could we have solved \u00a0using the Multiplication Principle?<\/h3>\n

                  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] to find the same answer<\/em>.<\/p>\n<\/div>\n

                  A play has a cast of 7 actors preparing to make their curtain call. Use the permutation formula to find the following.<\/p>\n

                  \n

                  Try It 6<\/h3>\n

                  How many ways can the 7 actors line up?<\/p>\n

                  Solution<\/a><\/p>\n<\/div>\n

                  \n

                  Try It 7<\/h3>\n

                  How many ways can 5 of the 7 actors be chosen to line up?<\/p>\n

                  Solution<\/a><\/p>\n<\/div>\n\n\t\t\t

                  \n\t\t\t

                  Candela Citations<\/h3>\n\t\t\t\t\t
                  \n\t\t\t\t\t\t
                  \n\t\t\t\t\t\t\t
                  CC licensed content, Specific attribution<\/div>