REPUBLIC OF THE PHILIPPINES

Department of Education
Region XII
DIVISION OF SOUTH COTABATO
Tupi North District
South East Asian Institute of Technology, Inc.
National Highway, Crossing Rubber, Tupi, South Cotabato School ID: 406031

Semi-detailed Lesson Plan in Mathematics 10

I. Objectives
At the end of the lesson, students are expected to:
a. define permutation;
b. calculate permutations using fundamental counting principle;
c. apply permutations in solving real-world problems.
II. Subject Matter
Topic: Permutations
Materials: Whiteboard and Markers
Reference: MATH BUILDERS 10 | Permutations, YOUTUBE
III. Procedures
A. Preliminary Activities
 Prayer
The teacher asks one student to lead the prayer.
 Greetings
The teacher greets everyone.
 Checking of attendance
The teacher checks the attendance of the students.
 Review
The teachers asks the students about what are the topics
being discussed last meeting
 Motivation
The teacher’s presents a game called “Pick-mutation”
Every student will be given a strip of paper which will serve
as their bet slip. The teacher will put letters and numbers
inside the box. The students will write only one possible
outcome on the slip. The teacher will collect all the bet slips
 of the students. The teacher will pick letters and numbers
from the box depending on the given condition. The
student with the same permutation of letters and digits will
receive a class coin.
a. Pick three numbers out of five
b. Pick two letters out of six.
c. Pick three from the box with six letters and five
numbers.
Each group will present their activities in class.
B. Lesson Proper
A. Activity
The teacher gives students an activity.
Solve the following:
1. How many different 3-letter arrangements can be formed
using A, B, C, and D without repetition?
2. How many ways can a committee of 2 people be
selected from group of 5 people?
3. A password consists of 4 digits, where each digit can be
a number from 0-9. How many different password are
possible if the repetition of digits is allowed?
B. Analysis
The teacher asks students the following questions:
1. How do you find the activity?
2. Do these activities help you to understand?
C. Abstraction
Permutation refers to the arrangement of objects, in a
specific order, wherein order of elements matters. For
instance, if you have a set of objects, rearranging them in a
different order constitutes a different permutation.
Permutations are often denoted by P(n,r),
Where n, represents the total number of items
 r, represents the number of items being arranged. The
formula to calculate permutation is;
n!
P ( n , r )=
(n−r )!
There are four types of permutations:
1. Permutations without repetitions: in this type, each
element can only be used once in the arrangement. For
example, if you have the set {A, B, C},
Using listing Method
ABC ACB BAC BCA CAB CBA
 Therefore are 6 possible arrangements.
Using the permutation formula,
n!
P ( n , r )=
(n−r )!
3!
P ( 3 ,3 )=
(3−3)!
3!
P ( 3 ,3 )=
0!
3x 2x 1
P ( 3 ,3 )=
1
¿ 6 ways
2. Permutations with repetitions: in this type, each
element can be repeated. The permutation formula since it
can be repeated we used nr.
For example, if you have the set {A, B, C},
Listing method
AAA AAB AAC ABA ABB ABC ACA ACB ACC
BAA BAB BAC BBA BBB BBC BCA BCB BCC
CAA CAB CAC CBA CBB CBC CCA CCB CCC
In total, there are 33= 27 possible permutations with
permutations with repetition of 3 elements.
 3. Permutations of identical items in permutations with
n!
identical items, the formula P ( n , r )= is used, where n1, n2,
¿¿
…, nk are the counts of identical items.
Example: In how many ways can the letters of the word
“ELLIPSES” be arranged in a row?
Solution: There are 8 letters of the word. Of these letters; I,
and P appears just once, while E, L and S appears twice
each. Hence, the number of distinct permutations is given by
n! 8!
P= = =5,040 ways
n1 ! n2 ! … nk ! 2! 2! 2 !
4. Circular Permutations: in circular permutations, the
items are arranged in a circle rather than straight line. For n
distinct items in a circle, there are (n−1)! Permutations.
Example. Suppose we have 4 people and we wish them to
be arranged on a circular table. In how many ways can this
be done?

There are 4 number of objects to be

arranged on a circular table. Using the formula,
(n-1)!
(4-1)!
3! = 6 possible arrangements.
D. Application
Answer the following on the board.
1. If there are 8 applicants and only 3 job slots are available,
in how many ways can the jobs be assigned?
2. Find the numbers of different ways can 10 employees
occupy the chairs with in a circular table?
IV. Evaluation
Answer the following:
1. A four-digit pin lock contains numbers 1,3, 5, 7. How many possible
permutations of the digits will it have?

2. If five alphabets are to be chosen from A, B, C, D, E, F, G, and H such that

repetition is not allowed, then how many ways can it be done?

3. How many distinguishable permutations are possible with all the letters of
the word ELLIPSES?

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

5711922712.

V. Assignment
Answer the following questions. Show necessary solution.
a. A teacher wants to assign 9 different tasks to r number of students. Find
the value of r if the teacher can assign the tasks in 3024 possible ways
b. A librarian wished to arrange 7 books on a mini-shelf. The number of
books that could fit on the shelf is r books. Find the value of r if the
possible ways that the books could be arranged is 840 ways