Lesson Plan
Lesson Plan
Lesson Plan
I. Objective
Given several activities, the Grade 10 students are expected to illustrate the
A. Topic: Permutation
B. References:
5.https://www.statisticshowto.datasciencecentral.com/fundamental-
counting-principle
C. Instructional Materials:
1. Printed Visual aids
2. Pictures
3. Raffle box
A. Activity
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.
1. Pick three numbers out of five
2. Pick two letters out of six.
3. Pick three from the box with six letters and five numbers.
B. Analysis
The teacher will let the students answer word problem about permutation
on distinct objects.
1. If there are 8 applicants and only 3 job slots are available, in how
many ways can the jobs be assigned?
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!
8!
𝑃(8,3) =
(8 − 3)!
8!
𝑃(8,3) =
(5)!
8𝑥7𝑥6𝑥5𝑥4𝑥3𝑥2𝑥1
𝑃(8,3) =
5𝑥4𝑥3𝑥2𝑥1
𝑃(8,3) = 8𝑥7𝑥6
𝑷(𝟖, 𝟑) = 𝟑𝟑𝟔 𝒘𝒂𝒚𝒔
2. Find the number of different ways can 10 employees occupy an
office with 10 working desks.
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!
10!
𝑃(10,10) =
(10 − 10)!
10!
𝑃(10,10) =
(0)!
10!
𝑃(10,10) =
1
𝑃(10,10) = 10!
The given objects above are not all distinct since there are objects that
appear more than once namely; 3 oranges, 2 apples, and 2 watermelons. The
arrangement will not be change even if oranges will switch places. Hence, we use
a different formula which is known as distinguishable permutation.
C. Abstraction
𝑛!
𝑃(𝑛, 𝑟) =
(𝑛 − 𝑟)!
7!
840 =
(7 − 𝑟)!
7!
=6
840
6 = 3!
(7-r)! = 3!
7! - r! = 3!
r! = 7! -3!
r! = 3!
r=3
The teacher will discuss about circular permutation and give an example:
Circular Permutation
The number of circular permutations of n different objects is equal to
the number of linear permutations divided by n.
𝒏(𝒏−𝟏)(𝒏−𝟐)(𝒏−𝟑)…(𝟑)(𝟐)(𝟏)
= (𝒏 − 𝟏)(𝒏 − 𝟐)(𝒏 − 𝟑) … (𝟑)(𝟐)(𝟏) = (n-1)!
𝒏
Example:
(n-1)!
(4-1)!
3! = 6 possible arrangements
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
𝒏! 𝟖!
𝑷= = = 𝟓, 𝟎𝟒𝟎 𝒘𝒂𝒚𝒔
𝒑! 𝒒! 𝒓! 𝟐! 𝟐! 𝟐!
D. Application
IV. Assessment
The teacher will let the students answer Journal number 4. Attached
here is a copy of the journal.
JOURNAL #4: Quarter 3
Activity 1: Using the permutation formula, find the possible ways
events can be done. (10 points)
1. A four-digit pin lock contains 2. If five alphabets are to be chosen from
numbers 1,3, 5, 7. How many A, B, C, D, E, F, G, and H such that
possible permutations of the repetition is not allowed, then how many
digits will it have? ways can it be done?
V. Agreement
Have an advance reading on Combination.
(Mathematics Learner’s Module 10; Department of Education, Republic of the
Philippines, pp. )