Permutations

Lesson 2: Permutations
Learning Competency/ies:
The learners must:
M10SP-IIIa-1: illustrate the permutation of objects.
M10SP-IIIa-2: derives the formula for finding the number of permutations of n
objects taken r at a time.
M10SP-IIIb-1: solves problems involving permutations.
Learning Objective/s:
At the end of this lesson, the students must be able to:
a. define and derive permutations in various situational conditions;
b. solve word problems involving permutations;
c. apply permutations in various situational conditions; and
d. state and illustrate the circular permutations.

LET US PONDER!
Teacher Marites, Teacher Alvin and Teacher Allelie wants to sit in a row of chairs
together with 5 students. How many possible ways can the 3 teachers and 5 students be
seated in the row of chairs?

The Three Teachers

Introduction
Permutation is an arrangement of a group of things in a definite order, that is, there
is a first element, a second, a third, etc. In other words, the order or arrangement of the
elements is taken in consideration.
For example, the letters a, b, and c have the following possible arrangements or
permutations:
abc acb bac bca cab cba
To illustrate permutation, the number of ways of arranging the digits 1, 2 and 3
where two are taken at a time is 6. The six arrangements are
12 13 21 23 31 32
In each of these examples, we have written the six permutations. However, it is easy
to determine the number of permutations without actually writing them. Using the
fundamental counting principle, we could arrive at the answer 6 without actually listing the
different arrangements. There are 𝑛1 = 3 choices for the first position, the 𝑛2 = 2 for the
second, giving a total of 𝑛1 𝑛2 = (3)(2) = 6 permutations.

Learning Module in Probability Theory Page 7

 Permutations

In general, the number of permutations of n distinct objects taken n at a time is given by

𝑛(𝑛 − 1)(𝑛 − 2)(𝑛 − 3) … (3)(2)(1) 𝑜𝑟 𝑛! 𝑤𝑎𝑦𝑠

We can represent this product by the symbol n!, which is read as “n factorial”. Two
objects can be arranged in 2! = 2 * 1 = 2 ways. For example, AB can be arranged in two: AB
and BA. By definitions of factorial, 1! = 1 and 0! = 1.

Illustrative Examples:
1. In how many ways can Jamieca, Jermil, Alexis and Nathaniel can be seated in a row?
Solution:
Using 𝑃(𝑛, 𝑛) with n = 4, we have
𝑃(𝑛, 𝑛) = 𝑛!
𝑃(4,4) = 4!
𝑃(4,4) = 4 ∗ 3 ∗ 2 ∗ 1
𝑃(4,4) = 𝟐𝟒 𝒘𝒂𝒚𝒔
2. In how many ways can ten books (Mathematics, English, History, Filipino, Science,
Social Studies, Industrial Arts, Physical Education, Values and Computer) be
arranged on a shelf?
Solution:
Using 𝑃(𝑛, 𝑛) with n=10, we have
𝑃(10,10) = 10! = 𝟑, 𝟔𝟐𝟖, 𝟖𝟎𝟎 𝒘𝒂𝒚𝒔

3. In how many ways can Lemuel, Joel, Justine, Nataniel, Darwin and Andres can fall in
line in the flag raising Ceremony?
Solution:
Using 𝑃(𝑛, 𝑛) with n=6, we have
𝑃(6,6) = 6! = 𝟕𝟐𝟎 𝒘𝒂𝒚𝒔

4. If Mr. Alvarez wants to arrange 9 digits to guess a phone number, how many
arrangements can he create?
Solution:
Using 𝑃(𝑛, 𝑛) with n=9, we have
𝑃(9,9) = 9 ! = 𝟑𝟔𝟐, 𝟖𝟖𝟎 𝒘𝒂𝒚𝒔

Learning Module in Probability Theory Page 8

 Permutations

Arrangement of n objects taken r at a time

