GRADE

10

LESSON 2
PERMUTATIONS
PREPARED BY:

JEFTY GECANA

NEILAN GALLUR

JUVIER TEOFILO

HANNAH BINATLAO

AILYN BALANGITAO

CHERRY MAE TOLING

Lesson 2 Permutations

What to know?
This module by assessing your knowledge of the basic
counting technique called the Fundamental Counting Principle.
This knowledge and skill will help you understand permutations of
objects. As you go through this lesson, keep in mind this important
question: How does the concept of permutation help in forming
conclusions and in making wise decisions? To be able to answer
this, perform each activity that follows. Seek the assistance of your
teacher and peers if you encounter any difficulty. Have your work
checked by your teacher.

These are the challenges that you must accomplish

before moving on to the next topic. Have focus on:
 Illustrate permutation and use the formula in finding the
permutation of n objects taken r at a time.

You may utilize half of your week or your free time to learn
and understand the concepts and ideas presented in this lesson.
To assist you in managing your learning, you may use any
reference such as textbook if you have one at home, online
references (google, YouTube, Facebook pages ideally for
mathematics, and or tiktok), mobile learning devices and
worksheets attached if there are any. You can also freely
message us for your clarification if there is any.
  Permutations
 Circular
 Distinguishable
 Indistinguishable
 Order
 Arrangement
 Objects

Exploration

PERMUTATIONS
A permutation is an arrangement of objects in a specific order. If it is an
ordered arrangement of distinguishable objects, then repetition among the objects is
not allowed. To permute objects is to arrange them in a certain order. Here, the order
of the arrangement of objects is important. Hence, the arrangement ABCD is not the
same as the arrangement BCDA. These are two different arrangements. The symbol
𝑃 (𝑛, 𝑟) denotes the permutation of n things taken r at a time. Two other common
notations that appear in other textbooks or journals are 𝑛𝑃𝑟 and 𝑃𝑟𝑛 . You will use 𝑃(𝑛, 𝑟)
in this module.
The total number of permutations of n objects taken r at a time is given by the
expression
𝑃(𝑛, 𝑟) = 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1).
This formula can be derived from the fundamental counting principle (FCP). If
the objects are to be taken r at a time where 𝑟 < 𝑛, then you have n objects to fill up
the first place, 𝑛 − 1 objects to fill up the second place, and so on. Hence, the number
of ways of different ordered arrangements of n objects taken r at a time is given by
𝑃(𝑛, 𝑟) = 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1)
 If n is a positive integer, then n factorial denoted by n! is the
product of all integers less than or equal to n. In other words, 𝑛! =
𝑛(𝑛 − 1)(𝑛 − 2) … (2)(1). As a special case, you define 0! =1.

With this definition,

𝑃 (𝑛, 𝑛) = 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑛 + 1)
= (𝑛 − 1)(𝑛 − 2) … (2)(1)
= 𝑛!

In the equation 𝑃(𝑛, 𝑟) = 𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 𝑟 + 1), if you multiply and

divide the right hand side by (𝑛 − 𝑟)! = (𝑛 − 1)(𝑛 − 𝑟 − 1) … (2)(1), then you get
𝑛(𝑛 − 1)(𝑛 − 2) … (𝑛 − 1 + 𝑟)(𝑛 − 𝑟)(𝑛 − 𝑟 − 2) … (2)(1)
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)(𝑛 − 𝑟 − 1) … (2)(1)
𝒏!
𝑷(𝒏, 𝒓) = 𝒘𝒉𝒆𝒓𝒆 𝒏 ≥ 𝒓
(𝒏 − 𝒓)!

Example 1:
How many different symbols, each consisting of 5 different letters, can be formed from
the letters of the word PARENTS?
Solution:
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟 )!
7!
𝑃(7,5) =
(7 − 5)!
7!
=
2!
= 7𝑥6𝑥5𝑥4𝑥3
= 2,520

Example 2:
A license plate begins with three letters. If the possible letters are A, B, C, D and E,
how many different permutations of these letters can be made if no letter is used more
than once?
Solution:
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟 )!
 5!
𝑃(5,3) =
(5 − 3)!
5!
=
2!
= 5𝑥4𝑥3
= 60

