Grade

10

MATHEMATICS
QUARTER 3 – MODULE 1
MELC 1 and 2

Permutation of
Objects
 PART I.
MELC 1: Illustrates the permutation of objects

A. Introduction and Discussion

This module is all about permutations of objects. It includes pre-requisite skills on
Fundamental Counting Principles. This knowledge and skill will help you understand
permutations of the objects.

The ideas that you will experience will help you understand how the concept of
permutation helps in forming conclusions and in making decisions. It will also train you to
do greater tasks in mathematics.

After going through this module, you should be able to illustrate the permutation of
objects and solve problems involving permutation.

A permutation is an arrangement of things in a definite order or the ordered

arrangement of distinguishable objects without allowing repetitions among the objects.
= 𝑛!
Formula for permutation, 𝑃 (𝑛, 𝑟) where 𝑛 is the total number of objects
(𝑛−𝑟)!
and 𝑟 is the number of objects selected.

For the following sections on counting, we need a simple way of writing the
product of all the positive whole numbers up to a given number. We use factorial
notation for this.

Factorials are symbolized by exclamation points (!)

A factorial is a mathematical operation in which you multiply the given number by

all of the positive whole numbers less than it. In other words
𝑛! = 𝑛 𝑥 (𝑛 − 1)𝑥 … 𝑥 2 𝑥 1
For example,
“Four factorial” 4! = 4 𝑥 3 𝑥 2 𝑥 1 = 24
“Six factorial” 6! = 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 = 720

Distinguishable permutation is a permutation where some objects or elements

are alike.
𝒏!
Formula: 𝑷 = 𝒂! 𝒃! 𝒄!

Circular permutation is a special case of permutation where the arrangement of

things is in a circular pattern. To calculate the number of ways in which n objects can be
arranged in a circle, we arbitrarily fix the position of one object, so the remaining (𝑛 − 1)
objects can be arranged as if they were on a straight line in (𝑛 − 1)! ways.
(𝒏−𝟏)!
Formula: 𝑷 = (𝒏 − 𝟏)! 𝒐𝒓 𝑷 = 𝟐

Permutation with restriction is a permutation where we can include or exclude

only a small number of objects. This means that not all the objects need to be ordered.

1
B. Illustrative Examples
1. 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:
The problem involves 5 things (A, B, C, D, E) taken 3 at a time.
𝑛!
𝑃 (𝑛, 𝑟) = (𝑛−𝑟)!
where n is the number of objects taken r at a time.
5! 5! 5𝑥4𝑥3𝑥2𝑥1
𝑃 (5, 3)=(5−3)! = 2! = 2𝑥1
= 60

There are 60 different permutations for the license plate.

Distinguishable Permutations

Find the number of distinguishable permutations of the letters in the word

MISSISSIPPI.

Here are the frequencies of the letters. 𝑀 = 1, 𝐼 = 4, 𝑆 = 4, 𝑃 = 2 for a total of 11

letters. Be sure you put parentheses around the denominator so that you end up dividing by
each of the factorials.
𝑛!
Using the formula: 𝑃 = 𝑎!𝑏!𝑐!

Where a objects are alike, b objects are alike, c objects are alike and so on.
11! 11!
(1!𝑥 4!𝑥 4!𝑥 2!)
= 1 𝑥 24 𝑥 24 𝑥 2
= 34, 650

Circular Permutations

1. If we arrange 3 persons around a table as shown in the picture below, we notice

that all the different arrangements are not actually different, rather they all are same.
How?
Well, if you move clockwise, start with A, round the table in the picture shown below you
will always get A-B-C. See for yourself.

A C B

C B B A A C

So it turns out that 3 linear permutations is actually 1 circular permutation. So for n

elements,
circular permutation = (𝑛 − 1)!
𝑃 = (3 − 1)! = 2! = 2𝑥 1 = 2

2. In how many ways can 3 keys be arranged in a key ring?

This is a special case of circular permutations of objects that do not have a definite top or
bottom.
(3 − 1)! 2! 2𝑥1
𝑃= = = =1
2 2 2

2
Permutation with restrictions

1. In how many ways can 5 boys and 4 girls be arranged on a bench if

a) there are no restrictions?
9! 9! 9𝑥8𝑥7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1
Solution: 𝑃(9,9) = (9−9)! = 0! = 1
= 362,880

b) Anne and Paulo wish to stay together?

Solution: Anne being the first + Paulo being the first
𝑃(8,8)! + 𝑃(8,8)!
8! 8! 8! 8!
= (8−8)! + (8−8)! = +
0! 0!

8𝑥7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1 8𝑥7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1
= 1
+ 1

40,320 40,320
= 1
+ 1 = 80,640

