GRADE 10 MATHEMATICS LESSON PLAN

Name of the School: KIBAYAO HIGH SCHOOL Name of teacher: SALAHUDIN A. BASAYAN
ABC Class: 10 Subject: Mathematics 10
Average age: 15 Topic : PERMUTATIONS
No. of students: 43 Name of the book : Mathematics 10 (LEARNERS MODULE)
Duration: 50 mins
Date: 03/01/2024 Publisher : SCERT, Kohima.
General Objective:
Student will:
1. determine the possible ways of arranging the given figures;
2. identify the number of arrangements or ways that a task can be carried out using systematic listing and formula for permutation and
3. solve problems involving permutations.

Approach: Constructivist (5E Model)

Method: Demonstration cum Explanation, Problem Solving
Technique: Activity based
TLM: PRESENTATION, GAMES, CARDS, AND COLORED PAPERS

TIME STEPS TEACHER ACTIVITIES STUDENT ACTIVITIES TLM

10 A. ENGAGE VISUAL
MINUTES 1. PRELIMINARY ACTIVITIES AIDS
1.1 PRAYER
1.2. GREETINGS
1.3. SETTING CLASSROOM STANDARDS
1.4. CHECKING OF ATTENDANCE
2. DRILL
4. MOTIVATION -

ACTIVITY THE STUDENTS WILL ENGAGE

IN THE SAID ARRANGEMENT CARDS,
GAMES COLORED
ARRANGEMENT GAMES PAPERS
5 Students notes down their
MINUTES EXPLORE Instructions: findings/observations
List down all possible arrangements you can form
or derive from the given words, numbers, objects or figures.
Example is provided for you. (13 points)

Words, Possible Unique/Different Number of

Numbers, Arrangements Possible
Objects or Arrangements
Figures
Example: 123, 132, 213, 231, 312,
6
123 321
1. 18
2.

3. M A T H

Instructions: Answer the question based on the previous activity.

Write your answer on the space provided. (12 points)
1. What did you observe about the arrangements of the given figures?
_________________________________________________________________________________
_
_________________________________________________________________________________
_
2. How did you determine the number of possible arrangements in organizing and
arranging the given words, numbers or figures?
_________________________________________________________________________________
_
___________________________________________________________
Rubrics:
 Score
Criteria 3 points 2 points 1 point Question
Question 2
1
Details, Main ideas are Some ideas Ideas are not
Organization clear, detailed, are clear, clear and
relevant and not so irrelevant.
in logical detailed,
order. some are
relevant, &
in logical
order.
Sentence Sentences are Some Sentences are
structure / well– sentences difficult to
Mechanics constructed, have understand,
neat, no errors several has errors in
in spelling, errors in spelling &
and used spelling, misused
words has few words.
correctly. erasures
and
misused
words.
TOTAL

10 EXPLAIN Permutation refers to the different possible arrangements of a set PRESENTATION

MINUTES of objects. It is an arrangement or listing of objects in which order is
important.

Example 1:
From the word YOU, how many distinct arrangements of 2 letters can be
formed?
Solution:
By systematic listing, take any ordered arrangements of 2 letters at
a time, we have
YO OY YU UY OU UO

Hence, there are 6 distinct arrangements of 2 letters.

You notice that YO is different from OY. This is an example of permutation

wherein order of arranging the objects is important.

A permutation of n objects taken r at a time is an arrangement of r of

the n objects in a specific order. The symbol for this number is P (n, r).

Generally, if we want to find the permutation of n objects taken r at a time,

we use the formula,
n!
P (n, r) = where n≥ r
( n−r ) !

P (n, r) is read as “ the permutation of n taken r at a time.”

n ! is read as “ n factorial.”. Example is 3 ! = 3 •2 •1 = 6

In example 1, we have 3 letters in the word YOU to be arranged 2 at a time.

Here we have n = 3 and r = 2. Using the formula, we have
n!
P (n, r) =
( n−r ) !
3! 3• 2• 1 6
P (3, 2) = = = = 6 arrangements
( 3−2 ) ! 1! 1

You will notice that the number of arrangements obtained in the systematic
listing is the same with the resulting value (equal to 6) using the formula of
permutation.

Example 2: In a race with 7 runners, in how many ways can the runners
end up in first, second, and third place?
Solution:
n = 7 runners r = 3 places/ranks to be awarded
n!
P (n, r) =
( n−r ) !
7! 7 •6 •5 • 4 !
P (7, 3) = = = 7 •6 • 5 = 210
( 7−3 ) ! 4!

Hence, there are 210 possible results of the race that the runners can end up
in the First, Second and Third place.