The numbers of permutations of the letters J, I, A is 3! = 6. Let us now consider the
number of permutations that are possible by considering three letters taken two at a time.
These would be JI, JA, IA, IJ, AI and AJ. We have two positions to fill, the first position
with 𝑛1 = 3 choices and 𝑛2 = 2 choices for the second position, for a total of 𝑛1 𝑛2 = (3)(2)
= 6 permutations.
In general, n distinct objects taken r at a time can be arranged in
𝒏(𝒏 − 𝟏)(𝒏 − 𝟐) … (𝒏 − 𝒓 + 𝟏) 𝒘𝒂𝒚𝒔

Proof:
The possible number of arrangements of n things taken r at a time is equivalent to
the number of ways of choosing from n different things to fill r positions. There are n
choices for the first position, then n – 1 choices for the second position, n – 2 choices for
the third and so on. The rth position can be filled with any of the n – (r – 1) = n – r + 1
remaining things, so that the r positions can be filled in n(n – 1)(n – 2)…(n – r + 1) ways.
Thus,
𝑃 (𝑛, 𝑟) = 𝑛(𝑛 – 1)(𝑛 – 2) … (𝑛 – 𝑟 + 1) − eq. 1
If we are interested in the permutation of n things take n (or all) at a time, we note
that r = n and we have,
𝑃(𝑛, 𝑟) = 𝑛(𝑛 – 1)(𝑛 – 2) … (3)(2)(1) = n! − eq. 2
By multiplying the numerator and denominator of the right member of equation 1 by
(𝑛 − 𝑟)!, we obtain an alternative formula for 𝑃 (𝑛, 𝑟).
𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1)(𝑛 − 𝑟)!
𝑃 (𝑛, 𝑟) =
(𝑛 − 𝑟 )!
𝒏!
𝑷(𝒏, 𝒓) =
(𝒏 − 𝒓)!
Illustrative Examples:
1. Find the number of permutations of the four integers 1, 2, 3, and 4 taken two at time.
Solution:
n = 4 and r = 2
𝒏!
𝑷(𝒏, 𝒓) =
(𝒏 − 𝒓)!
4!
𝑃 (4,2) =
(4 − 2)!
4!
𝑃 (4,2) =
(2)!
4 ∗ 3 ∗ 2!
𝑃 (4,2) =
(2)!
𝑃(4,2) = 4 ∗ 3
𝑷(𝟒, 𝟐) = 𝟏𝟐 𝒑𝒆𝒓𝒎𝒖𝒕𝒂𝒕𝒊𝒐𝒏𝒔

Learning Module in Probability Theory Page 9

 Permutations

2. In how many ways can the 5 starting position on a PBA team be filled with 12 men
who can play any of the positions?
Solution:
n = 12 and r = 5
𝒏!
𝑷(𝒏, 𝒓) =
(𝒏 − 𝒓)!
12!
𝑃 (12,5) =
(12 − 5)!
12!
𝑃(12,5) =
(7)!
12 ∗ 11 ∗ 10 ∗ 9 ∗ 8 ∗ 7!
𝑃(12,5) =
(7)!
𝑃(12,5) = 12 ∗ 11 ∗ 10 ∗ 9 ∗ 8
𝑷(𝟏𝟐, 𝟓) = 𝟗𝟓, 𝟎𝟒𝟎 𝒘𝒂𝒚𝒔

3. A company advertises four job openings, two for announcers, one for producer and
one for news writer. If 10 people who are qualified for either positions applied for
the job, in how many ways can the opening be filled?
n = 10 and r = 4
𝒏!
𝑷(𝒏, 𝒓) =
(𝒏 − 𝒓)!
10!
𝑃 (10,4) =
(10 − 4)!
10!
𝑃(10,4) =
(6)!
10 ∗ 9 ∗ 8 ∗ 7 ∗ 6!
𝑃(10,4) =
(6)!
𝑃(10,4) = 10 ∗ 9 ∗ 8 ∗ 7
𝑷(𝟏𝟎, 𝟒) = 𝟓, 𝟎𝟒𝟎 𝒘𝒂𝒚𝒔

