A Demonstration Plan

In
MATHEMATICS 10
By
Jay Cris A. Macatuggal

I. Objectives:
At the end of a 60-minutes discussion the students are expected to:
1. illustrate permutation of objects,
2. solve problems involving permutations, and
3. apply the concepts of permutation in real life situations.

II. Subject Matter:

Topic:
PERMUTATION
References:
Math 10 Learners Module (page 286-297)
YouTube: https://youtu.be/EkfhT6vwL-4
Materials:
TV, Laptop, Calculators
Skills to be Developed:
Cooperation, Critical Thinking, Solving

III. Procedures
Teachers Activity Students Activity
A. Preliminary Activities

1.Prayer
May I ask everyone to please stand in Let us bow our heads and feel the presence of
your chairs, Janel please lead the the lord.
prayer.

2. Greetings
Good morning, class! Good morning, sir!
 3. Classroom Set-up
Before taking your seats please align (student will arrange their chairs and pick
your chairs and pick all the litters near some litters)
to you.

4. Checking of Attendance
Ms. Secretary, could you please tell me Sir, there is no absent today.
if there is an absent today?

B. Recalling

So, before we start our topic for today, (students raise their hands)
who among you can remember our last
topic in our last quarter.

Yes, Jerold Our topic last quarter is all about circles,

graphs and solves problems involving circles.

C. Motivation
At this point, see the problem and try to
solve.
Number Number of Number of Number Number of Number of
of objects objects take possible of objects objects take possible
(n) at a time arrangements/ (n) at a time arrangements/
(r) Permutations (r) Permutations
2 1 2 1 2
2 2 2 2 2
3 1 3 1 3
3 2 3 2 6
3 3 3 3 6
4 1 4 1 4
4 2 4 2 12
4 3 4 3 24
4 4 4 4 24

D. Presentation of the Lesson

How do you find our activity? Exciting and enjoyable.

Those possible arrangements are what

we called permutation.

Now let us first focus on this

5(4)(3)(2)(1) = 120
 What can you notice?

Another way how to express what we

did is to use this exclamation point
symbol “!”, which in mathematics
called factorial notation.
! (FACTORIAL)

So, in this case

5! = 120

E. Development of the Lesson

Factorial is the product of all positive

integers less than or equal to a given
positive integer and denoted by that
integer and an exclamation point.

6! = 6(5)(4)(3)(2)(1) = 720
4! = 4(3)(2)(1) = 24

Special case
0! = 1 and 1! =1

Let us try to work with factorials

(20-17)! (20-17)! = 3! = 6

10!
10! 10 (9)(8!)
8! = = 10 (9) =90
8! 8!

Permutation refers to the different

possible arrangements of a set of
objects.

Different ways on how can we illustrate

Permutation
 Fundamental Counting Principle
 Systematic Listing Method
 Tree Diagram

Fundamental Counting Principle

states that if there are n ways of
doing something, and m ways of
doing another thing, then there are
m(n) different ways to do both.
Example:
In how many ways can we arrange A,
B, C, and D in a row?

Solution:
4! = 4(3)(2)(1) = 24

In how many ways can Jomary, Jay

Cris, Jerold, Ackmed, and Devin be 5! = 5(4)(3)(2)(1) = 120
arranged in a row by photographer for
picture taking?

Systematic Listing Method is a

method used to determine the
number of permutations made for
each problem. The advantage of this
method is you can see all the possible
arrangements of an object, but the
downside of this method is it
consumes time for bigger number of
objects.

Example:
List the possible arrangements of A, B, ABC
and C when arrange in a row. ACB
BAC
BCA
CAB
CBA

There are 6 possible arrangements for

A, B, and C when arrange in a row.

Try this.
List the possible arrangement of John John – Joseph
and Joseph when arrange in a row. Joseph – John

Tree Diagram is a simple way to

illustrate the possible outcomes of an
event.
 Example:
In how many ways can 3 True or False
question be answered?

TRUE TTT
TRUE
FALSE TTF
TRUE
TRUE TFT
FALSE
FALSE TFF

TRUE FTT
TRUE
FALSE FTF
FALSE
TRUE FFT
FALSE
FALSE FFF

We also calculate the different

permutations by applying the formula.

𝑛!
𝑃(𝑛, 𝑟) = (𝑛−𝑟)!
taken r at a time

𝑃(𝑛, 𝑛) = 𝑛! taken all at a time

Example:
a. Ten runners join the race, in how many
possible ways can they be arranging as
first, second, and third place?

Who wants to solve?

Using the formula
Yes, Jerold. 𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟 )!
 10!
𝑃(10, 3) =
(10 − 3)!
10!
𝑃(10, 3) =
7!
10(9)(8)(7!)
𝑃(10, 3) =
7!
𝑃(10, 3) = 10 (9)(8)
𝑃(10, 3) = 720 ways

F. Application
I am going to group you into two
groups and each group will be given a
problem. Use any method in solving.

Group 1
Given the four letter word READ, in 𝑃(4, 4) = 4!
how many ways can we arrange its = 24
letter, 4 at a time?

5!
Group 2 𝑃(5, 3) =
(5 − 3)!
In a school club, there are 5 possible 5!
choices for the president, vice president, 𝑃(10, 3) = 2!
and secretary. In how many ways can 5(4)(3)(2!)
the three officers be detected? 𝑃(10, 3) =
2!
𝑃(10, 3) = 5 (4)(3)
𝑃(10, 3) = 60 ways

G. Valuing
Anyone in the class?

What is the help of permutations in our Permutations can help us to think of possible
daily life situations combinations where each arrangement is very
important for example the password of our
cellphone when we forget to remember it.

H. Generalization

How do you find our lesson for today? Easy

 Who can give me the summary of our There are three different ways on how
lesson? can we illustrate Permutation
 Fundamental Counting
Principle
 Systematic Listing Method
 Tree Diagram

We calculate the different permutations by

applying the formula.
Another?
𝑛!
𝑃(𝑛, 𝑟) = (𝑛−𝑟)!
taken r at a time

𝑃(𝑛, 𝑛) = 𝑛! taken all at a time

IV. Evaluation
Answer on a ½ crosswise and show your solution.
Expected Answers
1. P(4,2)
𝟒! 𝟒!
𝑷(𝟒, 𝟐) = (𝟒−𝟐)!
= = 𝟏𝟐
𝟐!

2. P(7,7)
P(7,7) = 7! = 5040
3. P(10,2)
𝟏𝟎! 𝟏𝟎!
𝑷(𝟏𝟎, 𝟐) = = = 𝟗𝟎
(𝟏𝟎 − 𝟐)! 𝟖!
4. In how many ways can we arrange 10 people in a row?
P(10,10) = 10! = 3628800

5. Jonah forgets his 3-digit password in his padlock and only remembers that the digits
must be 4, 5, and 7. List the entire possible password that Jonah must try.
457, 475, 547, 574, 745, and 754.

V. Assignment
Please make an advance reading for our next topic Combination.