SELF-LEARNING HOME TASK (SLHT)

Subject: Mathematics Grade: 10 Quarter: Third Week: 1

MELC: illustrate the permutation of objects Competency Code: M10SP - IIla-1
Name: __________________________ Section: ____________ Date: ________
School: __________________________ District: __________________________

I. Readings/Discussions

Have you ever tried arranging objects with a specific order? If yes, this is where the idea of
permutation comes in.
Permutations are used in almost every branch of mathematics and in many other fields
of science. In computer science, they are used for analyzing sorting algorithms; in quantum
physics, for describing states of particles; and in biology, for describing RNA sequences.

Recall:
Let us review first the concept of the Fundamental Counting Principle you learned in Grade 8
Mathematics.

Fundamental Counting Principle (FCP) or Multiplication Counting Rule

The fundamental counting principle is a rule used to count the total number of possible
outcomes in a situation. It states that if there are p ways to do one thing, q ways to do another
and r ways to do another, then there are 𝒑 ∙ 𝒒 ∙ 𝒓 ways to perform these actions.

Example 1: Suppose you have 3 shirts, 4 pairs of pants and 2 pairs of shoes. In how many ways
can you choose your outfit using a shirt, a pair of pants and a pair of shoes?

Explanation: There are several ways to solve this problem. By systematic listing, by tree diagram
and by Fundamental Counting Principle using the Box Method. Since the problem is only asking
for the number (not the list) of the possible ways or outcomes, we will use the Multiplication Rule.
shirts pants shoes
3 choices 4 choices 2 choices

By using the box method, 3 4 2

Therefore, by multiplying 𝟑 𝒙 𝟒 𝒙 𝟐, there are 24 ways you can choose your outfit.

Example 2: How many ways can you arrange 5 different books on a shelf if there is space
enough for only 3 books?
1st space 2nd space 3rd space
5 4 3
st
Explanation: Any of the 5 books can be placed on the 1 space, any of the remaining 4 books
can be placed on the 2nd space and any of the remaining 3 books can be placed on the 3 rd
space. (Refer to the table above.) By box method,
5 4 3
Therefore, by multiplying 𝟓 𝒙 𝟒 𝒙 𝟑, there are 60 ways you can arrange 5 books on a
shelf with only 3 vacant spaces.

1
 When a photographer wanted to know many possible ways he can arrange 3 people
(A, B and C) in a row for picture taking, he is doing permutation. This means that the
arrangements (A,B,C), (A,C,B), (B,A,C), (B,C,A), (C,A,B) and (C,B,A) are 6 different orders or
positions of a photograph. This is an example of permutation of 3 objects taken all at a time.
Likewise, if there are 5 people and only 3 of them will be arranged in a row for picture taking,
this is a permutation of 5 objects taken 3 at a time and there are a lot of possible arrangements
can be made by the photographer.

Permutation is an arrangement of all or part of a set of objects where order is important.

In symbols, the Permutation (P) of n objects taken r at a time is denoted by 𝑷(𝒏, 𝒓).
Some books are using notations like 𝑷𝒏,𝒓 and nPr.. In this learning material, we will use 𝑷(𝒏, 𝒓).
Examples:
1. P(5,2) is read as “permutation of 5 objects taken 2 at a time”. This means that we
will be arranging 5 objects using only 2 objects in each arrangement.
Let us list down the possible arrangements of 5 objects (let’s say A,B,C,D and E) taken
2 at a time. These are the following:
AB, AC, AD, AE, BA, BC, BD, BE, CA, CB, CD, CE, DA, DB, DC, DE, EA, EB, EC, ED
There are 20 possible arrangements of 5 objects taken 2 at a time.
This time, we will apply the Fundamental counting Principle using the box
method. Since we are arranging 5 objects (n) taken 2 at a time (r), we will make only 2
boxes. Since any of the 5 objects (A,B,C,D,and E) can take the first box, we write 5 in
the first box. Assuming that one of the objects has been used in the first box, there are
only 4 remaining objects that can take the second box. So, we write 4 in the second box.
5 4
Multiplying 5 and 4 we also get 20.
Therefore, the value of P(5,2) = 20 or we can say that the permutation of 5 objects
taken 2 at a time is 20. Take note that n = 5 (no. of objects) and r = 2 (no. of boxes).

