10

Mathematics
Quarter 3 – Module 2:
Solving Problems Involving
Permutations
Mathematics – Grade 10
Alternative Delivery Mode
Quarter 3 – Module 2: Solving Problems Involving Permutations
First Edition, 2020

Republic Act 8293, section 176 states that: No copyright shall subsist in any work of
the Government of the Philippines. However, prior approval of the government agency or office
wherein the work is created shall be necessary for exploitation of such work for profit. Such
agency or office may, among other things, impose as a condition the payment of royalties.

Borrowed materials (i.e., songs, stories, poems, pictures, photos, brand names,
trademarks, etc.) included in this module are owned by their respective copyright holders.
Every effort has been exerted to locate and seek permission to use these materials from their
respective copyright owners. The publisher and authors do not represent nor claim ownership
over them.

Published by the Department of Education, Region III, SDO Nueva Ecija

Schools Division Superintendent: Jessie D. Ferrer, CESO V
Assistant Schools Division Superintendents: Mina Gracia L. Acosta, PhD, CESO VI
Ronilo E. Hilario

Development Team of the Module

Writer: Ma. Rina C. Esquivel

Editors: Leonides E. Bulalayao, PhD
Arnel V. Ferriol
Teresita S.Moraleda
Reviewer: SDO Nueva Ecija
llustrator: Ma. Rina C. Esquivel
Layout Artist: Ma. Rina C. Esquivel
Management Team: Jayne M. Garcia, EdD
Florentino O. Ramos, PhD
Beverly T. Mangulabnan, PhD
Eleanor A. Manibog, PhD

Printed in the Philippines by Department of Education – Region III - SDO Nueva Ecija

Office Address: Brgy. Rizal, Sta. Rosa, Nueva Ecija

Telefax: (044) 940-3121
E-mail Address: nueva.ecija@deped.gov.ph
Introductory Message

This Self-Learning Module is prepared so that you, our dear learners,

can continue your studies and learn while at home. Activities,
questions, directions, exercises, and discussions are clearly stated
for you to understand each lesson.

Each SLM is composed of different parts. Each part shall guide you
step-by-step as you discover and understand the lessons prepared
for you.

Pre-tests are provided to measure your prior knowledge on lessons

in each SLM. This will tell you if you need to proceed on completing
this module if you need to ask your facilitator or your teacher’s
assistance for better understanding of the lesson. At the end of
each module, you need to answer the post-test to self-check your
learning. Answer keys are provided for each activity and test. We
trust that you will be honest in using these.

In addition to the material in the main test, Notes to the teacher are
also provided to our facilitators and parents for strategies and
reminders on how they can best help you on your home-based
learning.

Please use this module with care. Do not put unnecessary marks on
any part of this SLM. Use a separate sheet of paper in answering the
exercises and tests. Read the instructions carefully before
performing each task.

If you have any question in using this SLM or any difficulty in

answering the tasks in this module, do not hesitate to consult your
teacher or facilitator.

Thank you.
 What I Need to Know

This module was designed and written for the learners. After going through
this module, the learner is expected to:
1. illustrate permutation (M10SP-llla-1)
2. solve problems involving permutations (M10SP-lllb-1)

What I Know

Directions: Choose the letter of the correct answer of the following questions. Write
your answer on a separate sheet of paper.

1. What is P(6,2) ?
A. 6 B. 12 C. 30 D. 36

2. How many distinguishable permutations can be formed from the letters of the
word CONNECT?
A.120 B. 240C. 5 040 D. 1 260

3. There are 7 different books to be placed on a shelf. In how many ways can you
arrange the books if there is enough space for only 4 books?
A. 28 B. 11 C. 840 D. 100

4. In how many ways can Jennie, Rose, Lisa and Ji Soo be seated in a round
table?
A. 3 B. 4! C. 6 D. 8

5. Four couples want to have their picture taking. In how many ways can they
arrange themselves in a row if females are together?
A. 20 B. 4! C. 7 D. 1 152

1
 Lesson
Solving Problems
1 Involving Permutations

In the previous module, you have learned the illustration of permutation and
the Fundamental Counting Principle. Let us now go deeper on the different problems
on permutation.

What’s In

Match Me. Match Column A to Column B to get the right answer. Write the letter of
your answers on a separate sheet of paper.
Column A Column B
1. 6! A. 2 880
13!
2. B.1
13!
3. 5! 4! C. 3 024
9!
4. D. 15 120
(9−4)!
10!
5. E. 720
5!2!

What’s New

Louie loves to play MOBA game. There are five fighter heroes in the game
namely; Aldoug, Guinibeer, Valmond, Zilong and Cho. There are 4 tasks to be
assigned in each hero player; Top Lane, Bottom Lane, Mid-lane and Farming zone.
In how many ways can these 5 heroes can be placed in each task?

2 2
 TOP LANE

MID-LANE

FARMING ZONE

BOTTOM LANE

There are 120 ways where the 5 heroes can be placed in each task.
How do we get it? Aside from using the Fundamental Counting Principle, is
there any other way? Let us find out.

What Is It

How do we find the permutations of an object?

Suppose we have 4 different picture frames, and we wish to arrange 3 of them
in a row, in how many ways can this be done?

We can determine the number of ways these frames can be arranged in a row if we
arrange only 3 of them at a time. Each possible arrangement is called permutation.
The permutation of 4 different frames taken 3 at a time is denoted by P(4,3),
4
4P3, or 𝑃(3 )

The permutation of n objects taken r at a time is denoted by P(n,r). In some

books, it is also denoted as nPr, P(n,r) , or 𝑃(𝑛𝑟 ). We will use the first notation, P(n,r),
in this module.

Example 1. Given the letters of the word FRIDAY. In how many ways can we
arrange the 3 letters at a time ?
Applying the Fundamental Counting Principle

6 5 4 = 120 ways
Each letter is considered unique
For the 1st box , 6 letters can be chosen
For the 2nd box, since one letter is already used in the first box, 5 letters
can be chosen from
For the 3rd box, since two letters are already used in the first and second
box respectively, 4 letters can be chosen.

3
 Total number of ways = 6 x 5 x 4 = 120 ways

Looking again from the example above,

Remember : n = 6 r=3
Notice that the first factor and the succeeding factors decreased by 1 each time. The
last factor
n–2=n–(3–1)
= n – ( r – 1 ) or n – r +1

The number of permutations of n objects taken r at a time P ( n,r ), where n ≥ r is

P(n,r) = n (n - 1) (n – 2 ) . . . ( n – r + 1)
This formula tells us that if there are n objects there must be r factors. For example,
P(6,3) = (6)(5)(4) and P(6,4) = (6) (5) (4) (3).
If the right side of the formula is multiplied and divided by (n-r)(n –r-1)…(2) (1), the
result is
𝑛(𝑛−1)(𝑛−2)...(𝑛−𝑟+1)(𝑛−𝑟)(𝑛−𝑟−1) ...(2)(1)
P(n,r) =
(𝑛−𝑟 )(𝑛−𝑟−1)...(2)(1)
𝑛!
=
( 𝑛−𝑟 )!

Example 2. In a Mathematics competition, there are 10 finalists from which 3

winners will be awarded. How many ways can the winners be
awarded?

Given: n = 10 r = 3
𝑛!
Using P(n,r) =
( 𝑛−𝑟)!
10!
P(10,3) =
(10−3)!
10 ·9 ·8 ·7 !
=
7!
= 720 ways

Example 3. In how many ways can you arrange the 4 glasses of different fruit
juices in a row?
Given : n = 4 r = 4
4!
P(4,4) =
(4−4)!
4!
=
0!
4 ·3 ·2·1
=
1
= 24 ways

4
Remember: The permutation of n object taken r at a time is
𝑛!
P(n,r) = , n>r
( 𝑛−𝑟 )!
P(n,n) = n! , n=r
Example 4. Mae wants to arrange 4 different pots of herbal plants and 3 different
pots of ornamental plants . In how many ways can she arrange the pots
in
a row if
a. there is no restriction ?
b. the same variety of plants are together ?
c. herbal plants and ornamental plants are alternate ?
Solution:
a. Given : n = 7 , r = 7
7!
P( 7,7) =
( 7−7)!
7 ·6 ·5·4 ·3 ·2 ·1
=
1
= 5 040 ways
b. H H H H O O O

Herbal plants can be arranged in P(4,4) or 4! ways

Ornamental plants can be arranged in P(3,3) or 3! ways
Herbal plants and ornamental plants can be arranged in P(2,2) or
2! ways
So, the total number of ways they can be arranged is the product of
three permutations
P(4,4) · P(3,3) · P(2,2)
= 4! · 3! ·2!
= 288 ways

c. Possible arrangement
H O H O H O H

Considering the possible arrangement, there are P(4,4) or 4! ways to

arrange the herbal plants and P(3,3)or 3! ways to arrange the
ornamental plants .
Therefore, 4! 3! = 144 ways

Distinguishable Permutations
Example 5. Find the number of permutations of the word DAD
Solution: There are 3 letters of the word DAD. Suppose these letters are
distinct, then the number of permutation is
P(3,3) = 3!
=3·2·1
=6

5
 DdA DAd ADd
dDA dAD AdD

However, we take into consideration that 2 D’s are alike. To distinguish

between the 2 D’s, let us make one D in the upper case and the other in lower case
(d).
These two D’S are the same, and so the two entries in each box are also the
same. Take note that for each permutation like D-A-D, there are 2 ways or 2!
ways of arranging the two D’s without changing the arrangement of the other.
The duplications are eliminated by dividing 3! by the number of ways in
arranging the 2D’s which is 2!
𝑃(3,3)
P=
2!
3!
=
2!
3· 2 ·1
=
2 ·1
6
=
2
= 3 distinguishable permutations

Example 6. Find the number of permutations of the letter of the word

SUCCESS.
Solution: There are 7 letters of the given word. Assuming that the letters
are distinct, there are P(7,7) = 7! permutations
However, taking into consideration that there are 3 S’s are alike and 2 C’s
are alike. The permutation of 3 C’s is P(3,3) = 3! The permutation of 2 C’s
is P(2,2) = 2!
So we must divide 7! by 3!2! to eliminate the duplication
Thus
7!
P=
3!2!
7·6 ·5 ·4 ·3 ·2!
=
3·2 1 ·2!
= 420 permutations
Based on example 5 and 6 , the number of distinguishable permutations, p of
n object where p are alike, q object are alike , r object are alike and so on, is
𝑛!
P=
𝑝!𝑞!𝑟! ...

6
Circular Permutation
Circular Permutation is the different possible arrangements of n objects in a
circle.

Example 7. In how many ways can you arrange the 3 persons sitting in a circular
table?
Given: n = 3

Notice that the arrangement does not change if each person moves in position by one
place, the technique is to fix one person in one position and arrange the remaining
persons as if they are on a line. Since the two persons are left, then the arrangement
is 2! = 2 · 1 = 2
P = ( n – 1) !
= ( 3 -1) !
= 2!
=2·1
=2

The permutation of n objects arranged in a circle is

P = (n – 1)!

Example 8. A family of 7 members sits in a round table for breakfast. How

many ways can the members of the family be seated?
Given : n = 7
Since, there are 7 members to be arranged in circle, the number of
ways is
P = ( n-1)!
=(7–1)!
= 6!
= 6 · 5 · 4 · 3 · 2 ·1
= 720

Example 9. In how many ways can 3 girls and 3 boys be seated in a circular table if
a. there is no restriction ?
b. two particular girls be seated together ?
Solution
a. Given : n = 6
P = ( n-1)!
= ( 6 – 1)!
= 5!
=5·4·3·2·1
= 120 ways

7
 b.
G G

4 1

3 2

Counting the circular permutation by putting together the

chairs occupied by8 two particular girls is the same as
permuting 5 chairs at the same time, ( 5 -1) = 4! = 4 · 3 ·2 · 1
= 24
Since the two girls can interchange their seats, the total
number of arrangement is 4! 2! = 48 ways

What’s More

A. Evaluate the following:

1. P(8,2)
2. 11P5
3. P(7,r) = 840
4. P( 5,5)
5. P(n,4) = 1680

B. Solve the following problems.

1. In how many ways can Lea arrange linearly her 5 stuffed toys in her
bed?
2. There are 10 volleyball teams competing for the top 4 standing in order
to move up to the semi-finals. Find the number of possible rankings of
the four top teams.
3. How many permutations can be formed from the word MISSION?
4. Woo Jin wants to arrange 4 different Mathematics books and 3 different
English books. In how many ways can she arrange these books on the
shelf if
a. there is no restriction ?
b. books of the same subject must be placed together ?
c. they must be placed alternately ?
5. Find the number of ways that a family of 7 can be seated in a circular table
with 7 chairs.

