MATH 10 QUARTER 3 Week 2

Learning Competency:
The learner solves problems involving permutations (M10SP-IIIb -1)

Expectations

This module was designed to help you master on how to solve problems involving
permutations.

With the different activities provided in this module, you are expected to:

1. Determine the different ways in solving problems involving permutations;

2. Solve problems involving permutations;
3. Realize the importance of permutations in our real- life situation especially in forming a
conclusion and making a wise decision.

Pre- test

Directions: Read and understand each question carefully. Write the letter of the correct answer on your
answer sheet

1. In how many ways can you arrange 7 books in a shelf?

A. 360 B. 72 C. 4 050 D. 5 040
2. Find the number of distinguishable permutations of the letters of the word PARALLEL.
A. 3,360 B. 4,050 C. 6,720 D. 40,320
3. Find the number of different ways that a family of 7 can be seated around a circular table with 7 chairs.
A. 360 B. 720 C. 5,040 D. 40,320
4. Benjie has 4 Mathematics books and 2 Science books. In how many ways can he arrange the said books
in a shelf?
A. 1 440 B. 720 C. 520 D. 160
5. There are 12 participants in a Mathematics Quiz Bee. In how many possible ways can they be arranged
as first, second, third, and fourth placers?
A. 3 B. 48 C. 288 D. 11,880

Looking Back at your Lesson

From your previous lesson, you have learned on how to determine the exact number of ways and list all
the possibilities in doing a certain task or an activity. The mathematics concept and principle applied in
determining the number of ways, number of choices, and number of possibilities is the basic counting technique
called the Fundamental Counting Principle (FCP). The Fundamental Counting Principle is a technique used
to determine the exact number of ways and possibilities in doing a certain task or an activity. It states that if a
task can be performed in q ways, and if for each of these, a second task can be performed in r ways then the
two tasks can be performed in q × r ways.

We have also illustrated a permutation of objects. A permutation is an arrangement of objects in a

straight line where the arrangement of the objects is important. Permutation is special case of the counting
principle – it tells us the distinct number of arrangements of objects, one after the other, form a set of objects.
Meaning, it is an arrangement with no repetitions allowed and order is important

1
 Introduction of the Topic

Have you tried asking yourself on the significance of the arrangement of the numbers of your Learner’s
Reference Number (LRN)? Have you tried setting a password with a combination of numbers, letters, and
symbols in your e -mail account? Have you experienced writing or giving your number in a loading station with
an incorrect arrangement of the cell phone number? These exact arrangements of the numbers, letters and
symbols are proof that the LRN, password of an e-mail account and the cell phone number are yours.

In this module, we will solve different problems involving permutations. But before we do that, let us first define
the factorials.

LESSON 1: FACTORIALS

Let 𝑛 be a nonnegative integer. The factorial notation, 𝑛! (read as “𝑛 factorial”), is defined as the product
of all positive integers from 1 to 𝑛. That is,
𝑛! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × … × (3) × (2) × (1)
Also, we define 0! = 1.

Examples:
1. 3! = 3 × 2 × 1 = 6
2. 5! = 5 × 4 × 3 × 2 × 1 = 120
3. 6! = 6 × 5 × 4 × 3 × 2 × 1 = 720
4. 3! × 5! = (3 × 2 × 1) × (5 × 4 × 3 × 2 × 1) = 6 × 120 = 720
7! 7×6×5×4×3×2×1
5. = = 7 × 6 × 5 = 210
4! 𝟒×3×2×1

Some Factorial Examples

1! = 1 6! = 720 11! = 39,916,800

2! = 2 7! = 5040 12! = 479,001,600
3! = 6 8! = 40,320 13! = 6,227,020,800
4! = 24 9! = 362,880 14! = 87,178,291,200
5! = 120 10! = 3,628,800 15! = 1,307,674,368,000

LESSON 2: PERMUTATIONS

I. PERMUTATIONS OF 𝒏 OBJECTS