Circular Permutations
Circular permutations are the permutations of objects when they are arranged
in a circular pattern. An example of this is the seating arrangement of people around
a circular table. The main difference between circular and linear permutations is that
in a circular permutation there is no starting or ending point.
Suppose there are four objects a, b, c, and d. In linear permutations, they can
be arranged in 4! = 24 different ways.
When the four objects a, b, c, and d are arranged in circle, you get the following
arrangements.

C B

D B C A

A D

A D

B D C
A

C B

Figure 5.6
 The arrangements in Fig. 5.6 are all considered the same because there is no
starting or ending point.
Thus, out of the 4! = 24 different ways of arranging 4 distinct objects in a line, there
will be 4 such linear arrangements that will be considered the same from a circular
permutation’s view.
Therefore, the number of circular permutations of 4 different objects will be
4!
= 3! = 6.
4
In general, if there are 𝑛 different objects, and they are arranged in a circular
fashion, then the total number of circular permutations of these 𝑛 objects is equal to the
number of linear permutations of the 𝑛 objects 𝑑𝑖𝑣𝑖𝑑𝑒𝑑 𝑏𝑦 𝑛. This is because out of the 𝑛!
ways of arranging 𝑛 distinct objects in a line, there will be 𝑛 such linear arrangements that
will be considered the same from a circular permutation’s view. Hence,
𝒏!
circular permutations of 𝒏 objects = 𝒏

= (𝒏 − 𝟏) !

Example 3:
In how many ways can 8 children join hands to form a ring?
Solution:
The number of ways for 8 children to form a ring is = (𝑛 − 1)! = (8 − 1) = 7! = 5,040

Example 4:
In how many ways can 6 people be seated at a round table?
Solution:
The number of ways for 6 people be seated at a round table is
= (𝑛 − 1)! = (6 − 1)! = 5! = 120

Permutations Where Some Object

Are Alike
If among 𝑛 things to be permuted, 𝑛, objects are distinguishable of type 1,
𝑛2 objects are indistinguishable of type 2, … . , 𝑛𝑚 objects are indistinguishable of
type m, then the number 𝑃 of distinguishable permutations is
𝒏!
𝑷=𝒏 .
𝟏 !𝒏𝟐 !…𝒏𝒎 !
Example 5:
How many distinguishable permutations are there for the letters of the word
TENNESSEE taken all together?
Solution:
Because there are 4 E’s, 2 E’s, 2 S’s, you have
𝑛!
𝑃=
𝑛1 !𝑛2!…𝑛𝑚 !
9!
𝑃=
4! 2! 2!
𝑃 = 3,780

Example 6:
How many ordered arrangements are there of the letters in the word PHILIPPINES?
Solution:
There are 11 in total and you have 3 P’s, 1 H, 3 I’s, 1 L, 1 N, 1 E and 1 S, thus
𝑛!
𝑃=
𝑛1 ! 𝑛2 ! … 𝑛𝑚 !
11!
𝑃=
3! 3! 1! 1! 1! 1! 1!
𝑃 = 1,108,800

Example 7:
If 𝑃 (𝑛 + 1,3) = 24𝑛, the what is the value of 𝑛?
Solution:
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!

(𝑛 + 1)!
𝑃(𝑛 + 1,3) =
((𝑛 + 1) − 3)!
(𝑛 + 1)!
𝑃 = (𝑛 + 1,3) =
(𝑛 − 2)!

The numerator can be rewritten as:

(𝑛 + 1) ⋅ (𝑛 + 1 − 1) ⋅ (𝑛 + 1 − 2) ⋅ (𝑛 + 1 − 3)!
(𝑛 − 2)!

Simplifying:
(𝑛 + 1) ⋅ (𝑛) ⋅ (𝑛 − 1) ⋅ (𝑛 − 2)!
(𝑛 − 2)!
We can cancel the (n−2)! values out:
(𝑛 + 1)(𝑛 − 1)(𝑛)
Thus,
(𝑛 + 1)(𝑛 − 1)(𝑛) = 24𝑛
Divide both side by 𝑛
(𝑛 + 1)(𝑛 − 1) = 24

𝑛2 − 1 = 24
𝑛2 = 24 + 1
𝑛2 = 25
𝑛 = √25
𝑛 = 5 𝑜𝑟 𝑛 = −5
Reject 𝑛 = −5
Therefore, 𝑛 = 5.