Permutations of n Objects Some are Alike

So far, we have considered permutations of distinct objects. That is, all the objects
were completely different or distinguishable. This time, we shall consider some objects being
the same. Given three letters a, b and c and consider two as alike, then if we take three at a
time with two being the same x, x and a, then we have xxa, xax, xxa, xax, axx and axx, of
which only three are distinct. Therefore, with three letters, two being equal, then we have
3!
= 3 distinct permutations. With this, we now generalize the foregoing discussions.
2!
The number of distinct permutations of n things of which is 𝑛1 one kind, 𝑛2 of a
second kind, . . . , 𝑛𝑘 of a kth kind is given by the formula
𝒏!
=
𝒏𝟏 ! 𝒏𝟐 ! 𝒏𝟑 ! … 𝒏 𝒌 !

Learning Module in Probability Theory Page 10

 Permutations

Illustrative Examples:
1. The number of ways of arranging the word “FOOD” is
𝐹 = 𝑛1 = 1
𝑂 = 𝑛2 = 2
𝐷 = 𝑛3 = 1
𝒏!
=
𝒏𝟏 ! 𝒏𝟐 ! 𝒏𝟑 ! … 𝒏 𝒌 !
4!
=
1! 2! 1!
4 ∗ 3 ∗ 2!
=
1! 2! 1!
= 𝟏𝟐 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔

2. The number of ways of arranging the word “COMMITTEE” is

𝐶 = 𝑛1 = 1
𝑂 = 𝑛2 = 1
𝑀 = 𝑛3 = 2
𝐼 = 𝑛4 = 1
𝑇 = 𝑛5 = 2
𝐸 = 𝑛6 = 2

𝒏!
=
𝒏𝟏 ! 𝒏𝟐 ! 𝒏𝟑 ! … 𝒏 𝒌 !
9!
=
2! 2! 2!
9 ∗ 8 ∗ 7 ∗ 6 ∗ 5 ∗ 4 ∗ 3 ∗ 2!
=
2! 2! 2!
= 𝟒𝟓, 𝟑𝟔𝟎 𝒂𝒓𝒓𝒂𝒏𝒈𝒆𝒎𝒆𝒏𝒕𝒔
3. How many signals can be made by arranging 9 flags in a line, if 4 are red, 3 are blue
and 2 are white?
𝑟𝑒𝑑 = 𝑛1 = 4
𝑏𝑙𝑢𝑒 = 𝑛2 = 3
𝑤ℎ𝑖𝑡𝑒 = 𝑛3 = 2
𝒏!
=
𝒏𝟏 ! 𝒏𝟐 ! 𝒏𝟑 ! … 𝒏𝒌 !
9!
=
4! 3! 2!
9 ∗ 8 ∗ 7 ∗ 6 ∗ 5 ∗ 4!
=
4! 3! 2!
= 𝟏, 𝟐𝟔𝟎 𝒔𝒊𝒈𝒏𝒂𝒍𝒔

Learning Module in Probability Theory Page 11

 Permutations

Circular Permutations
Permutations that occur by arranging objects in a circle are called circular
permutations. Two circular permutations are not considered different unless corresponding
objects in the two arrangements are preceded or followed by a different object as we
proceed in a clockwise direction.
For example, if 5 persons form a circle for a folk dance, we do not have a new
permutation if they all move one position in a clockwise. By considering one person in a
fixed position and arranging the other four in 4! ways, we find that these are 24 distinct
arrangements.
Thus, to find the number of ways of arranging n different objects in a circle, we first fix
or select a position for one of the objects. The others can be placed in their positions in (n –
1)! different ways.