Theorem
The number of permutations of 𝑛 distinct objects is 𝑛!

Take note that we can only use this theorem if the objects we are arranging are different from one another.

EXAMPLE I.1
Mrs. Molina wants to distribute her 5 solicited different tablets in her 5 students, in how many ways can she do
it?

Solution: There are 5 solicited tablets to be distributed in 5 students. Hence, we will take the permutation of
these 5 tablets, and since all of them are different from each other by the theorem, the number of permutations
is 5! = 5 × 4 × 3 × 2 × 1 = 120.

Therefore, Mrs. Molina has 120 ways of distributing her tablets.

EXAMPLE I.2
In how many ways can 6 different books be arranged on a shelf?

Solution: There are 6 books to be arranged on a shelf. So, we are looking for the permutations of the books.
Since all the books are different from one another, the number of permutations is given by 6!! =
6 × 5 × 4 × 3 × 2 × 1 = 720
Therefore, there are 720 ways that the books can be arranged in a shelf.

2
 II. PERMUTATIONS OF 𝒏 OBJECTS TAKEN 𝒓 AT A TIME

Theorem
The number of permutations of 𝑛 distinct objects taken 𝑟 at a time, denoted 𝑃(𝑛, 𝑟), is
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!

EXAMPLE II.1
Calculate the following:
a. 𝑃(5,2) b. 𝑃(7,3) c. 𝑃(10,4)
Solution:
a. In the notation 𝑃(5,2), we have 𝑛 = 5 and 𝑟 = 2. So,
5!
𝑃(5,2) = Substitute to the formula
(5 − 2)!
5!
= Simplify expression inside the parenthesis
(3)!
5×4×3×2×1
= Expand the factorials
3×2×1
=5×4 Cancel common factors
= 20 Simplify
Therefore, 𝑃(5,2) = 20
b. In the notation 𝑃(7,3), we have 𝑛 = 7 and 𝑟 = 3. So,
7!
𝑃(7,3) = Substitute to the formula
(7 − 3)!
7!
= Simplify expression inside the parenthesis
(4)!
7×6×5×4×3×2×1
= Expand the factorials
4×3×2×1
=7×6×5 Cancel common factors
= 210 Simplify
Therefore, 𝑃(7,3) = 210
c. In the notation 𝑃(10,4), we have 𝑛 = 10 and 𝑟 = 4. So,
10!
𝑃(10,4) = Substitute to the formula
(10 − 4)!
10!
= Simplify expression inside the parenthesis
(6)!
10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
= Expand the factorials
6×5×4×3×2×1
= 10 × 9 × 8 × 7 Cancel common factors
= 5,040 Simplify
Therefore, 𝑃(10,4) = 5,040.
EXAMPLE II.2
Find the value of 𝑟 so that 𝑃(7, 𝑟) = 840.

Solution
7!
𝑃(7, 𝑟) = 840 ⟹ = 840 Expand 𝑃(7, 𝑟)
(7 − 𝑟)!
7×6×5×4×3×2×1
⟹ = 840 Expand 7!
(7 − 𝑟)!
5,040
⟹ = 840 Simplify
(7 − 𝑟)!
⟹ 5,040 = 840(7 − 𝑟)! Multiply both sides of the equation by (7 − 𝑟)!
5,040
⟹ = (7 − 𝑟)! Divide both sides of the equation by 840
840
5,040
⟹ = (7 − 𝑟)! Divide both sides of the equation by 840
840
⟹ 6 = (7 − 𝑟)! Simplify

3
 ⟹ 3! = (7 − 𝑟)! 6 = 3!
⟹ 3= 7−𝑟
⟹ 𝑟=4 Solve for 𝑟
Therefore, 𝒓 = 𝟒.

EXAMPLE II.3
Find the value of 𝑛 so that 𝑃(𝑛, 2) = 90.