2. How many arrangements of the letters of the word REMAND are possible if
a) there are no restrictions?
6! 6! 6𝑥5𝑥4𝑥3𝑥2𝑥1
Solution: 𝑃(6,6) = (6−6)! = 0! = 1
= 720

b) they begin with RE? 𝑅𝐸____

4! 4! 4𝑥3𝑥2𝑥1
Solution: 𝑃 (4,4) = (4−4)! = = 0!
= 24 1

c) they have REM together in any order? (𝑅𝐸𝑀) _ _ _

Solution: 𝑃(3,3) 𝑥 𝑃(4,4)
3! 4! 3! 4! 3𝑥2𝑥1 4𝑥3𝑥2𝑥1 6 24 144
= (3−3)! 𝑥 (4−4)! = 𝑥 = 𝑥 = 𝑥 = = 144
0! 0! 1 1 1 1 1

3. At a dinner party 6 men and 6 women sit at a round table. In how many ways can they be
sit if:
a) there are no restrictions 𝑃(12 − 1)! = 11!
Solution = 11 𝑥 10 𝑥 9 𝑥 8 𝑥 7 𝑥 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 = 39,916,800

b) Kynt and Shem must sit together (𝐾𝑆) & 𝑜𝑡ℎ𝑒𝑟 10 = 2! 𝑥 10!
Solution: = 2 𝑥 1 𝑥 10 𝑥 9 𝑥 8 𝑥 7 𝑥 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 = 7,257,600s

c) Kynt, Shem and Ron must sit together (𝐾𝑆𝑅) & 𝑜𝑡ℎ𝑒𝑟 9 = 3! 𝑥 9!
Solution: 3 𝑥 2 𝑥 1 𝑥 9 𝑥 8 𝑥 77 𝑥 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 = 2, 177,280

Key Ideas:

• In general, if n is a positive integer, then n factorial denoted

by n! is the product of all integers less than or equal to n.

𝑛! = 𝑛 𝑥 (𝑛 − 1) 𝑥 (𝑛 − 2) … 2 𝑥 1

• As a special case, we define 0! = 1

3
MELC 2: Solves problems involving permutations

A. Introduction and Discussion

Common mathematical problems involve choosing only several items from a set of
items with a certain order. In these lessons, we will learn the permutation formula for the
number of permutations of n things taken r at a time. We will also learn how to solve
permutation word problems with restrictions or special conditions. The same rule applies
while solving any problem in permutations. The number of ways in which n things can be
arranged.

B. Illustrative Examples

1. In how many ways can a president, a treasurer and a secretary be chosen from among
8 candidates?

The problem involves 8 candidates taken 3 at a time.

𝟖! 𝟖! 𝟖𝒙𝟕𝒙𝟔𝒙𝟓𝒙𝟒𝒙𝟑𝒙𝟐𝒙𝟏
𝑷 (𝟖, 𝟑) = (𝟖−𝟑)! = = = 𝟑𝟑𝟔
𝟓! 𝟓𝒙𝟒𝒙𝟑𝒙𝟐𝒙𝟏

2. A zip code contains 5 digits. How many different zip codes can be made with the digits
1–9 if no digit is used more than once?
9! 9! 9𝑥8𝑥7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1
𝑃(9, 5) = (9−5)! = = = 15,120
4! 4𝑥3𝑥2𝑥1

3. Eight people are seated at a dinner table at a political function. How many ways can
they sit if the president and secretary always have to be seated next to one another?

2! 𝑥 7! = 2 𝑥 1 𝑥 7 𝑥 6 𝑥 5 𝑥4 𝑥 3 𝑥 2 𝑥 1 = 10,080

4. In a Mobile Legend Tournament with seven teams, in how many ways can they finish in
the position “winner”, “runner-up” and “third place?”

Using the permutation formula for 7 teams taken 3 at a time,

7! 7! 7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1
𝑃(7,3) = (7−3)!
= 4!
= 4𝑥3𝑥2𝑥1
= 210

5. How many numbers greater than 1000 can be formed with the digits 3, 4, 6, 8, 9 if a digit
cannot occur more than once in a number?
5! 5! 5! 5! 5𝑥4𝑥3𝑥2𝑥1 5𝑥4𝑥3𝑥2𝑥1
𝑃(5,4) + 𝑃(5,5) = (5−4)!
+ (5−5)! = 1! + 0! = 1
+ 1
= 240

4
Part II. Activities
Activity 1

A. List all the permutations of the letters ABC.

B. Find the value of the following expressions:

1. 4!
2. 5! 𝑥 5!
3. 3! 𝑥 0!
4!
4.
0!
6!
5. (2!𝑥 4!)

C. Solve the following completely.