2. P(4,4) is read as “permutation of 4 objects taken all at a time”. This means that we
will be arranging 4 objects using all the 4 objects in each arrangement.
Again, we will list down the possible arrangements of 4 objects (let’s say A,B,C,D) taken
all at a time. These are:
ABCD, ABDC, ACBD, ACDB, ADBC, ADCB, BACD, BADC, BCAD, BCDA, BDAC, BDCA,
CABD, CADB, CBAD, CBDA, CDAB, CDBA, DABC, DACB, DBAC, DBCA, DCAB, DCBA.
There are 24 possible arrangements of 4 objects taken all at a time.
We will now apply the FCP in finding the number of possible arrangements to shorten
the process. Since we are arranging 4 objects (n) taken all 4 at a time (r), we will make 4 boxes
and write 4 (the value of n) in the first box. Assuming that one object has taken the first box, 3
objects can take the 2nd box, 2 objects in the 3rd box and 1 object in the 4th box as shown below.
4 3 2 1
Multiplying 4 x 3 x 2 x 1, we get 24.
Therefore, the value of P(4,4) = 24 or we can say that the permutation of 4 objects taken
all at a time is 24. Take note that n = 4 (no. of objects) and r = 4 (no. of boxes).
Considering the entries of the box method of examples 1 and 2, we noticed that the factors
(numbers multiplied) start with n and the succeeding factors decrease by 1 each time.

2
Let’s take example 2 for discussion. The factors are 4 ∙ 3 ∙ 2 ∙ 1 or n(n – 1)(n – 2)(n – 3). Notice
that the first factor is n and the last factor is (n – 3).
Take note also that n – 3 = n – (4 – 1)
= n – (r – 1) or n – r + 1 (since 4 = r)

The number of permutations of n objects taken r at a time, 𝑷(𝒏, 𝒓) where 𝒏 ≥ 𝒓 is:

𝑷(𝒏, 𝒓) = 𝒏(𝒏 − 𝟏)(𝒏 − 𝟐) … (𝒏 − 𝒓 + 𝟏).

Take note of the following:

𝑃 (4,4) = 4 ∙ 3 ∙ 2 ∙ 1 (We multiply all the numbers from n = 4 down to 1.) Another way of writing
4 ∙ 3 ∙ 2 ∙ 1 is 4! (read as 4 factorial).
Likewise, 5! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟏𝟐𝟎
10! = 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟑 𝟔𝟐𝟖 𝟖𝟎𝟎
7! = 7 ∙ 6 ∙ 𝟓! = 42 ∙ 120 = 𝟓𝟎𝟒𝟎 (Note: We can stop expanding the factors at 5
but we have to write the symbol !. This is done when you already knew the value of the factorial
of that number or when you want to cancel out common factors to shorten the process.)
1! = 1
For convenience, we define 0! = 1.

𝒏! is defined as the product of all positive integers from 𝒏 down to 1; that is,
𝒏! = 𝒏(𝒏 − 𝟏)(𝒏 − 𝟐) … 𝟑 ∙ 𝟐 ∙ 𝟏
In addition, since 𝑷(𝒏, 𝒓) = 𝒏(𝒏 − 𝟏)(𝒏 − 𝟐) … (𝒏 − 𝒓 + 𝟏)
𝒏(𝒏−𝟏)(𝒏−𝟐)…(𝒏−𝒓+𝟏)(𝒏−𝟏)!
= (𝒏−𝟏)!
𝒏!
Then, 𝑷(𝒏, 𝒓) = (without repetition)
(𝒏−𝒓)!
In general: The permutation of 𝒏 objects taken 𝒓 at a time (when repetition is Not allowed)
is:
𝒏!
𝑷(𝒏, 𝒓) = and the permutation of 𝒏 objects taken all at a time is: 𝑷(𝒏, 𝒏) = 𝒏!
(𝒏−𝒓)!

Illustrative Examples:
Directions: Evaluate the following expressions.
1. P(6, 4)
a) By box method: (number to be written in the first box = 6, number of boxes = 4)

6 5 4 3 = 360 answer

b) By formula: (n = 6, r = 4)
𝒏!
𝑷(𝒏, 𝒓) =
(𝒏−𝒓)!
6! 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2!
𝑃(6,4) = (6−4)! = = 30 𝑥 12 = 𝟑𝟔𝟎
2!

Note: We stop at 2! because the denominator is equal to 2! to cancel out common factors.

3
 2. P(7,7)
a) By box method: (first number = 7, number of boxes = 7)

7 6 5 4 3 2 1 = 5040 answer

b) By formula: (n = 7, r = 7) Since r = n, then we will use 𝑷(𝒏, 𝒏) = 𝒏!

