Lesson 1, Permutations

Lesson 1: Permutations
How do we find the permutations of objects? Suppose we have 6 different potted plants and
we wish to arrange 4 of them in a row. In how many ways can this be done?
We can determine the number of ways these plants can be arranged in a row if we arrange
only 4 of them at a time. Each possible arrangement is called a permutation.
The permutation of 6 potted plants taken 4 at a time is denoted by P(6, 4), 6P4 , P6,4 , or P46
Similarly, if there are n objects which will be arranged r at a time, it will be denoted by P(n, r)
The permutation of n objects taken r at a time is denoted by P(n, r). In some books, it is also
denoted by nPr, Pn,r , or nr P. In this learning material, we will use the first notation.
How do we find the number of permutations of n objects taken r at a time? Study the following
illustrations:
Example 1. Given the 4-letter word READ. In how many ways can we arrange its letters, 3
at a time?
Solution: There are 3 positions to be filled. We write the horizontal marks: _ _ _. On each
horizontal mark, we write the number of choices we have in filling up the said position. There
are 4 choices for the first position. After the first position is filled, there are 3 choices left for the
second position. After the first and second positions are filled, there are 2 choices left for the
third position. So the three entries on the horizontal marks would be
432
We apply the Fundamental Counting Principle and multiply:

4 ⋅ 3 ⋅ 2 = 24.
Thus, there are 24 possible ways of arranging the 4 letters of READ taking 3 of them at a time.
We also say the 4 letters of READ, taken 3 at a time, have 24 permutations. One of them is R-E-
D. Verify this result.
Let us take a second look at the example above.
Remember: n = 4, r = 3. 4 ⋅ 3 ⋅ 2 = n(n – 1)(n – 2)
Notice that the first factor is n, and the succeeding factors decrease by 1 each time. Look at the
last factor: n - 2 = n – (3 – 1) = n – (r – 1) or n – r + 1. Take note also that there are r factors in all,
starting with n.
Remember: The permutation of n objects taken r at a time is:
P(n, r) = n!/(n – r)! , n ≥ r
and the permutation of n objects taken all at a time is: P(n, n) = n!
Notice that, in the previous example, the objects to be arranged are all distinct. Suppose some
of the objects to be arranged are not distinct, that is, some are identical. Study the following
examples.
This leads to the next rule. The number of distinguishable permutations, P, of n objects where
p objects are alike, q objects are alike, r objects are alike, and so on, is P = n!/p! q! r!...
Let us now consider arrangement of objects in a circle, which we call circular permutations.
If there are 3 seats around the circular table, we can assign one of the persons to a fixed seat
and determine the number of ways that the other two can be arranged. This way, we avoid
counting again an arrangement that resulted from a mere rotation. Thus, the number of circular
permutations of 3 objects is (3 – 1)! or 2! and the circular permutations of n objects is (n – 1)!.
Observe that all the arrangements falling on the same column are just the same because the 4
people are supposed to be seated around a circular table. There are 24 arrangements in the list.
Again, the circular permutations, P, of 4 objects is:
P = 24 4
= 4! / 4
= 4 ⋅ 3! / 4
= 3!
Or simply, P = (n - 1)!
= (4 - 1)!
= 3!
=6
The permutation of n objects arranged in a circle is P = (n - 1)!
Activity #1
Solve for the unknown in each item.
1. P(6, 6) = ___
2. P(7, r) = 840
3. P(n, 3) = 60
4. P(n, 3) = 504
5. P(10, 5) = ___
Activity #2
Solve for the unknown in each item.
1. P(8, r) = 6 720
2. P(8, 3) = ___
3. P(n, 4) = 3024
4. P(12, r) = 1320
5. P(13, r) = 156
Activity #3
Answer each permutation problem completely.
1. A teacher wants to assign 4 different tasks to her 4 students. In how many possible ways
can she do it?
2. In a certain general assembly, three major prizes are at stake. In how many ways can the
first, second, and third prizes be drawn from a box containing 120 names?
3. In how many different ways can 5 bicycles be parked if there are 7 available parking
spaces?
4. How many distinguishable permutations are possible with all the letters of the word
ELLIPSES?
5. There are 8 basketball teams competing for the top 4 standings in order to move up to
the semi-finals. Find the number of possible rankings of the four top teams.
Activity #4
Answer each permutation problem completely.

1. In how many different ways can 12 people occupy the 12 seats in a front row of a mini-
theater?
2. Find the number of different ways that a family of 6 can be seated around a circular
table with 6 chairs.
3. How many 4-digit numbers can be formed from the digits 1, 3, 5, 6, 8, and 9 if no
repetition is allowed?
4. If there are 10 people and only 6 chairs are available, in how many ways can they be
seated?
5. Find the number of distinguishable permutations of the digits of the number 348 838.
Answer Keys:
Activity #1
1. 56
2. 6
3. 2 and 6
4. 1
5. 7
Activity #2
1. 3
2. 13
3. 3 and 8
4. 28
5. 1001
Activity #3
1. 66
2. 99
3. 2 598 960
4. 252
5. 126
Activity #4
1. 350
2. 1.037 x 1010
3. 3150
4. 315
5. 504

Lesson 1, Permutations

Uploaded by

Copyright:

Available Formats

Lesson 1, Permutations

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Lesson 1, Permutations

Uploaded by

Copyright:

Available Formats

Lesson 1: Permutations

We apply the Fundamental Counting Principle and multiply:

Answer each permutation problem completely.

You might also like