1. How many different ways are there to place four different colored tiles in a row?

2. How many ways can 7 different books can be arranged on a shelf?

3. In how many ways can the letters of the word GOOGLE be arranged?

4. Find the number of words, with or without meaning, that can be formed with the
letters of the word “CHAIR”.

5. In how many ways can four persons be seated around a circular table?

Activity 2

A. TRUE OR FALSE: Write TRUE if the statement is correct and FALSE if it is incorrect.

______1. The number of permutations of the letters ABC is 6.

______2. 6 distinct books can be arranged in 700 ways.

______3. The letters of the word “GOOGLE” can be arranged in 180 ways.

______4. You have 12 ways of forming a necklace using 5 diamonds.

______5. There are 200 possible ways a president, a treasurer and a secretary be chosen
among 7 candidates.

B. Solve the following problems completely and accurately.

1. How many ordered arrangement are there of the letters in the word ANTONETTE?

2. In how many ways can be 5 people be arranged in a circle?

3. The SBC club organizes a car race in which four cars A, B, C, and D joined. In how many
ways can the race be finished if there are no ties?

5
4. In how many ways can a president and vice president be chosen from a club with 10
members?

5. A plantita owned 6 different varieties of Mayanas and wish to arrange 4 of them in a row.
In how many ways can this be done?

Answer Key:

Activity 1 5. 6
1. 24 4. 120
2. 5,040 3. 180 FALSE 5.
TRUE 4.
3. 180 2. 5,040 TRUE 3.
4. 120 1. 24 FALSE 2.
5. 6 C. TRUE 1.
B.
5. 15
4. 24 5. 360
3. 6 4. 90
2. 14,400 3. 24
1. 24 2. 24
B. 1. 15,120
A.
CAB BCA
CBA ACB Activity II
BAC ABC
A.
Activity I

6
 Part III. Assessment

MULTIPLE CHOICE: Choose the letter of the correct answer. Write the letter of your
answer on the line before the number and use separate sheets of paper for your
solutions.

____ 1. A special case of permutation where the arrangement of things is in a circular

pattern.

a. Permutation b. Circular permutation c. Repetitions d. Combination

____ 2. An arrangement of things in a definite order or the ordered arrangement of

distinguishable objects without allowing repetitions among the objects

a. Permutation b. Circular permutation c. Repetitions d. Combination

____ 3. A permutation where some objects or elements are alike.

a. Permutation b. Circular permutation c. Combination d. Distinguishable

____ 4. Formula for permutation 𝑃 (𝑛, 𝑟) = _______.

𝑛! 𝑛! (𝑟−𝑛)! 𝑛!
a. (𝑟−𝑛)! b. (𝑟+𝑛)! c. 𝑛!
d. (𝑛−𝑟)!

____ 5. 0! is equal to ___________.

a. 1 b. 2 c. 3 d. 4

____ 6. Using the digits 2, 3, 6, 8, and 9, how many 3-digit whole numbers can be formed if
repetitions are not permitted?

a. 14 b. 60 c. 120 d. 625 e. 1296

____ 7. How many permutations are there of all the letters in the word COMBINE?

a. 42 b. 49 c. 5040 d. 10080 e. 40320

____ 8. Calculate the number of ways that the “lemon”, “plum” and “peach” horses (the first
3 finishers) can finish in a race with 9 horses.

a. 6 b. 27 c. 84 d. 362880

____9. In how many ways can the letters of the word 'LEADER' be arranged?

a. 72 b. 144 c. 360 d. 720

____10. The number of different permutations of the word BANANA is

a. 720 b. 60 c. 120 d. 360

____11. The letters of the ROME taken r at a time can be written in

a. 4 ways b. 8 ways c. 12 ways d. 24 ways

7
____12. How many four-digit numbers can be formed from the digits 1, 2, 3, 4, 5, 6
(Repetition of digits not allowed)?

a. 360 b. 120 c. 240 d. 480

____13.How many words can be formed from the letters of the word TRIANGLE with T
always at the beginning and E at the end.

a. 360 b. 720 c. 240 d. 480

____14. In how many ways the letters of the word FAMILY can be arranged when F and Y
are always together?

a. 60 b. 120 c. 240 d. 480

____15. How many 4-letter words with or without meaning, can be formed out of the letters
of the word, 'LOGARITHMS', if repetition of letters is not allowed?

a. 40 b. 400 c. 5040 d. 2520

Reference and Website Link Used

Oronce O. Mendoza, M. (2007). Worktext in Mathematics for Fourth Year High

School, e-math IV. Quezon City, Philippines. Rex Book Store, Inc.

https://www.onlinemathlearning.com/permutations-math.html

8
9