Solution: If 𝑛 is missing, the trick here is to expand the permutation formula then expand 𝑛! in the numerator
up until you reach the point where you can cancel the factorial expression in the denominator.
𝑛!
𝑃(𝑛, 2) = 90 ⟹ = 90 Expand 𝑃(𝑛, 2)
(𝑛 − 2)!
𝑛(𝑛 − 1)(𝑛 − 2)!
⟹ = 90 Expand 𝑛! and stop when you reach (𝑛 − 2)!
(𝑛 − 2)!
⟹ 𝑛(𝑛 − 1) = 90 Simplify (by cancelling (𝑛 − 2)!)
2
⟹ 𝑛 − 𝑛 = 90 Multiply the expression on the left side
⟹ 𝑛2 − 𝑛 − 90 = 0 Write the polynomial in standard form
⟹ (𝑛 − 10)(𝑛 + 9) = 0 Solve the resulting polynomial equation
⟹ 𝑛 = 10 or 𝑛 = −9
⟹ 𝑛 = 10 𝑛 should be nonnegative
EXAMPLE II.4
In how many possible ways can Mr. Mathusay assign 6 different activities in his 4 students in Grade 10?

Solution:
There are 6 different activities to be assigned in 4 students. So, we will get the permutation of 6 objects taken
4 at a time. Then, the number of possible arrangements is

6! 6!
𝑛 = 6, 𝑟 = 4 𝑃(6,4) = =
(6 − 4)! 2!
6×5×4×3×2×1
=
2×1
=6×5×4×3
= 360

Therefore, Mr. Mathusay has 360 possible ways of assigning activities to his students.

EXAMPLE II.5
In a certain organization, there are 10 elected members of board of directors. In how many ways can they be
elected as a president, a vice-president, a secretary, a treasurer, and an auditor?

Solution: There are 10 elected members of the board of directors and 5 different positions (president, vice-
president, secretary, treasurer, and auditor).

10! 10!
𝑛 = 10, 𝑟 = 5 𝑃(10,5) = =
(10 − 5)! 5!
10 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
=
5×4×3×2×1
= 10 × 9 × 8 × 7 × 6
= 30,240

Therefore, the 10 elected members of board of directors has 30,240 ways to be elected for the 5 different
positions.

III. CIRCULAR PERMUTATIONS

In the sections, we considered arrangements of objects in a row. In this section, we will consider permutations
that occur by arranging objects in a circle. This kind of arrangement is called a circular permutation.

4
Let A, B, and C be three objects arranged in a circle.

If we arrange them in a circle, notice that there are permutations that are like the other by some rotations. For
instance, observe the pointing arrows of arrangements (1), (4) and (5). You can notice that the three
arrangements are the same. Therefore, (1), (4) and (5) are considered as one circular permutation only. The
same observation can be seen from (2), (3) and (6). These are also considered as one permutation. Hence there
are only 2 distinct circular permutations of three distinct objects.

Theorem
The number of permutations of 𝑛 distinct objects arranged in a circle is (𝑛 − 1)!

Theorem
The number of permutations of 𝑛 distinct objects arranged in a circle taken 𝑟 at a time is
𝑃(𝑛, 𝑟)
𝑟

EXAMPLE III.1
Five people are to be seated at a round table. How many different arrangements are possible?

Solution:
Since the five people were to sit in a circle, the number of possible permutations is (5 − 1)! = 4! = 24.
Hence, there are 24 different arrangements.

EXAMPLE III.2
If twelve people are waiting outside an office for an interview, but only 4 people can be accommodated per round
of panel interview following the anti-COVID-19 health protocols, in how many ways can the secretary arrange
the interviewees to be seated at a circular table?

Solution:
Since the are 12 interviewees but only 4 can enter the office and be seated in a circular table, we are looking
for the circular permutation of 12 objects taken 4 at a time. Therefore, the number of permutations is
12! 12!
𝑃(12,4) (12 − 4)! (8)!
= =
4 4 4
12 × 11 × 10 × 9 × 8!
(8)!
=
4
12 × 11 × 10 × 9
=
4
= 2,970
Therefore, there are 2,970 ways to arrange the twelve interviewees four at a time in a circular manner.