𝑷(𝟕, 𝟕) = 𝟕! or 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟓𝟎𝟒𝟎
(𝟖−𝟑)!𝟐!
3.
𝟕!
In this case, permutation formula cannot be applied. We will evaluate the expression
using the rules of factorials then simplify.
(𝟖−𝟑)!𝟐! 5!2! 5!2! 2 𝟏
can be simplified into = = 𝒐𝒓 answer
𝟕! 7! 7 ∙ 6 ∙ 5! 42 𝟐𝟏

IMPORTANT: We CANNOT add, subtract, multiply or divide factorials but we can

cancel out common factors.
a) 2! + 3! ≠ 5! Note:
b) 6! – 2! ≠ 4! To evaluate these expressions, find the value of
each term first then perform the operations as
c) 3! ∙ 2! ≠ 6! indicated.
7! 3! + 4!
d) ≠ 4! (Cancellation is not possible because 4! in the numerator is not a factor.)
7! 3!

When Repetition is Allowed

Consider this problem.
How many 3-digit numbers can you form using the digits 1, 2, 3, 7, 8 and 9
a) if repetition of digits is not allowed? b) if repetition of digits is allowed?

Solutions:
a) (n = 6 and r = 3) Write 6 in the first box using 3 boxes.
6 5 4 = 120
Since repetition is not allowed, we decrease each factor by 1.
This is the same as the permutation of 6 objects taken 3 at a time without repetition.
6! 6 𝑥 5 𝑥 4 𝑥 3!
By using the formula, we have 𝑃(6,3) = = = 120 (3-digit numbers)
(6−3)! 3!

b) (n = 6 and r = 3) Write 6 in the first box using 3 boxes.

6 6 6 = 𝟔𝟑 𝑜𝑟 216 (3-digit numbers)
Since repetition is allowed, we can still use all the digits in any of the remaining boxes. This is
why all the factors are equal.
In this case, the permutation formula given earlier is not applicable. Based on our
answer in (b), we can create another permutation formula when repetition is allowed.

The permutation of 𝒏 objects taken 𝒓 at a time if repetition is allowed is: 𝑷(𝒏, 𝒓) = 𝒏𝒓

4
Distinguishable Permutation
Suppose we are to arrange the letters of the word “READ” taken all at a time. It is easy
to determine the number of permutations because there are no identical letters. This is just the
same as the permutation of 4 objects taken 4 at a time. Therefore, the answer is P(4,4) or 4!
which is equal to 24.
But what happens when we arrange the letters of the word “REAR” where there are 2
identical letters? Obviously, the number of permutations is affected by these two identical letters
because the duplications will be eliminated. Meaning, the arrangements REAR and REAR are
counted as 1 because these two arrangements are the same. Since there are 2! ways of
arranging the two R’s without changing the arrangement of the others, the permutation of 4
letters is divided by 2! or 2. This is called distinguishable permutations.
4! 24
Thus, 𝑃 (4,4) = = = 12. So, there are 12 distinguishable permutations.
2! 2

The number of distinguishable permutations, P, of n objects where p objects are

alike, q objects are alike, r objects are alike, and so on, is
𝒏!
𝑷=
𝒑! 𝒒! 𝒓!

Example: Find the number of permutations of the letters of the word BREEDER.
Solution.
Given: n = 7 (7 letters in a word), p = 2 (there are 2 R’s), q = 3 (there are 3 E’s)
Unknown: P
7! 7 𝑥 6 𝑥 5 𝑥 4 𝑥 3! 42 𝑥 20 840
𝑷= = = = = 420 distinguishable permutations
2! 3! 2! 3! 2 2

Circular Permutation
So far, all the permutations discussed above were linear permutations. Objects were
arranged in a row or in a line. How about arranging the objects in circular manner? This
process of arrangement is called circular permutation.
Let us consider this situation.
 Three friends (A, B, and C) wanted to sit around a circular table for dinner. In how many
ways can they arrange themselves?
If we consider this as arranging in a row, the answer would be 3! or 6 ways. But since they are
to sit around a circular table, what matters now is who is sitting to their left and to their right.
The seating arrangements ABC, CAB and BCA in circular form are just the same because in
any of the cases, A is sitting to the right of B and C is sitting to the left of B. See the
illustrations below.

B A C
considered as 1
arrangement

If A and C in any of the above arrangements will exchange their position, it changes the
arrangements because A will be sitting to the left of B and C will be sitting to the right of B.

5
 So, the possible circular arrangements of these 3 people are:

B B
and

Therefore, there are only 2! or 2 possible ways they can arrange themselves in a round table.
So, the circular permutation of 3 objects is:
𝑷 = (𝟑 − 𝟏)! = 𝟐! 𝒐𝒓 𝟐