Example of possible result of the race is: Runner no.1 - first

 Runner no.5 – second
Runner no.2 – third
or another possible outcome maybe: Runner no.4 - first
Runner no.1 – second
Runner no.7 – third and so
on…
All in all, there are 210 possibilities.

Example 3: What if there are 5 objects to be arranged and we would

arrange all
of them every time?
Solution:
Since 5 objects will be arranged every time, n = 5 and r = 5 then, n = r. So,
we have
n!
P (n, r) =
( n−r ) !
n! n! n!
P (n, n) = = = = n!
( n−n ) ! 0! 1
Hence,
P (n, n) = n !

In example 3, n = 5 and r = 5, so n = r = 5. The permutation is

P (n, n) = n !
P (5, 5) = 5 ! = 5 • 4 •3 •2 •1 = 120

Hence, there are 120 ways to arrange the objects.

Example 4:
Find the number of permutations of the letters of the word
CHOCOLATE.
Solution:
There are 9 letters of the word. If the letters are distinct and allowed
to be repeated, then there are
P (n, n) = n !
P (9, 9) = 9!

Notice that in example 3, the word CHOCOLATE has 9 letters but it has 2
letters C and 2 letters O, so
n = 9 (total number of letters), p = 2 (two letters C) and q = 2 (two
letters O).

Using the formula for permutation of a set of objects where some are alike:

n!
P (n, r) =
p! q!r! …

9! 9 •8 •7 • 6• 5 •4 •3 •2 ! 181440
= = = = 90,720
2! 2 ! 2 ! 2• 1 2

Hence, there are 90,720 ways to arrange the letters of the word
CHOCOLATE.

Circular Permutation of n Objects

Let us now consider arrangement of objects in a circle, which we call

Circular Permutations. It is the number of distinguishable permutations of
n objects arranged in a circle with no fixed reference point.

The permutation of n objects arranged in a circle is denoted by

P = (n – 1)!
Example 5:
In how many ways can 4 people be seated around a circular table?
Given:
n = 4 people
Solution:
P = (n - 1)!
= (4 -1) !
=3!
= 3 •2 •1
= 6 ways

Hence, there are 6 possible ways to arrange 4 people in a circular table.

20 ELABORATE Interaction with students justifying/correcting the findings/observations ACTIVITY
MINUTES and relates to the content of the day, further adds more related information
Instructions: Solve the
following problems involving
permutations. Write your
solutions in the second column
of the table. (10 points/ GROUP)

1. How many ways can the

letters in the word
BANGSAMORO be arranged? (5
points)

2. NORESA has 8 new dresses to

display but has 5 mannequins
only. How many ways can she
arrange and dress them up?
(5 points)

3. In how many ways can Babo

Kitem arrange 6 potted plants in
a row?
4. In how many ways can 5
people be seated around a
circular table?
5. Butch plans to make his
homework, do gardening, go
shopping or swimming this
weekend. But he realized that he
can only do 2 of these 4 activities
in a day.

5. a. How many different ways

can he arrange the 2 activities?
(5 points)
 5. b. List down all of the possible
2-activity arrangements of Butch
for the day.
(5 points)

10 EVALUATE Students response/solution/work evaluated ACTIVITY

MINUTES Instructions: Evaluate the
following permutations. (5 points
EACH)

1. P (5, 2) =
2. P (10, 4) =
3. P (8, 8) =
4. n = 7, r = 3
5. n = 8, p = 3, q = 2
6. Find the number of
permutations of the letters
of the word MANISAN.
7. In how many ways can 4
people be seated around a
circular table?
8. In a race with 7 runners,
in how many ways can the
runners end up in first,
second, and third place?
9. From the word DATU, how
many distinct arrangements of 2
letters can be formed?
 10.

# Elaborate and Evaluate steps may continue until completion of exercise problems to be solved under the same concept for more than one period. TIME:
Maximum time been indicated and may vary depending on requirement.
HOME ASSIGNMENT:
REFLECTION:
References:
1. K to 12 Most Essential Learning Competencies
2. Oñada, S.A. (2020) Grade 10 Quarter 3 Module 1 pp. 1 – 15
3. Ogena, E. Ph.D et. al. Our Math Grade 10, pp. 293 - 340
4. Math 10 Quarter 3 Learner’s Material pp. 283 - 300
5. Molano, J. (2021) Math 10 TRG and LAS Quarter 3 Week 2 pp. 1 – 6
6. Mador, E. (2021) Math 10 TRG and LAS Quarter 3 Week 1 pp. 1 – 6