IV. ARRANGEMENTS WITH REPETITION

Until now, we only considered permutations of objects different from each other. What if we consider some
objects indistinguishable from other elements of our collection? For instance, AB and BA has two arrangements
while AA has only one permutation because if we switch the positions of the A and A, we will still get AA.

In this section, we will consider the arrangements of objects with indistinguishable kind.

Theorem
If there are 𝑛 objects with 𝑟1 of type 1, 𝑟2 of type 2, …, and 𝑟𝑚 of type m, where 𝑟1 + 𝑟2 + ⋯ + 𝑟𝑚 = 𝑛, then the
number of different permutations of these 𝑛 objects, denoted by 𝑃(𝑛; 𝑟1 , 𝑟2 , … , 𝑟𝑚 ) is given by
𝑛!
𝑃(𝑛; 𝑟1 , 𝑟2 , … , 𝑟𝑚 ) =
𝑟1 ! 𝑟2 ! … 𝑟𝑚 !

5
EXAMPLE IV.1
How many distinguishable permutations can the letters of the word BANANA be arranged?

Solution: Observe that the word BANANA has repeated letters. To compute for the number of different
arrangements of objects with repeated kind,

STEP 1: Count all the objects (in this example, count the letters). This will be the value of 𝑛.
𝑛 = 6 since BANANA is composed of 6 letters
STEP 2: Count the number of times each object has been repeated: B – 1 time
A – 3 times
N – 2 times
STEP 3: Use the formula.
6! 6×5×4×3×2×1
=
1! 3! 2! (1) × (3 × 2 × 1) × (2 × 1)
720
=
12
= 60
Therefore, there are 60 different permutations of the word BANANA.

*Note: You can you use cancellation if the numbers become large to manually compute or input in your calculator.

EXAMPLE IV.2
How many different 9-digit numbers can you form when you scramble 814,718,848?

Solution: Observe that the number 814,718,848 has repeated kinds.

STEP 1: Count all the objects (in this example, count the numbers). This will be the value of 𝑛.
𝑛 = 9 since 814,718,848 is composed of 9 numbers
STEP 2: Count the number of times each object has been repeated: 8 – 4 times
1 – 2 times
4 – 2 times
7 – 1 time
STEP 3: Use the formula.
9! 9×8×7×6×5×4×3×2×1
=
(4!)(2!)(2!)(1!) (4 × 3 × 2 × 1) × (2 × 1) × (2 × 1) × (1)
= 15,120
= 3,780
Therefore, we can construct 3,780 different 9-digit numbers using the digits of 814,718,848.

*Note: You can still use cancellation on other factors to eliminate the numbers in the denominator.

Activities
Activity 1: It’s Your Turn to Decide!
Read and analyze the situations carefully then answer the given question. Write your answers on the
space provided.

1. The Grade ten students conducted a survey about the most popular names and surnames in the school
campus. The result for names are as follows:
Mylene Geraldine Joyme
Julie Mary Jane Mayeth
The most popular surnames are: Arzaga , Geronimo , Casiano , Arrivado and Hernandez. How many possible
names can be generated using the first and the last names from the list of popular names in the school? Kindly
list all the possible results.

2. Kasarinlan High School, canteen staff prepares buko pandan, ice cream, and sweet mango for desserts.
The available beverages are calamansi juice, bottled water, gulaman juice, and pineapple juice. The choices for
rice are plain rice, java rice and sinangag rice. Fish fillet, chicken adobo, pork sinigang, and beef steak for main
dishes. In how many ways can you choose your meal consisting of 1 beverage, 1 main dish, 1 rice, and 1
dessert?

Activity 2: My ways

Answer each permutation problem completely.