8
 What I Have Learned

Directions: Write the formula to be used in a given situation or problem. Write your
answers on a separate sheet of paper.

1. Lala and her 3 friends want to have their picture taking. In how many
ways can they arrange in a row?
2. Find how many ways can be made from the word BOOKSTORES.
3. How many three-digit numbers can be formed from the numbers
1,2,3,4,5,6,7 and 8 if no repetition is allowed?
4. In how many ways can you arrange 8 persons having their dinner in a
circular table?

Look at the checklist below for you to know how much you understand the lesson.
Score Descriptor
4 Understanding in the lesson is clearly evident
3 Understanding in the lesson is evident
2 Understanding in the lesson is slightly evident
1 Understanding in the lesson is limited

What I Can Do

Using the Fundamental Counting Principle and the formula for permutation,
show how to find the number of ways of choosing three initials from the alphabet
if the letters should not be repeated.

Please be guided by the rubrics below

Score Descriptors
4 Used an appropriate formula to come up with a correct solution
and arrived at a correct answer
3 Used an appropriate formula to come up with a solution but a part
of the solution led to an incorrect answer
2 Used an appropriate strategy but came up with an entirely wrong
solution that led to incorrect answer
1 Attempted to solve problem but used an inappropriate strategy
that led to a wrong solution

9
 Assessment

Directions: Read the following. Choose the letter of the correct answer and write
your answers on a separate sheet of paper.

1. What is P(9,3) ?
A. 27 B. 729. C. 60 480 D. 504

2. How many 3-digit numbers can be formed from the numbers 1,4,5,7,8 and 9
if repetition is not allowed?
A. 120 B. 20 C. 504 D. 720

3. In how many ways can 8 people be seated in a circular table?

A. 630 B. 5760 C. 40 320 D. 5 040

4. If n = 7 and r = 3, what is P(n,r)?

A. 4 B. 21 C. 5 040 D. 210

5. Find the number of distinguishable permutations of the letters from the word
LETTER.
A. 720 B. 180 C. 90 D. 30

6. A group of 5 men and 5 women sit in a round table. Find the number of
ways they can sit without restriction.
A. 14 400 B. 10 000 C. 3 628 800 D. 362 800

7. In how many ways can 4 nurses and 2 doctors be seated in a row so that
the same professions sit together?
A. 8 B. 96 C. 48 D. 720

8. Find the number of distinguishable permutations of the digits of the number

1 412 233.
A. 630 B. 1 008 C. 402 D. 42

9. How many different three letters can you form from the first 11 letters of the
alphabet if no two letters are alike?
A.33 B. 990 C. 330 D. 99

10. In how many ways can 9 people occupy the 9 seats in a front row?
A. 81 B. 8 100 C. 40 320 D. 362 880

10
 11
What I have Learned
1. P(n,n) = n!
What’s In
What I Know 𝑛!
1. E 2. P =
𝑝!𝑞!𝑟!
1. C 2. B
3. A 𝑛!
2. D 3. P(n,r) = (𝑛−𝑟)!
3. C 4. C
4. C 5. D
4.P = ( n-1)!
5. D
.
What’ More
Assessment
A. 1. 56 B. 1. 120
2. 1. D 6. D
55 440 2. 5 040
3. r=7 3. 1 260 2. A 7. B
4. 120 4. a. 5 040 3. D 8. A
5. n=8 b. 288 4. D 9. B
c. 144 5. B 10. C
5. 720
Answer Key
References
Books:

Aronce, Orlando A. and Mendoza, Marilyn O. 2017. E-Math 10 – Rex

Bookstore Inc. Institute of Science and Mathematics Education
Development, University of the Philippines.

Callanta, Melvin M., Canonigo, Allan M., Chua, Arnaldo I., Cruz, Jerry D.,
Esparrago, Mirla S., Garcia, Elino S., Magnaye, Aries N., Orines,
Fernando B., Perez, Rowena S. and Ternida, Concepcion S. 2015.
Mathematics – Grade 10 Learner’s Module.

Capalad, Florenda Gallos, Demetrio Mier, Elvira Nguyen, Soledad Ulep, Fe N.

Reyes, Risa Reyes. Mathematics IV Fourth Year High School.

12