Example 8:
If 𝑃(7, 𝑟) = 840, then what is the value of r?
Solution:
(𝑛 + 1)!
𝑃(𝑛, 𝑟) =
((𝑛 + 1) − 3)!
7!
840 =
(7 − 𝑟)!
7!
(7 − 𝑟 )! =
840
5040
(7 − 𝑟 )! =
840
( 7 − 𝑟 )! = 6
Notice that 6 can be written as 3!
(7 − 𝑟)! = 3!

Cancel factorial sign

7−𝑟 = 3
𝑟=4

Example 9:
In how many different ways can the letters O, G, T, I, D, A, and P be arranged so that
a.) all 3 vowels are always together?
b.) the vowels O and A are not together?
Solution:
a. Because all 3 vowels are always together, you group the 3 vowels (O, I and A)
as one. Then permute the group of vowels and 4 consonants. This can be
arranged in 5! ways. In each of these arrangements, the 3 vowels can be
arranged among themselves in 3! ways. Hence, the required number of ways
the 7 letters can be arranged so that all 3 vowels are always together is 5!3! =
720 ways.
b. The total number of permutations of the 7 letters (3 vowels and 4 consonants)
without restriction is 7! = 5,040. To compute the number of permutations wherein
the vowels O and A are together, you group O and A together as one. Then
 permute this group (group with vowels O and A) and the remaining 5
consonants. This can be done in 6! = 720 ways. In each of these arrangements,
the 2 vowels O and A can be arranged among themselves in 2! = 2 ways. Hence,
the number of permutations wherein the vowels O and A are together = 2! x 6! =
1,440.
The number of permutations in which the vowels O and A are not together
= total number of permutations without restriction – the number of permutations
wherein the vowels O and A are together
= 5,040 – 1,440
= 3,600

Example 10:
How many different six-digit even numbers can be formed from the digits 1, 2, 3, 4, 5,
6, 7, 8 and 9 without repeating the digits used?
Solution:
For the number to be even, the last unit must be 2, 4, 6, or 8. So, there are 4 ways to
choose the rightmost digit. The other 5 digits can come from the remaining 8 digits in
𝑃(8,5) ways. Hence, by the fundamental counting principle,
The number of six-digit even numbers = 4 𝑥 𝑃(8,5) = 26,880.

Use MS Excel version 2007 to calculate the

permutation formula

1. Click on formula in Tool Bar.

2. Click on Insert Function.
3. Type permut in search window and click Go.
4. Click PERMUT.
5. Click OK.
6. Type N in the NUMBER window (e.g., 8)
 7. Type r in the Number chosen window (e.g., 4)
8. Click OK.
9. The answer is 1,680
10. MS Excel will insert this answer in the cell where the cursor is. It will also
insert the formula = PERMUT (8,4) in the cell where cursor is.

END OF THE LESSON

 What’s more?
Practice Exercise

On the blank before each item, write T if the statement is correct and F if it is
incorrect.

_____1. Permutation is an ordered arrangement of distinguishable objects that allows

repetitions among the objects.
_____2. Permutation is an arrangement of objects wherein order is immaterial.
_____3. In a circular arrangement of a group of people, the arrangement does not
change even if everyone in the group moves one place to the right of his or her original
position.
_____4. In the formula for permutations where some objects are alike, repetitions are
taken care of by dividing the permutation by the factorial of the number of objects that
are alike.
_____5. The number of distinct arrangements for the set of five letters f, a, i, t, and h
is 𝑃(5,5) or 5!.
A. Solve each item and write the answer on the space provided. Exact
numerical answers should be written unless otherwise stated.

______1. In how many ways can 8 friends line up for registrations?

______2. In how many ways can 6 people be seated in a row?

______3. In how many ways can 5 cards be chosen from a standard deck cards.

______4. How many ways can 12 people be seated at a round table for a banquet?

______5. How many distinguishable permutations are there for the letters of the word
GIGGLING taken all together?
 Worksheet: Permutations

Be sure to submit a handwritten answer.

Name: _________________________ Student ID #: ________________________
LRN: ____________________________ Section: ____________________________

1. A shelf can hold only 6 books. Given that 10 different books are available, find
the number of different arrangements that can be made to fill the shelf?
2. How many distinguishable permutations are there for the letters of the word
INCONVENIENCING taken all together?
3. In how many ways can 4 boys and 4 girls be seated in a row if the boys
alternate with the girls?
4. 𝐼𝑓 𝑃(𝑛 + 1,2) = 20𝑛, then what is the value of n?
5. If 𝑃(12, 𝑟) = 1320, then what is the value of r?