G10M III L1 Permutation of Objects Revised
G10M III L1 Permutation of Objects Revised
OF OBJECTS
SITUATION:
Teacher Sarah accepts tutorial services in her house every
Saturday. She wanted to check if the seating arrangement of
her three tutees (Ana, Beauty and Carl) has a significant
difference in their learning. So, she decided to change their
seating arrangement every Saturday.
Examples:
• Possible arrangements of books in a shelf
• Possible number of positions in a picture frame
• Possible number of plate number LTO can create
• Possible gender of the children a couple could have
• Possible choices you have in creating your password
ACTIVITY 1.1: PERMUTATION OR NOT
Tell whether each of the problems fall under permutation or
not.
1→ 3→ 5→
2→ 4→ 6→
3 × 2 × 1
1st 2nd 3rd
= 6 possible arrangements
ACTIVITY 1.3: BREAK THE CODE
Suppose you secure your cellphone using a 4-digit code. You
forgot the code and only remembered that the code contains
the digits 2, 3, 4, and 5. List all the possible codes out of the
given digits. Determine the number of permutations made.
1 2, 3, 4, 5 7 3, 2, 4, 5 13 4, 2, 3, 5 19 5, 2, 3, 4
2 2, 3, 5, 4 8 3, 2, 5, 4 14 4, 2, 5, 3 20 5, 2, 4, 3
3 2, 4, 3, 5 24 possible codes
9 3, 4, 2, 5 15 4, 3, 2, 5 21 5, 3, 2, 4
4 2, 4, 5, 3 10 3, 4, 5, 2 16 4, 3, 5, 2 22 5, 3, 4, 2
5 2, 5, 3, 4 11 3, 5, 2, 4 17 4, 5, 2, 3 23 5, 4, 2, 3
6 2, 5, 4, 3 12 3, 5, 4, 2 18 4, 5, 3, 2 24 5, 4, 3, 2
ACTIVITY 1.3: BREAK THE CODE
Suppose you secure your cellphone using a 4-digit code. You
forgot the code and only remembered that the code contains
the digits 2, 3, 4, and 5. List all the possible codes out of the
given digits. Determine the number of permutations made.
4th S D S 16 possible
D S D S D 4 th S D S D S D S D
1 (S, S, S, S) 5 (S, D, S, S) 9 (D, S, S, S)
2 (S, S, S, D) permutations
6 (S, D, S, D) 10 (D, S, S, D)
13 (D, D, S, S)
14 (D, D, S, D)
3 (S, S, D, S) 7 (S, D, D, S) 11 (D, S, D, S) 15 (D, D, D, S)
4 (S, S, D, D) 8 (S, D, D, D) 12 (D, S, D, D) 16 (D, D, D, D)
ACTIVITY 1.4: SON OR DAUGHTER?
A couple is planning to have 4 kids. On any birth the children
could be a son of a daughter. Use a tree diagram to illustrate
the permutations.
Check using the fundamental counting principle
Kids: Son or Daughter Number of kids: 4
S D S D S D S D
2 × 2 × 2 × 2 = 16 possible
2nd 3rd 4th permutations
1st
ACTIVITY 1.5: CLOTHING STYLE BLOUSE SKIRT
Rosa was invited to a birthday 1 stripes red
party. She is planning to match 2 stripes pink
a blouse and a skirt to wear. 3 stripes black
She has 4 new blouses 4 with ruffles red
5 with ruffles pink
(stripes, with ruffles, long-
6 with ruffles black
sleeved, and sleeveless) and 3 7 long-sleeved red
skirts (red, pink, and black) in 8 long-sleeved pink
her closet for such occasions. 9 long-sleeved black
Make a table to show the 10 sleeveless red
pink
possible outfit she can wear. 11 sleeveless
How many ways can she select 12 sleeveless black
2-9 1, 3, 5, 7, 9
8 × 5 = 40 numbers
1st 2nd
TRY THESE!
Determine the answers using FCP.
2. How many numbers lying between 100 and 1000 can be
formed with the digits 0, 1, 2, 3, 4, if the repetition of digits is
NOT allowed?
1, 2, 3, 4 2, 3, 4, 0 3, 4, 0
4 × 4 × 3 = 48 numbers
2nd 3rd
1st
TRY THESE!
Determine the answers using FCP.
3. How many three-digit numbers can be formed using the
digits 5, 7, 8 and 2 if the digits cannot be repeated?
TRY THESE!
Determine the answers using FCP.
4. How many three-digit numbers can be formed using the
digits 5, 7, 8 and 2 if repetition of digits is not allowed, and the
number is less than 700?
EVALUATION 1.1: 5-BOOK SPACE OF A SHELF
In how many ways can you place 6 different books on a shelf
if there is a space enough for only 5 books?
Given: 6 different books
5-book space of a shelf
6 × 5 × 4 × 3 × 2
5th
1st 2nd 3rd 4th
1. 5! = 5 ∙ 4 ∙ 3! 10!
5. = 10 ∙ 9 ∙ 8
7!
2. 3! + 3! = 6!
5!
3. 4! 5! = 9! 6. = 5 ∙ 2!
3! 2!
4. 5 − 3 ! = 5! − 3!
3
3!
2! 3!
EVALUATION 1.2: IS IT TRUE OR FALSE?
Determine whether each equation is True of False
1. 5! = 5 ∙ 4 ∙ 3! → True
5∙4∙3∙2∙1 =5∙4∙3∙2∙1
120 = 120
2. 3! + 3! = 6! → False
3∙2∙1 + 3∙2∙1 =6∙5∙4∙3∙2∙1
12 = 720
3. 4! 5! = 9! → False
4∙3∙2∙1 5∙4∙3∙2∙1 =9∙8∙7∙6∙5∙4∙3∙2∙1
2, 880 = 362, 880
EVALUATION 1.2: IS IT TRUE OR FALSE?
Determine whether each equation is True of False
4. 5 − 3 ! = 5! − 3! → False 5!
5. = 5 ∙ 2! → True
2! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 − (3 ∙ 2 ∙ 1) 3! 2!
2 ∙ 1 = 120 − 6 5 ∙ 4 ∙ 3!
= 10
2 = 114 3! 2!
10! 5∙4
4. = 10 ∙ 9 ∙ 8 → True = 10
7! 2∙1
10 ∙ 9 ∙ 8 ∙ 7! 20
= 10 ∙ 9 ∙ 8 = 10
7! 2
10 ∙ 9 ∙ 8 = 10 ∙ 9 ∙ 8
10 = 10
720 = 720
ACTIVITY 1.7: LET’S FIND OUT!
Answer the following questions.
a. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 5-digit passcode if repetition is allowed?
Given: 5 digits 5-digit passcode
5 × 5 × 5 × 5 × 5 = 𝟑𝟏𝟐𝟓 possible ways
b. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 5-digit passcode if repetition is not allowed?
Given: 5 digits 5-digit passcode
5 × 4 × 3 × 2 × 1 = 𝟏𝟐𝟎 possible ways
ACTIVITY 1.7: LET’S FIND OUT!
Answer the following questions.
c. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 3-digit passcode if repetition is allowed?
Given: 5 digits 3-digit passcode
5 × 5 × 5 = 125 possible ways
d. In how many ways the digits 1,2,3,4, and 5 be arranged to
make a 3-digit passcode if repetition is not allowed?
Given: 5 digits 3-digit passcode
5 × 4 × 3 = 𝟔𝟎 possible ways
It is important in solving permutation to consider these
questions:
a) Is duplication allowed?
b) Is duplication not allowed?
DERIVATION OF PERMUTATION FORMULA
A. When repetition is allowed:
5 𝒓
P(5 𝑡𝑎𝑘𝑒𝑛 5) = 5 ∙ 5 ∙ 5 ∙ 5 ∙ 5 = 5 =𝒏
3 𝒓
P(5 𝑡𝑎𝑘𝑒𝑛 3) = 5 ∙ 5 ∙ 5 = 5 =𝒏
DERIVATION OF PERMUTATION FORMULA
B. When repetition is not allowed:
P(5 𝑡𝑎𝑘𝑒𝑛 5) = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 5! = 𝒏!
P(5 𝑡𝑎𝑘𝑒𝑛 3) = 5 ∙ 4 ∙ 3
(5 − 3) 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
=
2∙1
5! 5! 𝒏!
= = =
2! (5 − 3)! (𝒏 − 𝒓)!
A. PERMUTATION WHEN REPETITION IS ALLOWED
The number of permutations of n objects when repetition is
𝒓
allowed is determined by the formula: 𝒏𝑷𝒓 = 𝒏 where 𝒏 is
the number of objects and 𝒓 is the number of objects selected.
B. PERMUTATION WHEN REPETITION IS NOT ALLOWED
a. Permutation Of All Objects Taken All at a Time
The number of permutations of n objects taken all at a time is
determined by the formula: 𝒏𝑷𝒏 = 𝒏! where 𝒏 is the number of
objects.
b. Permutation of All Objects Taken r at a Time
The number of permutations of n objects taken r at a time is
𝒏!
determined by the formula: 𝒏𝑷𝒓 = where 𝒏 is the number of
(𝒏−𝒓)!
objects and 𝒓 is the number of objects selected.
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
1. In how many different ways are there to arrange the letters
ABCD if repetition is allowed?
2. In how many different ways are there to place four
different colored tiles in a row?
3. In how many ways can 3 runners finished the race if there
are no ties?
4. In how many ways can 7 different books can be arranged
on a shelf if there is space enough for 4 books?
5. In how many ways can a president and vice president be
chosen from a club with 10 members?
ACTIVITY 1.7: TAKE ALL OR NOT
Answer the following questions.
1. In how many different ways are there to arrange the letters
ABCD if repetition is allowed?
Given: 4 letters (All are taken and repetition is allowed)
𝒏𝑷𝒓 = 𝒏𝒓
4𝑃4 = 𝟒 𝟒
4𝑃4 = 4 ∙ 4 ∙ 4 ∙ 4
6𝑃3 = 63
6𝑃3 = 6 ∙ 6 ∙ 6
19 a A i d 20 a A d i 21 a i A d 22 a i d A 23 a d A i 24 a d i A
ACTIVITY 1.8: MY PASSWORDS
A. Aida decided to create passwords containing the letters of
her name A, I, D, A.
3. Let all the letters in the listed passwords be in upper case.
4. Cross out the replicated passwords.
5. Count the number of the remaining 4-letter passwords.
1 AIDA 2AIAD 3ADAI 4ADIA 5AAID 6AADI
7 IADA 8IAAD 9IDAA IDAA IAAD IADA
10 D A I A 11 D A A I 12 D I A A DIAA DAAI DAIA
AAID AADI AIAD AIDA ADAI ADIA
ACTIVITY 1.8: MY PASSWORDS
B. Anna decided to create passwords containing the letters of
her name A, N, N, A.
1. List all possible 4-letter passwords she can create. Write
one A and one N in upper case to make the letters distinct.
2. Count the number of 4-letter passwords created.
1 ANna 2 ANan 3 AnNa 4 AnaN 5AaNn 6 AanN
7 N A n a 8 N A a n 9 N n A a 10 N n a A 11 N a A n 12 N a n A
13 n A N a 14 n A a N 15 n N A a 16 n N a A 17 n a A N 18 n a N A
19 a A N n 20 a A n N 21 a N A n 22 a N n A 23 a n A N 24 a n N A
ACTIVITY 1.8: MY PASSWORDS
Anna decided to create passwords containing the letters of
her name A, N, N, A.
1. Let all the letters in the listed passwords be in upper case.
2. Cross out the replicated passwords.
3. Count the number of the remaining 4-letter passwords.
1 ANNA 2 ANAN ANNA ANAN 3AANN AANN
4 NANA 5 NAAN 6 NNAA NNAA NAAN NANA
NANA NAAN NNAA NNAA NAAN NANA
AANN AANN ANAN ANNA ANAN ANNA
DERIVATION OF DISTINGUISHABLE PERMUTATION FORMULA
P 4 𝑡𝑎𝑘𝑒𝑛 4 24 4 ∙ 3 ∙ 2 ∙ 1 4! 𝒏!
= 12 = = = =
𝑤𝑖𝑡ℎ 2𝐴 2 2∙1 2! 𝒓!
P 4 𝑡𝑎𝑘𝑒𝑛 4 24 4∙3∙2∙1 4! 𝒏!
= 6 = = = =
𝑤𝑖𝑡ℎ 2𝐴, 2𝑁 4 (2 ∙ 1)(2 ∙ 1) 2! 2! 𝒓𝟏 ! 𝒓𝟐 !
The number of distinguishable permutation of n objects is
determined by the formula: 𝑷 = 𝒏!
𝒓𝟏 ! 𝒓𝟐 ! … 𝒓𝒌 !
where 𝒏 is the number of objects and 𝒓𝟏 , 𝒓𝟐 , … 𝒓𝒌 are objects
with corresponding repetition.
ACTIVITY 1.9: DISTINCT OR DUPLICATED
Find the permutation of each of the following words.
1. Find the permutation of the word “SCHOLAR”.
→ The letters are distinct
→ 𝒏𝑷𝒏 = 𝒏! or 𝑷(𝒏, 𝒏) = 𝒏!
→ 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 7
𝒏𝑷𝒏 = 𝒏! = 7!
7𝑃7 = 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
𝟕𝑷𝟕 = 𝟓, 𝟎𝟒𝟎
ACTIVITY 1.9: DISTINCT OR DUPLICATED
Find the permutation of each of the following words.
2. Find the permutation of the word “STATISTICS”
→ The letters are duplicated or replicated
𝒏!
→𝑷=
𝒓𝟏 !𝒓𝟐 !…𝒓𝒌 !
→ 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 10, 𝑆 = 3, 𝑇 = 3, 𝐼 = 2
2
𝒏! 10! 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! 3! 3! 2! 3! 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1
𝑃 = 10 ∙ 9 ∙ 8 ∙ 7 ∙ 5 ∙ 2
𝑷 = 𝟓𝟎, 𝟒𝟎𝟎
EVALUATION 1.4: DISTINGUISH IT
Find the permutation of each of the following words.
1. PAPAYA → 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 6, 𝑃 = 2, 𝐴 = 3
𝒏! 6! 6 ∙ 5 ∙ 24 ∙ 3!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 2! 3! 3! 2 ∙ 1
𝑃 =6∙5∙2
𝑷 = 𝟔𝟎
2. MISSISSIPPI → 𝐺𝑖𝑣𝑒𝑛: 𝑛 = 11, 𝐼 = 4, 𝑆 = 4, 𝑃 = 2
𝒏! 11! 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4!
𝑷= = =
𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! 4! 4! 2! 4! 4 ∙ 3 ∙ 2 ∙ 1 ∙ 2 ∙ 1
𝑃 = 11 ∙ 10 ∙ 9 ∙ 7 ∙ 5
𝑷 = 𝟑𝟒 𝟔𝟓𝟎
ACTIVITY 1.10: CIRCULAR ARRANGEMENT
A. Suppose it happens that (1) Jose, (2)Wally, and (3)Paolo
will visit you in your house, answer the following:
1. Illustrate the different ways if they are to be seated in a 3-
seater sofa. Then, count. 𝑷 = 𝟔 𝒘𝒂𝒚𝒔
1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1
1 2 3 4 5 6
2. Illustrate the different ways if they are to be seated in a 3-
seater round table. Then count. 𝑷 = 𝟐 𝒘𝒂𝒚𝒔
1 1 2
3
1 2 2
2 3 3 1 1 3 2 1 1 2
ACTIVITY 1.10: CIRCULAR ARRANGEMENT
B. Suppose it happens that (1) Jose, (2)Wally, (3)Paolo and
(4)Maine will visit you in your house, answer the following:
1. How many ways can they be seated in a 4-seater sofa?
P(4,4) = 4! = 4 ∙ 3 ∙ 2 ∙ 1 𝑷 = 𝟐𝟒 𝒘𝒂𝒚𝒔
2. Illustrate the different ways if they are to be seated in a 4-
seater round table. Then count. 𝑷 = 𝟔 𝒘𝒂𝒚𝒔
41 2 2 23 4 1 1 3 43 1 142 3 1 1 52
3 4 3 4 2 4 2 3
3 2 3 4 361 3 4 2 1 2 4 2 1 2 3
4 2 4 1 4 1 3 1
4 3 2 4 4 3 1 4 4 2 1 4 3 2 1 3
2 3 1 3 1 2 1 2
DERIVATION OF CIRCULAR PERMUTATION FORMULA
P 3 𝑡𝑎𝑘𝑒𝑛 3 𝑟𝑜𝑤 = 6 = 3! = 𝒏!
P 4 𝑡𝑎𝑘𝑒𝑛 4 (𝑟𝑜𝑤) = 24 = 4! = 𝒏!