1. How many ways can 9 different Geometry books be stacked on a shelf?

6
2. In how many ways can Aling Daniela arrange 7 different drinks in a refrigerator?
3. Daniel has 5 different Algebra books and 3 different Trigonometry books. In how many ways can he arrange
the Algebra books and the Trigonometry books in a shelf?

Activity 3: Correct Me If I am Wrong

Answer each permutation problem completely.

1. In how many ways can you arrange 8 different books on a shelf if there is space enough for only 6 books?

2. In a singing competition with 15 contestants, in how many ways can the organizer select the first, second, and
third place winners?

3. In how many ways can center, power forward, small forward, point guard, and shooting guard be selected
in a set of 10 basketball players?

Remember

1. Let 𝑛 be a nonnegative integer. The factorial notation, 𝑛! (read as “𝑛 factorial”), is defined as the product
of all positive integers from 1 to 𝑛. That is,
𝑛! = 𝑛 × (𝑛 − 1) × (𝑛 − 2) × … × (3) × (2) × (1)
Also, we define 0! = 1.

2. The number of permutations of 𝑛 distinct objects is 𝑛!

3. The number of permutations of 𝑛 distinct objects taken 𝑟 at a time, denoted 𝑃(𝑛, 𝑟), is
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!

4. Permutations that occur by arranging objects in a circle is called circular permutations.

5. The number of permutations of 𝑛 distinct objects arranged in a circle is (𝑛 − 1)!

6. The number of permutations of 𝑛 distinct objects arranged in a circle taken 𝑟 at a time is

𝑃(𝑛, 𝑟)
𝑟

7. 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.

8. If there are 𝑛 objects with 𝑟1 of type 1, 𝑟2 of type 2, …, and 𝑟𝑚 of type m, where 𝑟1 + 𝑟2 + ⋯ + 𝑟𝑚 = 𝑛, then
the number of different permutations of these 𝑛 objects, denoted by 𝑃(𝑛; 𝑟1 , 𝑟2 , … , 𝑟𝑚 ) is given by
𝑛!
𝑃(𝑛; 𝑟1 , 𝑟2 , … , 𝑟𝑚 ) =
𝑟1 ! 𝑟2 ! … 𝑟𝑚 !

Check your Understanding

My Final Decision

A. Given the situations below, apply your knowledge in solving problems involving permutations.

1. There are 3 similar Mathematics books, 2 similar Science books, 4 similar Filipino books, and 3 similar
English books. In how many ways can they be arranged in a cabinet?

2. There are 8 applicants for 4 different positions in the Marketing Department. In how many possible
ways that the positions be filled in?

3. Carla has 6 visitors, and her brother has 8 visitors. In how many ways can they be seated including
Clara and her brother in a circular table? You may leave your answer in factorial form.

4. Find the number of distinguishable permutations of the word REFERENCES.

7
 5. Find the sum of the number of permutations from the word ODD and the word
EVEN.

Post- test

Directions: Read and understand each question carefully. Write the letter of the correct answer on the
space provided before the number.

1. In how many ways can you arrange 7 books in a shelf?

A. 360 B. 72 C. 4 050 D. 5 040
2. Find the number of distinguishable permutations of the letters of the word PARALLEL.
A. 3,360 B. 4,050 C. 6,720 D. 40,320
3. Find the number of different ways that a family of 7 can be seated around a circular table with 7 chairs.
A. 360 B. 720 C. 5,040 D. 40,320
4. Benjie has 4 different Mathematics books and 2 different Science books. In how many ways can he arrange
the said books in a shelf?
A. 1 440 B. 720 C. 520 D. 160
5. There are 12 participants in a Mathematics Quiz Bee. In how many possible ways can they be arranged
as first, second, third, and fourth placers?
A. 3 B. 48 C. 288 D. 11,880

8
 MATHEMATICS 10
Quarter 3 Week 2 ANSWER SHEET

Name: Math Teacher:

Section: Score: