{"id":69,"date":"2019-08-02T10:11:16","date_gmt":"2019-08-02T14:11:16","guid":{"rendered":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/chapter\/5-3-permutations\/"},"modified":"2023-11-27T14:19:25","modified_gmt":"2023-11-27T19:19:25","slug":"5-3-permutations","status":"publish","type":"chapter","link":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/chapter\/5-3-permutations\/","title":{"raw":"5.3. Permutations","rendered":"5.3. Permutations"},"content":{"raw":"[Latexpage]\n

Permutations<\/h1>\nIn a previous example, we were asked to find the word sequences formed by using the letters {A<\/em>,B<\/em>,C<\/em>} if no letter is to be repeated. The tree diagram gave us the following six arrangements:\n\nABC<\/em>, ACB<\/em>, BAC<\/em>, BCA<\/em>, CAB<\/em>, and CBA<\/em>\n\nArrangements like these, where order is important and no element is repeated, are called permutations.\n\n \n
Permutations<\/strong>: A permutation of a set of elements is an ordered arrangement where each element is used once.<\/div>\n \n
\n

Example 5.3.1<\/p>\n\n<\/header>\n

How many three-letter word sequences can be formed using the letters {A<\/em>, B<\/em>, C<\/em>, D<\/em>}?<\/div>\n
Solution <\/strong><\/div>\n
\n\nThere are four choices for the first letter of our word, three choices for the second letter, and two choices for the third.\n\n\n\n
4<\/td>\n3<\/td>\n2<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\nApplying the multiplication axiom, we get 4 \u00b7 3 \u00b7 2 = 24 different arrangements.<\/span>\n\n<\/div>\n<\/div>\n \n
\n

Example 5.3.2<\/p>\n\n<\/header>\n

How many permutations of the letters of the word ARTICLE have consonants in the first and last positions?<\/div>\n
Solution<\/strong><\/div>\n
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:<\/div>\n
\n\n\n\n
4<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Since there are no more restrictions, we can go ahead and make the choices for the rest of the positions. <\/span>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:<\/span><\/p>\n\n<\/div>\n

\n\n\n\n
4<\/td>\n5<\/td>\n4<\/td>\n3<\/td>\n2<\/td>\n1<\/td>\n3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\nSo the total permutations are 4 \u00b7 5 \u00b7 4 \u00b7 3 \u00b7 2 \u00b7 1 \u00b7 3 = 1440.<\/span>\n\n<\/div>\n<\/div>\n \n
\n

Example 5.3.3<\/p>\n\n<\/header>\n

Given five letters {A<\/em>, B<\/em>, C<\/em>, D<\/em>, E<\/em>}. Find the following:<\/div>\n
a.<\/strong> The number of four-letter word sequences.<\/div>\n
b.<\/strong> The number of three-letter word sequences.<\/div>\n
c.<\/strong> The number of two-letter word sequences.<\/div>\n
Solution <\/strong><\/div>\n
The problem is easily solved by the multiplication axiom, and answers are as follows:<\/div>\n
a.<\/strong> The number of four-letter word sequences is 5 \u00b7 4 \u00b7 3 \u00b7 2 = 120.<\/div>\n
b.<\/strong> The number of three-letter word sequences is 5 \u00b7 4 \u00b7 3 = 60.<\/div>\n
c.<\/strong> The number of two-letter word sequences is 5 \u00b7 4 = 20.<\/div>\n
We often encounter situations where we have a set of n<\/em> objects and we are selecting r<\/em> objects to form permutations. We refer to this as permutations of<\/strong> n<\/strong><\/em> objects taken<\/strong> r<\/em> at a time<\/strong>, and we write it as n<\/em>Pr<\/strong>.<\/div>\n
Therefore, this example can also be answered as listed below:<\/div>\n

a.<\/strong> The number of four-letter word sequences is 5P<\/em>4 = 120.<\/p>\n

b.<\/strong> The number of three-letter word sequences is 5<\/span>P<\/em>3 = 60.<\/span><\/p>\n

c.<\/strong> The number of two-letter word sequences is 5<\/span>P<\/em>2 = 20.<\/span><\/p>\n\n<\/div>\n \n\nBefore we give a formula for n<\/em>Pr<\/em>, we'd like to introduce a symbol that we will use a great deal in this as well as in the next chapter.\n\n \n

\n\nFactorial<\/strong>: n<\/em>! = n<\/em>(n <\/em>\u2212 1)(n <\/em>\u2212 2)(n <\/em>\u2212 3)\u00b7\u00b7\u00b7 3 \u00b7 2 \u00b7 1.\n\nWhere n<\/em> is a natural number.\n

0! = 1<\/p>\n\n<\/div>\n \n

Now we define n<\/em>Pr<\/em>.<\/p>\n \n

\n

The Number of Permutations of n<\/em> Objects Taken r<\/em> at a Time<\/strong>:<\/p>\n

n<\/em>Pr<\/em> = n<\/em>(n<\/em> \u2212 1)(n <\/em>\u2212 2)(n<\/em> \u2212 3)\u00b7\u00b7\u00b7(n<\/em> \u2212 r<\/em> +1), or<\/p>\n

n<\/em>Pr<\/em> = $\\frac{n!}{(n-r)!}$<\/p>\n

Where n<\/em> and r<\/em> are natural numbers.<\/p>\n\n<\/div>\n \n

The reader should become familiar with both formulas and should feel comfortable in applying either.<\/p>\n \n

\n

Example 5.3.4<\/p>\n\n<\/header>\n

Compute the following using both formulas.<\/div>\n
a.<\/strong> 6P3<\/div>\n
b.<\/strong> 7P2<\/div>\n
Solution <\/strong><\/div>\n
We will identify n<\/em> and r<\/em> in each case and solve using the formulas provided.<\/div>\n
a. 6P<\/em>3 = 6 \u00b7 5 \u00b7 4 = 120, alternately 6P<\/em>3 = $\\frac{6!}{(6-3)!}$ = $\\frac{6!}{3!}$ = $\\frac{6\\cdot5\\cdot4\\cdot3\\cdot2\\cdot1}{3\\cdot2\\cdot1}$ = 120<\/div>\n
b. 7P<\/em>2 = 7 \u00b7 6 = 42, or 7P<\/em>2 = $\\frac{7!}{5!}$ = $\\frac{7\\cdot6\\cdot5\\cdot4\\cdot3\\cdot2\\cdot1}{5\\cdot4\\cdot3\\cdot2\\cdot1}$ = 42<\/div>\n<\/div>\n \n

Next we consider some more permutation problems to get further insight into these concepts.<\/p>\n \n

\n

Example 5.3.5<\/p>\n\n<\/header>\n

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?<\/div>\n
Solution <\/strong><\/div>\n
Let us suppose we have four people A<\/em>, B<\/em>, C<\/em>, and D<\/em>. Further suppose that A<\/em> and B<\/em> want to sit together. For the sake of argument, we tie A<\/em> and B<\/em> together and treat them as one person. The four people are $\\fbox{AB}$ CD<\/em> . Since $\\fbox{AB}$ is treated as one person, we have the following possible arrangements:<\/div>\n
$\\fbox{AB}$ CD\u00a0 ,\u00a0 $\\fbox{AB}$ DC\u00a0 ,\u00a0 C $\\fbox{AB}$ D\u00a0 ,\u00a0 D $\\fbox{AB}$ C\u00a0 ,\u00a0 CD $\\fbox{AB}$\u00a0 ,\u00a0 DC $\\fbox{AB}$<\/div>\n
Note that there are six more such permutations because A<\/em> and B<\/em> could also be tied in the order BA<\/em>. And they are:<\/div>\n
$\\fbox{BA}$ CD\u00a0 ,\u00a0 $\\fbox{BA}$ DC\u00a0 ,\u00a0 C $\\fbox{BA}$ D\u00a0 ,\u00a0 D $\\fbox{BA}$ C\u00a0 ,\u00a0 CD $\\fbox{BA}$\u00a0 ,\u00a0 DC $\\fbox{BA}$<\/div>\n
So altogether there are 12 different permutations.<\/div>\n
Let us now do the problem using the multiplication axiom.<\/span><\/div>\n
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.<\/span><\/div>\n<\/div>\n \n
\n

Example 5.3.6<\/p>\n\n<\/header>\n

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?<\/div>\n
Solution <\/strong><\/div>\n
We first do the problem using the multiplication axiom.<\/div>\n
Since the math books go in the first three slots, there are 4 choices for the first slot, 3 for the second and 2 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:<\/div>\n
\n\n\n\n
4<\/td>\n3<\/td>\n2<\/td>\n5<\/td>\n4<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
Therefore, the number of permutations are 4 \u00b7 3 \u00b7 2 \u00b7 5 \u00b7 4 = 480. Alternately, we can see that 4 \u00b7 3 \u00b7 2 is really same as 4<\/span>P<\/em>3, and 5 \u00b7 4 is 5<\/span>P<\/em>2. So the answer can be written as (4<\/span>P<\/em>3) (5<\/span>P<\/em>2) = 480.<\/span><\/div>\n<\/div>\n \n

Clearly, this makes sense. For every permutation of three math books placed in the first three slots, there are 5P<\/em>2 permutations of history books that can be placed in the last two slots. Hence the multiplication axiom applies, and we have the answer (4P<\/em>3) (5P<\/em>2). We summarize.<\/p>\n\n

    \n \t
  1. Permutations<\/strong>: A permutation of a set of elements is an ordered arrangement where each element is used once.<\/li>\n \t
  2. Factorial<\/strong>: n<\/em>! = n<\/em>(n <\/em>\u2212 1)(n <\/em>\u2212 2)(n <\/em>\u2212 3)\u00b7\u00b7\u00b73 \u00b7 2 \u00b7 1. Where n<\/em> is a natural number.\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00! = 1<\/li>\n \t
  3. Permutations of n<\/em> Objects Taken r<\/em> at a Time<\/strong>: <\/span>n<\/em>Pr<\/em> = <\/span>n<\/em>(<\/span>n <\/em>\u2212 1)(<\/span>n <\/em>\u2212 2)(<\/span>n <\/em>\u2212 3)\u00b7\u00b7\u00b7(<\/span>n <\/em>\u2212 <\/span>r<\/em> + 1), or <\/span>n<\/em>Pr<\/em> = $\\frac{n!}{(n-r)!}$. <\/span>Where n<\/em> and <\/span>r<\/em> are natural numbers.<\/span><\/li>\n<\/ol>\n \n

    Circular Permutations and Permutations with Similar Elements<\/strong><\/h1>\nIn this section we will address the following two problems.\n
      \n \t
    1. In how many different ways can five people be seated in a circle?<\/li>\n \t
    2. In how many different ways can the letters of the word MISSISSIPPI be arranged?<\/li>\n<\/ol>\nThe first problem comes under the category of Circular Permutations<\/em>, and the second under Permutations with Similar Elements<\/em>.\n\n \n\nCircular Permutations <\/strong>\n\nSuppose we have three people named A<\/em>, B<\/em>, and C<\/em>. We have already determined that they can be seated in a straight line in 3! or 6 ways. Our next problem is to see how many ways these people can be seated in a circle. We draw a diagram:\n
      \\begin{tikzpicture}[thick]\n\\draw (0,0) circle (1) node[below,shift={(-1.2,0.5)}] {$\\bm{A}$};\n\\draw (4,0) circle (1) node[below,shift={(1.2,0.5)}] {$\\bm{A}$};\\node at (.7,0.2) {B};\n\\node at (2.7,0.2) {B};\n\\node at (0,-1.3) {C};\n\\node at (4,-1.3) {C};\n\\end{tikzpicture}<\/div>\nIt happens that there are only two ways we can seat three people in a circle. This kind of permutation is called a circular permutation. In such cases, no matter where the first person sits, the permutation is not affected. Each person can shift as many places as they like, and the permutation will not be changed. Imagine the people on a merry-go-round; the rotation of the permutation does not generate a new permutation. So in circular permutations, the first person is considered a place holder, and where he sits does not matter.\n\n \n
      Circular Permutations<\/strong>: The number of permutations of n<\/em> elements in a circle is (n<\/em> \u2212 1)!<\/div>\n \n
      \n

      Example 5.3.7<\/p>\n\n<\/header>\n

      In how many different ways can five people be seated at a circular table?<\/div>\n
      Solution<\/strong><\/div>\n
      We have already determined that the first person is just a place holder. Therefore, there is only one choice for the first spot. We have:<\/span><\/div>\n
      \n\n\n\n
      1<\/td>\n4<\/td>\n3<\/td>\n2<\/td>\n1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
      So the answer is 24.<\/div>\n<\/div>\n \n
      \n

      Example 5.3.8<\/p>\n\n<\/header>\n

      In how many ways can four couples be seated at a round table if the men and women want to sit alternately?<\/div>\n
      Solution <\/strong><\/div>\n
      \n\nWe again emphasize that the first person can sit anywhere without affecting the permutation. So there is only one choice for the first spot. Suppose a man sat down first. The chair next to it must belong to a woman, and there are 4 choices. The next chair belongs to a man, so there are three choices and so on. We list the choices below.\n
      \n\n\n\n
      1<\/td>\n4<\/td>\n3<\/td>\n3<\/td>\n2<\/td>\n2<\/td>\n1<\/td>\n1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\nSo the answer is 144.\n\n<\/div>\n<\/div>\n \n\nNow we address the second problem.\n\n \n\nPermutations with Similar Elements<\/strong>\n\nLet us determine the number of distinguishable permutations of the letters ELEMENT.\n\nSuppose we make all of the letters different by labeling the letters as follows.\n

      E1<\/sub>LE2<\/sub>ME3<\/sub>NT<\/p>\nSince all the letters are now different, there are 7! different permutations.\n\nLet us now look at one such permutation, say:\n

      LE1<\/sub>ME2<\/sub>NE3<\/sub>T<\/p>\nSuppose we form new permutations from this arrangement by only moving the E's. Clearly, there are 3! or 6 such arrangements. We list them below:\n

      LE1<\/sub>ME2<\/sub>NE3<\/sub>T\nLE1<\/sub>ME3<\/sub>NE2<\/sub>T\nLE2<\/sub>ME1<\/sub>NE3<\/sub>T\nLE3<\/sub>ME3<\/sub>NE1<\/sub>T\nLE3<\/sub>ME2<\/sub>NE1<\/sub>T\nLE3<\/sub>ME1<\/sub>NE2<\/sub>T<\/p>\n

      Because the E's are not different, there is only one arrangement LEMENET and not six. This is true for every permutation.<\/p>\n

      Let us suppose there are n<\/em> different permutations of the letters ELEMENT. Then there are n <\/em>\u00b7 3! permutations of the letters E1<\/sub>LE2<\/sub>ME3<\/sub>NT. But we know there are 7! permutations of the letters E1<\/sub>LE2<\/sub>ME3<\/sub>NT. Therefore: n <\/em>\u00b7 3! = 7!<\/p>\n

      Or n<\/em> = $\\frac{7!}{3!}$.<\/p>\n

      This gives us the method we are looking for.<\/p>\n \n

      \n

      Permutations with Similar Elements<\/strong>:<\/p>\n

      The number of permutations of n<\/em> elements taken n<\/em> at a time, with r<\/em>1<\/sub> elements of one kind, r<\/em>2<\/sub> elements of another kind, and so on, is $\\frac{n!}{r_1!r_2!...r_k!}$<\/p>\n\n<\/div>\n \n

      \n

      Example 5.3.9<\/p>\n\n<\/header>\n

      Find the number of different permutations of the letters of the word MISSISSIPPI.<\/div>\n
      Solution <\/strong><\/div>\n
      The word MISSISSIPPI has 11 letters. If the letters were all different there would have been 11! different permutations. But MISSISSIPPI has 4 S's, 4 I's, and 2 P's that are alike.<\/div>\n
      So the answer is $\\frac{11!}{4!4!2!}$<\/div>\n
      Which equals 34,650.<\/div>\n<\/div>\n \n
      <\/div>\n
      \n

      Example 5.3.10<\/p>\n\n<\/header>\n

      If a coin is tossed six times, how many different outcomes consisting of 4 heads and 2 tails are there?<\/div>\n
      Solution <\/strong><\/div>\n
      Again, we have permutations with similar elements. We are looking for permutations for the letters HHHHTT.<\/div>\n
      The answer is $\\frac{6!}{4!2!} = 15$.<\/div>\n<\/div>\n \n
      \n

      Example 5.3.11<\/p>\n\n<\/header>\n

      In how many different ways can 4 nickels, 3 dimes, and 2 quarters be arranged in a row?<\/div>\n
      Solution <\/strong><\/div>\n
      Assuming that all nickels are similar, all dimes are similar, and all quarters are similar, we have permutations with similar elements. Therefore, the answer is:<\/div>\n
      $\\frac{9!}{4!3!2!} = 1260$<\/div>\n<\/div>\n \n
      \n

      Example 5.3.12<\/p>\n\n<\/header>\n

      A stock broker wants to assign 20 new clients equally to 4 of its salespeople. In how many different ways can this be done?<\/div>\n
      Solution <\/strong><\/div>\n
      This means that each sales person gets 5 clients. The problem can be thought of as an ordered partitions problem. In that case, using the formula we get:<\/div>\n
      $\\frac{20!}{5!5!5!5!} = 11,732,745,024$<\/div>\n<\/div>\n \n

      We summarize:<\/p>\n\n

        \n \t
      1. Circular Permutations<\/strong>: The number of permutations of n<\/em> elements in a circle is (n <\/em>\u2212 1)!<\/li>\n \t
      2. Permutations with Similar Elements<\/strong>: The number of permutations of n<\/em> elements taken n<\/em> at a time, with r<\/em>1<\/sub> elements of one kind, r<\/em>2<\/sub> elements of another kind, and so on, such that n<\/em> = r<\/em>1<\/sub> + r<\/em>2<\/sub> +\u00b7\u00b7\u00b7+ r<\/em>k<\/sub> is<\/li>\n<\/ol>\n

        $\\frac{n!}{r_1!r_2!\u00b7\u00b7\u00b7r_k!}$<\/p>\n

        This is also referred to as ordered partitions<\/strong>.<\/p>\n \n

        Practice questions<\/h1>\n1.<\/strong> A group of 15 people who are members of a volunteer club wish to choose a chair and a secretary. How many different ways can this be done?\n\n2.<\/strong> How many permutations of the letters of the word SECURITY end in a consonant?\n\n3.<\/strong> In how many different ways can five people be seated in a row if two of them insist on sitting next to each other?\n\n4.<\/strong> In how many ways can 3 English, 3 history, and 2 math books be set on a shelf, if the English books are set on the left, history books in the middle, and math books on the right?\n\n5.<\/strong> Find the number of different permutations of the letters of the word MASSACHUSETTS.\n\n6.<\/strong> If a team plays 10 games, how many different outcomes of 6 wins, and 4 losses are possible?\n\n7.\u00a0<\/strong>You and six other classmates decide to take a group selfie photo:\n

        a.\u00a0<\/strong>How many different arrangements are possible?<\/p>\n

        b.\u00a0<\/strong>How many different arrangements are possible if you insist on being in the middle of the photo?<\/p>\n

        c.\u00a0<\/strong>How many different arrangements are possible if one of your friends insists on being at the right of the photo, and two other friends insist on standing beside each other?<\/p>\n ","rendered":"

        Permutations<\/h1>\n

        In a previous example, we were asked to find the word sequences formed by using the letters {A<\/em>,B<\/em>,C<\/em>} if no letter is to be repeated. The tree diagram gave us the following six arrangements:<\/p>\n

        ABC<\/em>, ACB<\/em>, BAC<\/em>, BCA<\/em>, CAB<\/em>, and CBA<\/em><\/p>\n

        Arrangements like these, where order is important and no element is repeated, are called permutations.<\/p>\n

         <\/p>\n

        Permutations<\/strong>: A permutation of a set of elements is an ordered arrangement where each element is used once.<\/div>\n

         <\/p>\n

        \n
        \n

        Example 5.3.1<\/p>\n<\/header>\n

        How many three-letter word sequences can be formed using the letters {A<\/em>, B<\/em>, C<\/em>, D<\/em>}?<\/div>\n
        Solution <\/strong><\/div>\n
        \n

        There are four choices for the first letter of our word, three choices for the second letter, and two choices for the third.<\/p>\n\n\n\n
        4<\/td>\n3<\/td>\n2<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

        Applying the multiplication axiom, we get 4 \u00b7 3 \u00b7 2 = 24 different arrangements.<\/span><\/p>\n<\/div>\n<\/div>\n

         <\/p>\n

        \n
        \n

        Example 5.3.2<\/p>\n<\/header>\n

        How many permutations of the letters of the word ARTICLE have consonants in the first and last positions?<\/div>\n
        Solution<\/strong><\/div>\n
        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:<\/div>\n
        \n\n\n\n
        4<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n<\/td>\n3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

        Since there are no more restrictions, we can go ahead and make the choices for the rest of the positions. <\/span>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:<\/span><\/p>\n<\/div>\n

        \n\n\n\n
        4<\/td>\n5<\/td>\n4<\/td>\n3<\/td>\n2<\/td>\n1<\/td>\n3<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

        So the total permutations are 4 \u00b7 5 \u00b7 4 \u00b7 3 \u00b7 2 \u00b7 1 \u00b7 3 = 1440.<\/span><\/p>\n<\/div>\n<\/div>\n

         <\/p>\n

        \n
        \n

        Example 5.3.3<\/p>\n<\/header>\n

        Given five letters {A<\/em>, B<\/em>, C<\/em>, D<\/em>, E<\/em>}. Find the following:<\/div>\n
        a.<\/strong> The number of four-letter word sequences.<\/div>\n
        b.<\/strong> The number of three-letter word sequences.<\/div>\n
        c.<\/strong> The number of two-letter word sequences.<\/div>\n
        Solution <\/strong><\/div>\n
        The problem is easily solved by the multiplication axiom, and answers are as follows:<\/div>\n
        a.<\/strong> The number of four-letter word sequences is 5 \u00b7 4 \u00b7 3 \u00b7 2 = 120.<\/div>\n
        b.<\/strong> The number of three-letter word sequences is 5 \u00b7 4 \u00b7 3 = 60.<\/div>\n
        c.<\/strong> The number of two-letter word sequences is 5 \u00b7 4 = 20.<\/div>\n
        We often encounter situations where we have a set of n<\/em> objects and we are selecting r<\/em> objects to form permutations. We refer to this as permutations of<\/strong> n<\/strong><\/em> objects taken<\/strong> r<\/em> at a time<\/strong>, and we write it as n<\/em>Pr<\/strong>.<\/div>\n
        Therefore, this example can also be answered as listed below:<\/div>\n

        a.<\/strong> The number of four-letter word sequences is 5P<\/em>4 = 120.<\/p>\n

        b.<\/strong> The number of three-letter word sequences is 5<\/span>P<\/em>3 = 60.<\/span><\/p>\n

        c.<\/strong> The number of two-letter word sequences is 5<\/span>P<\/em>2 = 20.<\/span><\/p>\n<\/div>\n

         <\/p>\n

        Before we give a formula for n<\/em>Pr<\/em>, we’d like to introduce a symbol that we will use a great deal in this as well as in the next chapter.<\/p>\n

         <\/p>\n

        \n

        Factorial<\/strong>: n<\/em>! = n<\/em>(n <\/em>\u2212 1)(n <\/em>\u2212 2)(n <\/em>\u2212 3)\u00b7\u00b7\u00b7 3 \u00b7 2 \u00b7 1.<\/p>\n

        Where n<\/em> is a natural number.<\/p>\n

        0! = 1<\/p>\n<\/div>\n

         <\/p>\n

        Now we define n<\/em>Pr<\/em>.<\/p>\n

         <\/p>\n

        \n

        The Number of Permutations of n<\/em> Objects Taken r<\/em> at a Time<\/strong>:<\/p>\n

        n<\/em>Pr<\/em> = n<\/em>(n<\/em> \u2212 1)(n <\/em>\u2212 2)(n<\/em> \u2212 3)\u00b7\u00b7\u00b7(n<\/em> \u2212 r<\/em> +1), or<\/p>\n

        n<\/em>Pr<\/em> = \"\frac{n!}{(n-r)!}\"<\/p>\n

        Where n<\/em> and r<\/em> are natural numbers.<\/p>\n<\/div>\n

         <\/p>\n

        The reader should become familiar with both formulas and should feel comfortable in applying either.<\/p>\n

         <\/p>\n

        \n
        \n

        Example 5.3.4<\/p>\n<\/header>\n

        Compute the following using both formulas.<\/div>\n
        a.<\/strong> 6P3<\/div>\n
        b.<\/strong> 7P2<\/div>\n
        Solution <\/strong><\/div>\n
        We will identify n<\/em> and r<\/em> in each case and solve using the formulas provided.<\/div>\n
        a. 6P<\/em>3 = 6 \u00b7 5 \u00b7 4 = 120, alternately 6P<\/em>3 = \"\frac{6!}{(6-3)!}\" = \"\frac{6!}{3!}\" = \"\frac{6\cdot5\cdot4\cdot3\cdot2\cdot1}{3\cdot2\cdot1}\" = 120<\/div>\n
        b. 7P<\/em>2 = 7 \u00b7 6 = 42, or 7P<\/em>2 = \"\frac{7!}{5!}\" = \"\frac{7\cdot6\cdot5\cdot4\cdot3\cdot2\cdot1}{5\cdot4\cdot3\cdot2\cdot1}\" = 42<\/div>\n<\/div>\n

         <\/p>\n

        Next we consider some more permutation problems to get further insight into these concepts.<\/p>\n

         <\/p>\n

        \n
        \n

        Example 5.3.5<\/p>\n<\/header>\n

        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?<\/div>\n
        Solution <\/strong><\/div>\n
        Let us suppose we have four people A<\/em>, B<\/em>, C<\/em>, and D<\/em>. Further suppose that A<\/em> and B<\/em> want to sit together. For the sake of argument, we tie A<\/em> and B<\/em> together and treat them as one person. The four people are \"\fbox{AB}\" CD<\/em> . Since \"\fbox{AB}\" is treated as one person, we have the following possible arrangements:<\/div>\n
        \"\fbox{AB}\" CD\u00a0 ,\u00a0 \"\fbox{AB}\" DC\u00a0 ,\u00a0 C \"\fbox{AB}\" D\u00a0 ,\u00a0 D \"\fbox{AB}\" C\u00a0 ,\u00a0 CD \"\fbox{AB}\"\u00a0 ,\u00a0 DC \"\fbox{AB}\"<\/div>\n
        Note that there are six more such permutations because A<\/em> and B<\/em> could also be tied in the order BA<\/em>. And they are:<\/div>\n
        \"\fbox{BA}\" CD\u00a0 ,\u00a0 \"\fbox{BA}\" DC\u00a0 ,\u00a0 C \"\fbox{BA}\" D\u00a0 ,\u00a0 D \"\fbox{BA}\" C\u00a0 ,\u00a0 CD \"\fbox{BA}\"\u00a0 ,\u00a0 DC \"\fbox{BA}\"<\/div>\n
        So altogether there are 12 different permutations.<\/div>\n
        Let us now do the problem using the multiplication axiom.<\/span><\/div>\n
        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.<\/span><\/div>\n<\/div>\n

         <\/p>\n

        \n
        \n

        Example 5.3.6<\/p>\n<\/header>\n

        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?<\/div>\n
        Solution <\/strong><\/div>\n
        We first do the problem using the multiplication axiom.<\/div>\n
        Since the math books go in the first three slots, there are 4 choices for the first slot, 3 for the second and 2 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:<\/div>\n
        \n\n\n\n
        4<\/td>\n3<\/td>\n2<\/td>\n5<\/td>\n4<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
        Therefore, the number of permutations are 4 \u00b7 3 \u00b7 2 \u00b7 5 \u00b7 4 = 480. Alternately, we can see that 4 \u00b7 3 \u00b7 2 is really same as 4<\/span>P<\/em>3, and 5 \u00b7 4 is 5<\/span>P<\/em>2. So the answer can be written as (4<\/span>P<\/em>3) (5<\/span>P<\/em>2) = 480.<\/span><\/div>\n<\/div>\n

         <\/p>\n

        Clearly, this makes sense. For every permutation of three math books placed in the first three slots, there are 5P<\/em>2 permutations of history books that can be placed in the last two slots. Hence the multiplication axiom applies, and we have the answer (4P<\/em>3) (5P<\/em>2). We summarize.<\/p>\n

          \n
        1. Permutations<\/strong>: A permutation of a set of elements is an ordered arrangement where each element is used once.<\/li>\n
        2. Factorial<\/strong>: n<\/em>! = n<\/em>(n <\/em>\u2212 1)(n <\/em>\u2212 2)(n <\/em>\u2212 3)\u00b7\u00b7\u00b73 \u00b7 2 \u00b7 1. Where n<\/em> is a natural number.\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00! = 1<\/li>\n
        3. Permutations of n<\/em> Objects Taken r<\/em> at a Time<\/strong>: <\/span>n<\/em>Pr<\/em> = <\/span>n<\/em>(<\/span>n <\/em>\u2212 1)(<\/span>n <\/em>\u2212 2)(<\/span>n <\/em>\u2212 3)\u00b7\u00b7\u00b7(<\/span>n <\/em>\u2212 <\/span>r<\/em> + 1), or <\/span>n<\/em>Pr<\/em> = \"\frac{n!}{(n-r)!}\". <\/span>Where n<\/em> and <\/span>r<\/em> are natural numbers.<\/span><\/li>\n<\/ol>\n

           <\/p>\n

          Circular Permutations and Permutations with Similar Elements<\/strong><\/h1>\n

          In this section we will address the following two problems.<\/p>\n

            \n
          1. In how many different ways can five people be seated in a circle?<\/li>\n
          2. In how many different ways can the letters of the word MISSISSIPPI be arranged?<\/li>\n<\/ol>\n

            The first problem comes under the category of Circular Permutations<\/em>, and the second under Permutations with Similar Elements<\/em>.<\/p>\n

             <\/p>\n

            Circular Permutations <\/strong><\/p>\n

            Suppose we have three people named A<\/em>, B<\/em>, and C<\/em>. We have already determined that they can be seated in a straight line in 3! or 6 ways. Our next problem is to see how many ways these people can be seated in a circle. We draw a diagram:<\/p>\n

            \n

            \"Rendered<\/p>\n<\/div>\n

            It happens that there are only two ways we can seat three people in a circle. This kind of permutation is called a circular permutation. In such cases, no matter where the first person sits, the permutation is not affected. Each person can shift as many places as they like, and the permutation will not be changed. Imagine the people on a merry-go-round; the rotation of the permutation does not generate a new permutation. So in circular permutations, the first person is considered a place holder, and where he sits does not matter.<\/p>\n

             <\/p>\n

            Circular Permutations<\/strong>: The number of permutations of n<\/em> elements in a circle is (n<\/em> \u2212 1)!<\/div>\n

             <\/p>\n

            \n
            \n

            Example 5.3.7<\/p>\n<\/header>\n

            In how many different ways can five people be seated at a circular table?<\/div>\n
            Solution<\/strong><\/div>\n
            We have already determined that the first person is just a place holder. Therefore, there is only one choice for the first spot. We have:<\/span><\/div>\n
            \n\n\n\n
            1<\/td>\n4<\/td>\n3<\/td>\n2<\/td>\n1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
            So the answer is 24.<\/div>\n<\/div>\n

             <\/p>\n

            \n
            \n

            Example 5.3.8<\/p>\n<\/header>\n

            In how many ways can four couples be seated at a round table if the men and women want to sit alternately?<\/div>\n
            Solution <\/strong><\/div>\n
            \n

            We again emphasize that the first person can sit anywhere without affecting the permutation. So there is only one choice for the first spot. Suppose a man sat down first. The chair next to it must belong to a woman, and there are 4 choices. The next chair belongs to a man, so there are three choices and so on. We list the choices below.<\/p>\n

            \n\n\n\n
            1<\/td>\n4<\/td>\n3<\/td>\n3<\/td>\n2<\/td>\n2<\/td>\n1<\/td>\n1<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n

            So the answer is 144.<\/p>\n<\/div>\n<\/div>\n

             <\/p>\n

            Now we address the second problem.<\/p>\n

             <\/p>\n

            Permutations with Similar Elements<\/strong><\/p>\n

            Let us determine the number of distinguishable permutations of the letters ELEMENT.<\/p>\n

            Suppose we make all of the letters different by labeling the letters as follows.<\/p>\n

            E1<\/sub>LE2<\/sub>ME3<\/sub>NT<\/p>\n

            Since all the letters are now different, there are 7! different permutations.<\/p>\n

            Let us now look at one such permutation, say:<\/p>\n

            LE1<\/sub>ME2<\/sub>NE3<\/sub>T<\/p>\n

            Suppose we form new permutations from this arrangement by only moving the E’s. Clearly, there are 3! or 6 such arrangements. We list them below:<\/p>\n

            LE1<\/sub>ME2<\/sub>NE3<\/sub>T
            \nLE1<\/sub>ME3<\/sub>NE2<\/sub>T
            \nLE2<\/sub>ME1<\/sub>NE3<\/sub>T
            \nLE3<\/sub>ME3<\/sub>NE1<\/sub>T
            \nLE3<\/sub>ME2<\/sub>NE1<\/sub>T
            \nLE3<\/sub>ME1<\/sub>NE2<\/sub>T<\/p>\n

            Because the E’s are not different, there is only one arrangement LEMENET and not six. This is true for every permutation.<\/p>\n

            Let us suppose there are n<\/em> different permutations of the letters ELEMENT. Then there are n <\/em>\u00b7 3! permutations of the letters E1<\/sub>LE2<\/sub>ME3<\/sub>NT. But we know there are 7! permutations of the letters E1<\/sub>LE2<\/sub>ME3<\/sub>NT. Therefore: n <\/em>\u00b7 3! = 7!<\/p>\n

            Or n<\/em> = \"\frac{7!}{3!}\".<\/p>\n

            This gives us the method we are looking for.<\/p>\n

             <\/p>\n

            \n

            Permutations with Similar Elements<\/strong>:<\/p>\n

            The number of permutations of n<\/em> elements taken n<\/em> at a time, with r<\/em>1<\/sub> elements of one kind, r<\/em>2<\/sub> elements of another kind, and so on, is \"\frac{n!}{r_1!r_2!...r_k!}\"<\/p>\n<\/div>\n

             <\/p>\n

            \n
            \n

            Example 5.3.9<\/p>\n<\/header>\n

            Find the number of different permutations of the letters of the word MISSISSIPPI.<\/div>\n
            Solution <\/strong><\/div>\n
            The word MISSISSIPPI has 11 letters. If the letters were all different there would have been 11! different permutations. But MISSISSIPPI has 4 S’s, 4 I’s, and 2 P’s that are alike.<\/div>\n
            So the answer is \"\frac{11!}{4!4!2!}\"<\/div>\n
            Which equals 34,650.<\/div>\n<\/div>\n

             <\/p>\n

            <\/div>\n
            \n
            \n

            Example 5.3.10<\/p>\n<\/header>\n

            If a coin is tossed six times, how many different outcomes consisting of 4 heads and 2 tails are there?<\/div>\n
            Solution <\/strong><\/div>\n
            Again, we have permutations with similar elements. We are looking for permutations for the letters HHHHTT.<\/div>\n
            The answer is \"\frac{6!}{4!2!} = 15\".<\/div>\n<\/div>\n

             <\/p>\n

            \n
            \n

            Example 5.3.11<\/p>\n<\/header>\n

            In how many different ways can 4 nickels, 3 dimes, and 2 quarters be arranged in a row?<\/div>\n
            Solution <\/strong><\/div>\n
            Assuming that all nickels are similar, all dimes are similar, and all quarters are similar, we have permutations with similar elements. Therefore, the answer is:<\/div>\n
            \"\frac{9!}{4!3!2!} = 1260\"<\/div>\n<\/div>\n

             <\/p>\n

            \n
            \n

            Example 5.3.12<\/p>\n<\/header>\n

            A stock broker wants to assign 20 new clients equally to 4 of its salespeople. In how many different ways can this be done?<\/div>\n
            Solution <\/strong><\/div>\n
            This means that each sales person gets 5 clients. The problem can be thought of as an ordered partitions problem. In that case, using the formula we get:<\/div>\n
            \"\frac{20!}{5!5!5!5!} = 11,732,745,024\"<\/div>\n<\/div>\n

             <\/p>\n

            We summarize:<\/p>\n

              \n
            1. Circular Permutations<\/strong>: The number of permutations of n<\/em> elements in a circle is (n <\/em>\u2212 1)!<\/li>\n
            2. Permutations with Similar Elements<\/strong>: The number of permutations of n<\/em> elements taken n<\/em> at a time, with r<\/em>1<\/sub> elements of one kind, r<\/em>2<\/sub> elements of another kind, and so on, such that n<\/em> = r<\/em>1<\/sub> + r<\/em>2<\/sub> +\u00b7\u00b7\u00b7+ r<\/em>k<\/sub> is<\/li>\n<\/ol>\n

              \"\frac{n!}{r_1!r_2!···r_k!}\"<\/p>\n

              This is also referred to as ordered partitions<\/strong>.<\/p>\n

               <\/p>\n

              Practice questions<\/h1>\n

              1.<\/strong> A group of 15 people who are members of a volunteer club wish to choose a chair and a secretary. How many different ways can this be done?<\/p>\n

              2.<\/strong> How many permutations of the letters of the word SECURITY end in a consonant?<\/p>\n

              3.<\/strong> In how many different ways can five people be seated in a row if two of them insist on sitting next to each other?<\/p>\n

              4.<\/strong> In how many ways can 3 English, 3 history, and 2 math books be set on a shelf, if the English books are set on the left, history books in the middle, and math books on the right?<\/p>\n

              5.<\/strong> Find the number of different permutations of the letters of the word MASSACHUSETTS.<\/p>\n

              6.<\/strong> If a team plays 10 games, how many different outcomes of 6 wins, and 4 losses are possible?<\/p>\n

              7.\u00a0<\/strong>You and six other classmates decide to take a group selfie photo:<\/p>\n

              a.\u00a0<\/strong>How many different arrangements are possible?<\/p>\n

              b.\u00a0<\/strong>How many different arrangements are possible if you insist on being in the middle of the photo?<\/p>\n

              c.\u00a0<\/strong>How many different arrangements are possible if one of your friends insists on being at the right of the photo, and two other friends insist on standing beside each other?<\/p>\n

               <\/p>\n","protected":false},"author":2,"menu_order":3,"template":"","meta":{"pb_show_title":"","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[49],"contributor":[],"license":[],"class_list":["post-69","chapter","type-chapter","status-publish","hentry","chapter-type-numberless"],"part":64,"_links":{"self":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapters\/69","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/wp\/v2\/users\/2"}],"version-history":[{"count":1,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapters\/69\/revisions"}],"predecessor-version":[{"id":70,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapters\/69\/revisions\/70"}],"part":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/parts\/64"}],"metadata":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapters\/69\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/wp\/v2\/media?parent=69"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/pressbooks\/v2\/chapter-type?post=69"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/wp\/v2\/contributor?post=69"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/pressbooks.library.torontomu.ca\/pohmath\/wp-json\/wp\/v2\/license?post=69"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}