MATHEMATICS WEEK 1 THIRD QUARTER

Illustrating the Permutation of Objects

PERMUTATION is a collection or a combination of objects from a set where the order or
the arrangement of the chosen objects does matter. In other words, a permutation is an
arrangement of objects in a definite order.

Permutation can be classified into the following different types:

1. LINEAR PERMUTATION – a kind of permutation where objects were arranged in a row or
line. Here we used the formula n!. n! is read as n factorial and it can also be written
using the permutation formula P(n,n).
FACTORIAL means to multiply a series of descending natural numbers.
n! = n× (n − 1) × (n − 2) × ... × 2 × 1.
Note: 0! = 1

EXAMPLES:
a. In how many ways can you arrange numbers 123? List all the possible outcomes.
SOLUTION: Since there are 3 digits and arranged in a row:
P(n,n) = P(3,3) = n! = 3! = 3 x 2 x 1 = 6
Outcomes: The digits can be arranged as follows:
123 132 213 231 312 321
Therefore, we can arrange the number 123 in 6 ways.
b. Suppose you want to arrange your 5 students seated in a row, how many ways are
possible?
SOLUTION: There are 5 possible choices for which the students will be seated in a
row (either a, b, c, d, or e).
n! = P(5,5) = 5! = 5 x 4 x 3 x 2 x 1 = 120
Therefore, there are 120 ways to arrange 5 students seated in a row.

2. DISTINGUISHABLE PERMUTATION - Permutation where repetition is not allowed.

P(n,r) represents permutations for n different objects taken r at a time. This applies
when we have n different objects to arrange, and repetition is not allowed.
Permutation Formula:
n!
𝑃(𝑛,𝑟) = ;n≥r where P(n,r) = number of permutations
( n−r ) !
n = total number of objects in the set
r = number of choosing objects from the set
EXAMPLES:
a. How many 4 letters words can be formed out of the letters of the word “Cables” when
repetition is not allowed?
SOLUTION:
The word “Cables” has six letters so n = 6 and we have to form all possible
four-letter words without repetition hence r = 4. Therefore, possible
permutations can be calculated as:

n! 6! 6 x5 x 4 x3 x2 x1 720
𝑃(𝑛,𝑟) = = = = = 360
( n−r ) ! ( 6−4 ) ! 2x1 2

b. How many ways can 4 books be arranged on a shelf if they can be selected from 9
books?
SOLUTION:
n = 9 since there are 9 books given
r = 4 selected from the given
 n! 9! 9 x8 x7 x 6 x5 x 4 x3 x2 x1 362,880
𝑃(𝑛,𝑟) = = = = = 3 024
( n−r ) ! ( 9−4 ) ! 5 x 4 x3 x 2x 1 120
3. Permutation where repetition is allowed.
A permutation is easiest to calculate when repetition is allowed. To calculate such
permutation, we use the formula nr .
EXAMPLE:
a. How many 4 letter words can be formed out of the letters of the word “Cables” when
repetition is allowed?
SOLUTION: So, in the said example, the number of letters is six so n = 6 while r = 4
n = 6 = 6 x 6 x 6 x 6 = 1 296
r 4

4. Circular permutations

*If the clockwise and counterclockwise orders CAN be distinguished then total number
of circular permutations of n elements taken all together.
Formula: P = (n – 1)!

EXAMPLE:
In how many ways can 5 people seated in a round table?
Given: n = 5
Solution: P = (n – 1)!
P = (5 – 1)! = 4! = 4 x 3 x 2 x 1 = 24
Therefore, there are 24 ways can 5 people be seated in a round table.

*If the clockwise and counterclockwise orders CANNOT be distinguished then total
( n−1 ) !
number of circular permutations of n elements taken all together: Formula: 𝑷 =
2
EXAMPLE:
Find the number of ways in which 10 beads can be arranged to form necklace.
Given: n = 10 beads
( n−1 ) ! ( 10−1 ) ! 9 x8 x7 x 6 x5 x 4 x3 x2 x1 362880
Solution: 𝑷 = = = 2
= 2
= 181 440
2 2
Therefore, there are 181,440 ways to arrange the 10 beads to form a necklace.
5. Permutation of Non-distinct Objects and With Repetition
There is a subset of permutations that considers that there are double objects
or repetitions in a permutation problem. In this case we use the formula:
n!
P=
k 1 ! k 1 ! , ,,

EXAMPLE:
Find how many ways you can rearrange letters of the word “BANANA” all at a time.
Solution:
Given word: BANANA
Total number of letters in “BANANA” = 6
Total number of “A”s in the word “BANANA” = 3
Total number of “N”s in the word “BANANA” = 2
 n! 6! 6 x5 x 4 x3 x2 x1 720
So, the P = = = = = 60
k 1 ! k 1 ! , ,, 3! 2! 3 x 2x 1x 2x 1 12

WRITTEN TASKS:

ACTIVITY 1
List all the possible permutation of the given below.
GIVEN ANSWER
1. S, E, T SET STE EST ETS TES TSE

2. T, E, N

3. T, E, R, M

4. 1, 2, 3, 4, 5

5. ☺, ☼, ♥, ▲

ACTIVITY 2
Evaluate each expression. Show your complete solution.
GIVEN WORKING OUTS ANSWER
Example: n!
𝑃(𝑛,𝑟) = ( n−r ) !
P (9,6) 60 480
9! 9 x8 x7 x 6 x5 x 4 x3 x2 x1
= ( 9−6 ) ! = 3 x2 x1
362880
= 6
1. P (6,2)

2. P (3,3)

3. P (8,2)

4. P (5,3)

5. P (9,4)
ACTIVITY 3
A. Read and solve. Show complete solution. Use another sheet of paper for your answers.
1-2. Find the number of permutations of the following words below:
a. MATHEMATICS
b. PERMUTATION
3. In how many ways could Snow White’s seven dwarfs be seated around a round table?
4. How many necklaces can be made from 12 beads of different colors?
B. Read and solve. Show complete solution. Then choose the letter of the correct answer.
5. In how many ways can Maddy, Sterling, Sunny, Tom, Adi, Jason, Kate, Lily, and Molly
stand in line?
a. 342,107 c. 362,880
b. 358,521 d. 390,942
6. How many ways can a president and vice-president be selected in a class of five
students?
a. 20 c. 120
b. 24 d. 190
7. Participant 4, 5, 6, and 7 start a race. In how many different orders can they finish the
race?
a. 24 c. 49
b. 30 d. 81
8. How many seven-digit numbers can you form by arranging the numbers 5, 6, 7, 8, 9,
3, 6, 4, 2?
a. 90,410 c. 362,880
b. 90,720 d. 386,434
9. In how many ways can the letters of the word "PROBLEM" be rearranged to make seven
letter words such that none of the letters repeat?
a. 1103 c. 4301
b. 2402 d. 5040
10. If five digits 1, 2, 3, 4, 5 are being given and a three-digit code must be made from it
if the repetition of digits is allowed then how many such codes can be formed?
a. 124 c. 126
b. 125 d. 127

PERFORMANCE TASK:
PERFORMANCE TASK NO. 1
TITLE: A STORY OF PERMUTATION

Create 5 of your own illustration of real-life situation involving permutation. Include a

sample problem, and the solution. Do this in a clean sheet of bond paper. Consider the
following criteria.
CORRECTNESS OF THE ANSWER 12
CREATIVITY 5
NEATNESS 3_
20

Prepared by:

MARIANE V. MILLANES
Grade 10 Math Teacher