Illustrative Examples:
1. Nathaniel, Joel, Jermil, Hitomi, Gerald and Lemuel seated in a round table. How
many ways can the 6 students seated in the table?
Solution:
n=6
𝑷(𝒏, 𝒏) = (𝒏 − 𝟏)!
𝑃 (6,6) = (6 − 1)!
𝑃 (6,6) = (5)!
𝑷(𝟔, 𝟔) = 𝟏𝟐𝟎 𝒘𝒂𝒚𝒔

2. The Board of regents of the Nueva Ecija University of Science and Technology have
a round table meeting. If there are 12 board of regents who attended the meeting, in
how many ways that they can be seated?
Solution:
n=6
𝑷(𝒏, 𝒏) = (𝒏 − 𝟏)!
𝑃(12,12) = (12 − 1)!
𝑃(12,12) = (11)!
𝑷(𝟏𝟐, 𝟏𝟐) = 𝟑𝟗, 𝟗𝟏𝟔, 𝟖𝟎𝟎 𝒘𝒂𝒚𝒔
3. There are 10 students in a meeting. If there are 2 4th year students, 3 3rd year
students, 4 2nd Year students and 1 1st year student, in how many ways that the
students can be seated in a round table if 3 particular students must seat next to each
other?

Learning Module in Probability Theory Page 12

 Permutations

Solution:
Let us consider 3 students as 1,
Then we have n = 10 – 2 = 8
n=8
𝑷(𝒏, 𝒏) = (𝒏 − 𝟏)!
𝑃(8,8) = (8 − 1)! 3!
𝑃 (8,8) = (7)! 3!
𝑷(𝟖, 𝟖) = 𝟑𝟎, 𝟐𝟒𝟎 𝒘𝒂𝒚𝒔

Learning Module in Probability Theory Page 13

 Permutations

Name: Date:
Grade & Section: Score:

EXERCISE 2
Permutations
Direction: Solve the following word problems. Show your complete solution. Box your final
answers.
1. Prof. Alvarez is about to enter his six – digit personal identification number into an
ATM in a shopping mall. However, he does not recall the sequence of the digits 4, 6,
2, 8, 3 and 9 of his code. How many possibilities are there?
2. A bracelet has 7 charms. How many arrangements of the charms are possible?
3. Find the total number of sample points for the arrangements of six digit telephone
numbers with no number repeated.
4. How many different ways can 3 red, 4 yellow and 2 blue bulbs be arranged in a string
of Christmas tree lights with 9 sockets?
5. In how many ways can a student guess the answer to a 10 item of true or false
examination?

6. How many different arrangements can be done from the letters of the word
PERMUTATIONS?

7. In how many ways can 9 guest be seated in a round table?

8. In how many ways can a coach assign the 5 starting positions in basketball to nine
equally qualified men?

Learning Module in Probability Theory Page 14

 Permutations

9. Four math books, three ecology books, two music books and three economics books
are to be arranged on a bookshelf. None of the books are identical.
a. How many different permutations of these books are there?

b. How many different permutations of these books are there if the books on the
same subject are to be grouped together?

10. Five red marbles, 2 white marbles and 3 blue marbles are arranged in a row. If all the
marbles of the same color are not distinguishable from each other, how many
different arrangements are possible?

11. Four different Mathematics books, 6 different Physics books and 2 different
Chemistry books are to be arranged on a shelf. How many different arrangements
are possible if;
a. The books in each particular area must all stand together?

b. Only the Mathematics books must stand together?

12. How many distinguishable 6 – digit numbers can be formed from the digits of 7, 4,
7, 4, 5 and 7?

13. Mrs. Romellen G. Ramos has a collection of 20 true or false questions and wishes to
choose 5 of them as a quiz. How many quizzes can be made?

Learning Module in Probability Theory Page 15

 Permutations

14. In how many ways can 3 men and 3 women be seated in a round table if;
a. No restriction is imposed

b. 2 particular women must not sit together

----------------------------End of Exercise 2----------------------------

Learning Module in Probability Theory Page 16