The circular permutation of n objects is:

𝑷 = (𝒏 − 𝟏)!

Example: Find the number of different ways that a family of 5 can be seated in a round table
with 5 chairs.
Solution:
Given: n = 5 𝑃 = (5 − 1)! = 4! 𝑜𝑟 𝟐𝟒 ways
Unknown: P

II. Exercises
Exercise 1.
Directions: Evaluate the folowing expressions. Write your answers on your answer sheet.

1. 0! + 1! + 2! + 3!
2. 5! − (36 + 4!)
12!
3.
10!
4. 𝑃(8, 3)
𝑃(6,6)
5.
𝑃(4,3)

Exercise 2.
Directions: Solve the following problems on your answer sheet.

1. Find the number of permutations of 7 different objects taken 4 at a time without repetition.
2. How many ways can you arrange 5 distinct objects taken 3 at a time if repetition is allowed?
3. In how many ways can 6 people be seated in a circular table if there are exactly 6 seats?
4. Find the number of distinguishable permutations of the letters of the word REFERRER.
5. List down the possible arrangements of a 4-digit number using the digits 0, 1, 2, and 3
without repetition and no number should start with 0. Check your answer using the FCP.

6
III. Assessment/Application/Outputs

A. Directions: Choose the letter of the correct answer and write it on your answer sheet.
1. Which of the following is the same as 6 ∙ 5 ∙ 4 ∙ 3?
A. P(6,3) B. P(6,4) C. P(6,5) D. P(6,6)
2. In how many ways can you arrange 10 different potted plants in a row?
A. 10! B. 9! C. 8! D. 7!
𝑃(3,3)
3. Find the value of .
3!
A. 3 B. 2 C. 1 D. 0
4. Which of the following equations is TRUE?
9!
A. 3! 4! = 12! B. 10! – 10! = 0! C. (3 + 2!) = 5! D. = 0!
9!
5. If we want to find the value of P(8, 5) using the box method, how many factors will there be?
A. 8 B. 5 C. 4 D. 3
6. Suppose you want to find the number of permutations of 4 similar Math books, 3 similar English
books and 2 similar Science books in a row, which of the following expressions will give the
answer?
9! 4!3!
A. 𝑃 = B. P(9, 9) C. 𝑃 = D. P = (9 – 1)!
4!3!2! 2!
7. Which of the following situations or activities order is important?
A. a lady selecting her outfit from her blouses, skirts and sandals
B. choosing 3 out of your 5 friends to watch a movie
C. making your 10- character password for your FB account
D. forming a dance troupe with 12 members
8. If P(n, 4) = 120, what is n?
A. 8 B. 7 C. 6 D. 5
9. What is the value of r in P(7, r) = 210?
A. 3 B. 4 C. 5 D. 6
10. Find 𝑥 if 52 + 2𝑥! = 100.
A. 24 B. 12 C. 4 D. 2

B. Directions: Solve the following problems. Show your solutions on your answer sheet.
1. Ten runners join a race. In how many ways can they be arranged as first, second, and third
placers? Use the permutation formula.
2. A couple is planning to have 4 kids. On any birth, the child could be a son or a daughter. In
how many ways can they give birth to their 4 children? Use the FCP or Box Method.

IV. Suggested Enrichment/Reinforcement Activity

Directions: Solve the following problem by listing and by FCP. Show your solutions on your answer
sheet.
Three boys and two girls want to have their picture taken. In how many ways can they
arrange themselves alternately in a row?

Note: For uniformity of answers use B1, B2, B3 for Boys and
G1, G2 for Girls for your listing.

7
REFERENCES:

 Mathematics Learner’s Module Grade 10. pp. 275 – 297.

 https://brainly.ph/question/504951
 https://documents.uow.edu.au/content/groups/public/@web/@eis/@maas/documents/m
m/uow168693.pdf

Prepared by: Edited by:

ROY R. FLORES PAMELA P. SESALDO
T-3 MT - I
Catmon National High School Compostela National High School

Reviewed by:

PAMELA A. RODEMIO
EPS, Mathematics
Division of Cebu Province

GUIDE

For the Teacher: Advise the students to read the reading and discussion portion before they
attempt to answer the practice exercises. Going through the parts sequentially will help them
understand easily the topic.

For the Learner: Read through the self-learning home task from the first part to the last part.
Doing so, will help you understand better the topic.

For the Parent/Home Tutor: Assist your child and make sure that he/she reads the self-
learning home task from beginning to end to ensure proper understanding of the concepts.