MODULE CODE: PASAY-M10-Q3-W2-D1

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

DEPARTMENT OF EDUCATION-NATIONAL CAPITAL REGION

SCHOOLS DIVISION OF PASAY CITY

MODULE IN MATHEMATICS 10
THIRD QUARTER/ WEEK 2/ DAY 1
OBJECTIVE: Solves problems involving permutations using different methods of counting.

YOUR LESSON FOR TODAY:

• Solving Problems Involving Permutations Using Different Methods of Counting

TRY TO DISCOVER!

We can solve problems involving permutations using different methods of counting.

Consider the problem below:

Mr. Lao will use the 3 letters of his surname L, A and O in different order to assign
passwords to his computer units. Each letter should appear once in a password. How
many different passwords can Mr. Lao create?

In the problem, the arrangement of the letters of Mr. LAO surname depicts that the order of
arranging the letters is important, hence the problem is an example of permutation.

To find the total number of passwords that Mr. LAO can create, we can use various methods. We
can determine the different possibilities asked for by using the tree diagram, listing or by using the
formula for permutation.

Consider the following solution:

Using a tree diagram Listing

A O LAO
L
O A LOA

L O ALO
A
O L AOL

L A OLA
O
A L OAL

From the list or a tree diagram, we get 6 passwords out of the 3 letters L, A, and O namely
LAO, LOA, ALO, AOL, OLA and OAL. Getting the passwords using a list or a tree diagram is very
tedious especially if it happens that the surname of the person contains many letters. Because of
this, we consider other ways to find the number of permutations.

Since the passwords to be created will be drawn all from the letters of the surname of Mr.
LAO, then we can also solve the said problem by using the formula in finding the number of
permutation of n things taken n at a time (all at a time) which is P(n, n) = n!
where n! = n(n-1)(n-2)…(3)(2)(1),thus we have P(3,3) = 3! = 3 ∙ 2 ∙ 1 = 6 passwords.

Page 1 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D1

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

ARE YOU READY TO PRACTICE?

Directions: Answer the following problems.

1.Suppose Martin is to watch a basketball game at the Araneta Coliseum. The coliseum has
four different gates where he can enter. If he cannot pass through the same door twice, in
how many ways can he enter and leave the coliseum?

2. How many different ways are there to arrange the letters in the word ENGLISH?

3. If a license plate consists of two letters followed by three numbers, how many license
plates are possible if the letters and numbers may be repeated?

4. In how many ways can 10 people be seated on a bench if only 4 seats are available?

Let us check your answer.

1.Suppose Martin is to watch a basketball game at the Araneta Coliseum. The coliseum has
four different gates where he can enter. If he cannot pass through the same door twice, in
how many ways can he enter and leave the coliseum?

Solution:

One way to solve this problem is to list all the possible routes that Martin can take but
an easier approach to solve the problem is through the Fundamental Principle of
Counting which states that “If a certain task A can be done in m distinct ways and for
each of the m ways another task can be done in n distinct ways, then together there are
m x n ways to accomplish the two tasks”.

Martin can enter in any of the four gates and leave 4-1=3 ways. So, Martin can make his
way in and out of the coliseum in (4)(3)= 12 ways.

2. How many different ways are there to arrange the letters in the word ENGLISH?
Solution:

ENGLISH has seven distinct letters so there are also seven tasks to be performed:
Selecting the first letter, selecting the second letter and so on. Any of the seven letters
can fill up the first position, then any of the remaining six letters can fill up the second
position, and so on. Thus, the total number of distinct arrangements in the word
ENGLISH is (7)(6)(5)(4)(3)(2)(1) = 5040. Another way to solve the problem is by using the
formula in finding the number of permutation of n things taken n at a time (all at a time)
which is P(n, n) = n! . Thus, we have P(7,7) = 7! = 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 5040.

3. If a license plate consists of two letters followed by three numbers, how many license plates
are possible if the letters and numbers may be repeated?
Solution:

The tasks to be accomplished include: choosing the first letter, the second letter, the
first number and so on. Since repeated letters and digits are allowed, any letter from A – Z
(26 all) can be selected for each of the first two positions. Furthermore, any of the 10
Page 2 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D1

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

digits: 0,1,2, …,9, can be chosen for each of the last three positions. Therefore, there are
(26)(26)(10)(10)(10) = 676 000 possible license plates.

4. In how many ways can 10 people be seated on a bench if only 4 seats are available?

Solution:

The first seat can be filled in 10 ways and when this has been done there are 9 ways of
filling the second,8 ways of filling the third and 7 ways of filling the fourth. Thus, there
are (10)(9)(8)(7) = 5040 ways.

Another way to solve the problem is by using the formula for the permutation of n
𝒏!
things taken r at a time which is given by 𝑷(𝒏, 𝒓) = .Here, we are required to find
(𝒏−𝒓)!
the number of permutations of 10 things taken 4 at a time. We denote this by,
10! 10! 10∙9∙8∙7∙6!
𝑃(𝑛, 𝑟) = 𝑃(10,4) = (10−4)! = = = 𝟓𝟎𝟒𝟎.
6! 6!

PRACTICE EXERCISE 1:
Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.
_______1. In a restaurant, a person can choose 6 viands, plain, garlic or java rice, 3 kinds of
beverages and 4 kinds of desserts. In how many ways can this person choose what
to have if he is to order one from each group?
_______2. A Mathematics Club consists of 25 male and 30 female students. Find the number
of ways that the club can elect a president, a vice president, a secretary and a
treasurer.

3. The digits 1, 2, 3, 4, 5, and 6 are to used to form a six – digit number. How many different
numbers can be formed if

_______a. repetitions are permitted?

_______b. repetition is not allowed?
_______c. the number must be even and repetitions are not allowed?

PRACTICE EXERCISE 2:
Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.

_______1. A company which manufactures shampoo plans to introduce a new product. The
product has three variants: for normal hair, for dry hair and for damaged hair. They can
package their new products in either red, pink, green or blue bottle containers. If they
also have four new brand names to choose from, in how many ways can they introduce
the new product?

Page 3 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D1

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

2. How many 3 – digit numbers can be constructed from the digits 1, 3, 4, 5, 6, 7,and 9 if
_______a. repetition is allowed?
_______b. the number must be odd and repetition is not allowed?
_______c. the number must be greater than 400 and repetition is not allowed?

_______3. If there are 4 roads from Town A to Town B and 5 roads from Town B to Town C, in
how many ways can one go from Town A to Town C and back to Town A, through B,
without passing through the same road twice.

REMEMBER

Problems involving permutations can be solved by different ways like by listing or a

tree diagram, using the fundamental counting principle or by using the concepts or
formulas for permutation and the like.

• Fundamental Principle of Counting

In a sequence of events in which the first one has m1 possibilities, the second
has m2 possibilities, the third has m3 and so on, and the total number of possible
outcomes will be m1● m2 ●m3 ●●●mn where n is the number of events

• The number of permutation of n things taken n at a time (all at a time) is P(n, n)

= n! where n! = n(n-1)(n-2)…(3)(2)(1)

• The number of permutation of n things taken r at a time is

P(n, r) = n(n-1)(n-2)…(n -r +1)

or
𝒏!
𝑷(𝒏, 𝒓) = (𝒏−𝒓)! , 𝒏 ≥ 𝒓

Page 4 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D1

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

EVALUATION:
Directions: Answer the following items correctly. Write only the letter that corresponds to the
correct answer on the blank before each number.

_____1. Given the letters A, B, C, D, E, F and G, how many 3 letter initials of an imaginary
company can be made?
A. 120 C. 210
B. 150 D. 250

_____2. If there are 3 candidates for mayor and 5 candidates for vice mayor in Pasay City, in
how many ways can the two offices be filled in?
A. 12 C. 14
B. 13 D. 15

_____3. How many distinct 11- letter words can be formed from the letters of the word
SWITZERLAND?
A. 39 916 800 C. 52 614 206
B. 40 023 324 D. 60 926 324

_____4. A security code consists of two letters and two digits. How many distinct security
codes are possible if repetition is not allowed?
A. 42 100 C. 60 840
B. 58 500 D. 64 342

_____5. The ABC band has 15 songs to perform in a concert. At the upcoming Battle of the
Bands, they will play 2 songs. In how many different orders can they perform two of
their songs?
A. 30 C. 150
B. 90 D. 210

Prepared by:
Ranel C. Dain
Pasay City East High School

References for further enhancement:

Grade 10 Learner’s Module, pp.283 – 288
E- Math 10 by Oronce et al pp. 335 – 339
Statistics and Probability by Alferez et al pp.69 -71

Page 5 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D2

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

DEPARTMENT OF EDUCATION-NATIONAL CAPITAL REGION

SCHOOLS DIVISION OF PASAY CITY

MODULE IN MATHEMATICS 10
THIRD QUARTER/ WEEK 2/ DAY 2

OBJECTIVE: Solves problems involving identical and circular permutations.

YOUR LESSON FOR TODAY:

• Solving Problems Involving Identical and Circular Permutations

TRY TO DISCOVER!

Permutations with Repetitions

There are times when the elements or objects that are being arranged are not distinct,
that is, some are identical. For instance, the word “INFINITY”, the letter “I” appears thrice, “N”
appears twice and “F” together with “T” and “Y” appear once.

Suppose, we are given with this problem below:

How many distinguishable permutations can be made using the letters of the word
INFINITY?

We know that there are 8 letters of the word INFINITY. Assuming that the letters are
distinct, there are P (8,8) = 8! permutations. Recall that the permutation of n objects taken all at a
time is P (n, n) = n!, and n! (n factorial) is the product of all integers less than or equal to n.

However, we have to take into consideration that the 3 ‘I’s are alike and 2 “N’s are also
alike. So, we must divide 8! by 3!2! in order to eliminate the duplicates. Thus,

8! 8∙7∙6∙5∙4∙3∙2∙1
𝑃= = = 3360
3!2! 3∙2∙1∙2∙1

Therefore, there are 3,360 distinguishable permutations that can be made using the
letters of the word INFINITY?

The general form of this result is given below.

The number of distinguishable permutations, P, of n objects where a objects are alike, b

objects are alike, c objects are alike and so forth is:

𝒏!
𝑷=
𝒂!𝒃!𝒄!…

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

Circular Permutations

There is a special case of permutation where the arrangement of things is in a circular pattern.
It is called circular permutation. The most common example of this type is the seating arrangement
of people around a circular table. In general, there is no first place in the arrangement of things in a

Page 6 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D2

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

circular pattern. So, when each person moves his/her position by one place clockwise or
counterclockwise, the relative positions are not changed.
If we use the formula for linear permutations in finding the number of possible arrangements,
we will have to count each different arrangement n times. So we have,

𝑛! 𝑛(𝑛−1)(𝑛−2)∙…∙(2)(1)
=
𝑛 𝑛

= (𝑛 − 1)(𝑛 − 2) ∙ … ∙ (2)(1)
= (𝑛 − 1)!

Therefore, there are (𝒏 − 𝟏)! different arrangements when things are arranged in a circular
pattern.

Illustrative Example:

In how many ways can 4 plants be arranged in a circular table?

Solution:

This is circular permutations of 4 objects. So we have,

P= (n – 1)!
= (4 – 1)!
= 3!
= 3∙2∙1
= 6

Therefore, there are 6 ways that the 4 plants be arranged in a circular table.

(𝒏−𝟏)!
The number of permutations of n different things around a key ring and the like is .
𝟐

Illustrative Example:

In how many ways can 6 keys be arranged in a key ring?

Solution:

The number of permutations of 6 keys in a key ring is

(𝑛−1)!
𝑃=
2
= (6−1
2
)!
= 5!2 = 5∙4∙3∙2∙1
2
= 60

Therefore, there are 60 ways that the 6 keys be arranged in a key ring.

ARE YOU READY TO PRACTICE?

Directions: Answer the following problems.

1. In how many ways can you arrange the letters of the word PROBABILITY?
2. In how many ways can 2 yellow, 3 red, 4 blue and 5 green flags be lined up in a row if
there are no restrictions?
3. In how many ways can 4 couples be seated in a circular table if there are no restrictions?
Page 7 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D2

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

4. By stringing 7 differently colored beads, how many bracelets with different arrangement of
beads can be made?

Let us check your answer.

1.In how many ways can you arrange the letters of the word PROBABILITY?

Solution:

There are 11 letters of the word PROBABILITY, 2 of which are B’s, 2 are I’s and the rest of
the letters appear once. So we have,

11! 11∙10∙9∙8∙7∙6∙5∙4∙3∙2∙1
𝑃= = = 9 979 200
2!2! 2∙1∙2∙1

Thus, there are 9 979 200 ways to arrange the letters of the word PROBABILITY.

2. In how many ways can 2 yellow, 3 red, 4 blue and 5 green flags be lined up in a row if
there are no restrictions?

Solution:

There are 14 flags in all and these can be arranged in

𝑃=
14!
= 14∙13∙12∙11∙10∙9∙8∙7∙6∙5! = 2 522 520
2!3!4!5! 2∙1∙3∙2∙1∙4∙3∙2∙1∙5!

Thus, there 2 522 520 ways to arrange the letters of the word PROBABILITY.

3. In how many ways can 4 couples be seated in a circular table if there are no restrictions?

Solution:

There are 8 persons (4 couples) to be arranged in a circular table.

Therefore, there are (8 – 1)! = 7! = 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 5 040 ways of obtaining such

arrangement.

4. By stringing 7 differently colored beads, how many bracelets with different arrangement of
beads can be made?

Solution:

(𝑛−1)! (7−1)! 6! 6∙5∙4∙3∙2∙1

There are = = = = 360 bracelets with different arrangement of
2 2 2 2
beads can be made.

Page 8 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D2

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

PRACTICE EXERCISE 1:
Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.

1. How many different ways can the letters of each word below be arranged?
_______ a. ALGEBRA

_______ b. GEOMETRY
_______ c. TRIGONOMETRY

_______2. In how many ways can 5 different trees be planted in a circle?

_______3. In how many ways can 10 different keys can be arranged in a key chain?

PRACTICE EXERCISE 2:
Directions: Answer the following problems. Write the answer on the space provided before each
number.
_______1. How many distinguishable permutations are there in the word SASSAFRAS?
_______2. How many distinguishable permutations can be made using the letters of the word
RHODODENDRONS?
_______3. How many ways can 11 people sit in a round table with 11 seats?
_______4. In how many ways can 4 couples be seated in a circular table if each couple insists on
sitting each other?
_______5. In how many ways can 5 couples be seated in a circular table if the wives must sit
together?

REMEMBER

• The number of distinguishable permutations, P, of n objects where a

objects are alike, b objects are alike, c objects are alike and so forth is :
𝒏!
𝒂!𝒃!𝒄!…
• The number of circular permutations of n different objects is (𝒏 − 𝟏)!
• The number of permutations of n different things around a key ring and
(𝒏−𝟏)!
the like is .
𝟐

Page 9 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D2

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

EVALUATION:
Directions: Answer the following items correctly. Write only the letter that corresponds to the
correct answer on the blank before each number.

_____1. Which of the following expressions represents the number of distinguishable

permutations of the letters of the word GOOGLE?
6!
A. 6! C.
2!2!
6! 6!
B. D.
2! 3!2!

_____2. What is the number of distinguishable permutations of the digits of the number
569 956?
A.60 C. 80
B.70 D. 90

_____3. In how many ways can 7 visitors be seated in a round table?

A. 80 C. 720
B. 120 D. 5040

_____4. In how many ways can 5 different keys can be arranged in a key chain?
A. 8 C. 12
B. 10 D. 24

_____5. In how many ways can 6 persons be seated around a circular table if two of them
insist on sitting beside each other?
A. 24 C. 48
B. 36 D. 52

Prepared by:
Ranel C. Dain
Pasay City East High School

References for further enhancement:

Grade 10 Learner’s Module, pp.292 - 294
E- Math 10 by Oronce et al pp. 340 – 343

Page 10 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D3

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

DEPARTMENT OF EDUCATION-NATIONAL CAPITAL REGION

SCHOOLS DIVISION OF PASAY CITY

MODULE IN MATHEMATICS 10
THIRD QUARTER/ WEEK 2/ DAY 3

OBJECTIVE: Solves routine problems involving permutations.

YOUR LESSON FOR TODAY:

• Solving Routine Problems Involving Permutations

TRY TO DISCOVER!

In solving routine problems involving permutations the following concepts or formulas are useful:

• The number of permutation of n things taken n at a time (all at a time) is P(n, n) = n!

where n! = n(n-1)(n-2)…(3)(2)(1)

• The number of permutation of n things taken r at a time is P(n, r) = n(n-1)(n-2)…(n -r +1)

𝒏!
or 𝑷(𝒏, 𝒓) = (𝒏−𝒓)!
,𝒏 ≥𝒓

Consider the following illustrative examples:

In a scrabble game, Mark has the following letters: O, M, L, E, Y and D.

a. How many different 6 – letter words meaningful or meaningless can he make?

b. How many different 4 – letter words can he make?

In problem a, all the letters are to be used, so the permutation of 6 taken 6 at a time must be
computed that is,

𝑃 = 𝑛! = 6! = 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 720

Thus, Mark can make 720 different 6 – letter words meaningful or meaningless from
the letters O, M, L, E, Y and D.

In problem b, only four letters out of the 6 can be used, so the permutation of 6 taken 4 must be
obtained where n=6 and r = 4. So, we have,

𝑛! 6! 6! 6∙5∙4∙3∙2∙1
𝑃(𝑛, 𝑟) = (𝑛−𝑟)! = (6−4)! = 2! = = 360
2.1

Thus, Mark can make 360 different 4 – letter words from the letters O, M, L, E, Y and D.

Problem b can also be computed using the formula P (n, r) = n (n-1) (n-2)…(n -r +1). Since the first
word can be made in any of the 6 letters, and when this can be done there are 5 ways of selecting
the second word, 4 ways of selecting the third word and 3 ways of selecting the fourth word, thus
we have

P(n, r) = P(6, 4) = (6)(5)(4)(3)= 360

Page 11 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D3

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

ARE YOU READY TO PRACTICE?

Directions: Answer the following problems.

1. In how many ways can 3 boys and 2 girls can be seated in a row if they may sit anywhere?
2. How many four- letter permutations can be formed from the letters in the word “heptagon”?
3. The racing club organizes a race in which 10 cars A, B, C, D, E, F, G, H, I, and J are joined.

a. How many possible race results if there are no ties?

b. In how many ways can the first 3 positions be filled if there are no ties?

Let us check your answer.

1.In how many ways can 3 boys and 2 girls can be seated in a row if they may sit anywhere?

Solution:
If the boys and girls can sit anywhere, then the problem is equivalent to that of rearranging 5
people among themselves thus there are 𝑃 = 5! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟏𝟐𝟎 arrangements possible.

2.How many four- letter permutations can be formed from the letters in the word “heptagon”?

Solution:
There are 8 letters in the word “heptagon” thus n = 8 and 4 letters are needed hence r = 4.
𝑛! 8! 8! 8∙7∙6∙5∙4!
So, we have 𝑃(𝑛, 𝑟) = (𝑛−𝑟)!
= (8−4)! = 4! = = 1680.
4!

Therefore, there are 1680 four- letter permutations that can be formed from the letters in the
word “heptagon”.

3. The racing club organizes a race in which 10 cars A, B, C, D, E, F, G, H, I, and J are joined.

a. How many possible race results if there are no ties?

b. In how many ways can the first 3 positions be filled if there are no ties?

Solution:

a. The number of possible race results if there are no ties is the same as the number of
permutations of 10 things taken 10 at a time. Therefore, there are
P = 10! = 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 3 628 800 possible race results if there are no
ties.

b. Here, we are required to find the number of permutations of 10 things taken 3 at a time.
10! 10! 10∙9∙8∙7!
We denote this by, 𝑃(𝑛, 𝑟) = 𝑃(10,3) = = = = 720.
(10−3)! 7! 7!

Thus, there are 720 ways that the first 3 positions be filled if there are no ties.

Page 12 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D3

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

PRACTICE EXERCISE 1:

Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.

1. Find the number of different arrangements of the set of 5 letters S, M, A,R,T

_______a. taken two at a time.
_______ b. taken three at a time.
_______ c. taken 5 at a time.

_______2. In how many ways can we arranged 4 different books in a shelf?

_______3. How many arrangements are there if 4 playing cards are drawn from a deck of 52
cards?

_______ 4. In how many ways may the first and second prizes be drawn from 20 lottery tickets?

PRACTICE EXERCISE 2:

Directions: Answer the following problems. Write the answer on the space provided before each
number.

_______1. Given the letters a, b and c, how many distinct arrangements are there if the letters
are to be arranged two at a time?

_______2. In how many ways can you place 8 different books on a shelf if there is space
enough for only 5 books?

Page 13 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D3

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

_______3. A dress-shop owner has 7 new dresses that she wants to display in the window.
If the display window has 4 mannequins, in how many ways can she dress them up?

_______4. In how many different ways can 3 motorcycles be parked if there are 12 available
parking slots.

_______5. Suppose that in a certain organization, there are 11 elected members of the
Board of Directors. In how many ways can a president, a vice president, a secretary
and a treasurer be selected from the board?

REMEMBER

In solving routine problems involving permutations the following

concepts or formulas are useful:

• The number of permutation of n things taken n at a time (all at a

time) is P (n, n) = n! where n! = n (n-1) (n-2)…(3)(2)(1)

• The number of permutation of n things taken r at a time is

P (n, r) = n (n-1) (n-2)…(n -r +1)

or

𝒏!
𝑷(𝒏, 𝒓) = (𝒏−𝒓)! , 𝒏 ≥ 𝒓

Page 14 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D3

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

EVALUATION:

Directions: Answer the following items correctly. Write only the letter that corresponds to the
correct answer on the blank before each number.

_____1. In how many ways can 8 students arrange themselves in a row for picture taking?

A. 720 C. 40 320
B. 5 040 D. 52 000

_____2.In how many ways can 3 people be seated in a room where there are 7 seats?
A. 80 C. 185
B. 132 D. 210

_____3. A group of 14 students must select a president and a vice president in Mathematics
Club. In how many ways can this be done?
A. 150 C. 196
B. 182 D. 202

_____4. There are 9 finalists for the MTAP contest and medals will be given to the top three
finalists. How many ways are there for the medal winners to be selected?

A. 504 C. 704
B. 602 D. 832

_____5. How many 4 digit numbers can be formed using the digits 1,2,4, 6, 8 and 9
without repetition?
A. 165 C. 296
B. 206 D. 360

Prepared by:
Ranel C. Dain
Pasay City East High School

References for further enhancement:

Grade 10 Learner’s Module, pp.284 – 291,296
E- Math 10 by Oronce et al pp. 337 – 340

Page 15 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D4

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

DEPARTMENT OF EDUCATION-NATIONAL CAPITAL REGION

SCHOOLS DIVISION OF PASAY CITY

MODULE IN MATHEMATICS 10
THIRD QUARTER/ WEEK 2/ DAY 4

OBJECTIVE: Solves non -routine problems involving permutations.

YOUR LESSON FOR TODAY:

• Solving Non -Routine Problems Involving Permutations

TRY TO DISCOVER!

In solving non routine problems involving permutations, the concepts and formulas presented in
the previous discussions are useful. Moreover, your understanding and comprehension skills to
solve the problems are needed.

Consider the given problem below:

In how many ways can Angel, Louie, Ren, April and Max line up in a row to have their
group picture taken if:

a. they can occupy any place they wish?

b. April, Angel and Carlo wish to pose side by side?

In problem a, since all the five persons can occupy any place in the row, anybody can take the first
position, then any of the remaining four can take the second position and so on. Hence, there are
5! = 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 120 possible ways that the group can pose for the picture taking.

In problem b, April, Angel and Carlo insist posing side by side so they can be treated as one group.
So, there are 3 groups to be arranged, that is:

April, Angel, Carlo Louie Ren

The three groups can be permuted in 3! ways and April, Angel and Carlo can still be arranged in 3!
ways. Therefore, applying the fundamental counting principle, there are 3!3! = (6)(6) = 36 ways of
arranging the persons according to the given restriction.

ARE YOU READY TO PRACTICE?

Directions: Answer the following problems.

1. If P (n, 2) = 20, then what is the value of n?

2. A high school class consists of 9 male and 7 female students. Find the number of ways
that the class can elect:

a. two spokespersons, a male and a female.

b. a president, a vice president and a secretary.

3. In how many ways can 3 boys and 4 girls be seated in a row if:
a. there are no restrictions?
b. all the boys and all the girls insist on sitting together?
c. the boys and the girls must alternate.
Page 16 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D4

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

Let us check your answer.

1. If P (n, 2) = 20, then what is the value of n?

Solution:

𝑛!
𝑃(𝑛, 2) = (𝑛−2)! , hence we have
𝑛!
= 20
(𝑛 − 2)!
𝑛! = 20(𝑛 − 2)! (multiplying both sides by (𝑛 − 2)!
Since 𝑛! = (𝑛)(𝑛 − 1)(𝑛 − 2) … (3)(2)(1) = (𝑛)(𝑛 − 1)(𝑛 − 2)! ,thus
(𝑛)(𝑛 − 1)(𝑛 − 2)! = 20(𝑛 − 2)!

(𝑛)(𝑛−1)(𝑛−2)! 20(𝑛−2)!
(𝑛−2)!
= (𝑛−2)!
, simplifying we have

(𝑛)(𝑛 − 1) = 20 (dividing both sides by (n-2)!

𝑛2 − 𝑛 − 20 = 0 (transform into quadratic equation)
(𝑛 − 5)(𝑛 + 4) = 0 (factor)
𝑛 − 5 = 0, 𝑛 + 4 = 0 (apply Zero Product Property)
𝑛 = 5, 𝑛 = −4

Disregarding the negative value of n, thus n = 5.

Check:
P(n,2) = 20 , n = 5

5! 5! 5 ∙ 4 ∙ 3!
𝑃(5,2) = = = = 20
(5 − 2)! 3! 3!

2. A high school class consists of 9 male and 7 female students. Find the number of ways
that the class can elect:

a. two spokespersons, a male and a female.

b. a president, a vice president and a secretary.

Solution:

a. One of the 9 males and one of the 7 females are to be chosen. Therefore, there are
(9)(7) = 63 ways of electing two spokespersons wherein one is a male and one is a female.

b. There are 16 ways of electing a president, then 16-1=15 ways of electing a vice president
and 15-1=14 ways of electing a secretary. Thus, there are (16)(15)(14) = 3 360
distinct ways of electing a president, a vice president and a secretary.
𝒏!
We can also solve this problem using the formula, 𝑷(𝒏, 𝒓) = (𝒏−𝒓)! where our n = 9 + 7=16
and r = 3 which is the total number of positions to be elected. Thus, we have,

16! 16! 16∙15∙14∙13!

P(16,3) = = 13! = = 3360.
(16−3)! 13!

3. In how many ways can 3 boys and 4 girls be seated in a row if:
a. there are no restrictions?
b. all the boys and all the girls insist on sitting together?
c. the boys and the girls must alternate.

Page 17 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D4

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

Solution:

a. If there are no restrictions, then the boys and girls can sit anywhere, then the
problem is equivalent to that of rearranging 7 persons among themselves thus
there are 𝑃 = 7! = 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟓 𝟎𝟒𝟎 arrangements possible.

b. If all the boys and all the girls insist on sitting together, then the number of
permutation is P = (3! ∙ 4!) ∙ 2!. The boys can be arranged in 3! ways and the
girls can be arranged in 4! ways, we multiply 2! because there are two sex
involved (boys and girls), boys may be followed by girls or girls may be followed
by boys. Thus, there are P = (3! ∙ 4!) ∙2! = 288 ways that the 3 boys and 4 girls
be seated in a row if they insist on sitting together.

c. If all the boys and girls must alternate, then the number of permutation is
P = 4 ∙ 3∙3 ∙2 ∙2 ∙1 ∙1 or (4! ∙ 3!) . The numbers in italics refer to the girls
while the non-italicized refer to the boys. Thus, there are
P = 4 ∙ 3 ∙3 ∙2 ∙2 ∙1 ∙1 or (4! ∙ 3!) = 144 ways that the 3 boys and 4 girls be
seated in a row if they insist on sitting alternately.

PRACTICE EXERCISE 1:

Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.

1. There are 2 different Mathematics books and 6 different science books. In how many ways
can the books be arranged on a shelf if
_______a. there are no restrictions?
_______ b. books of the same subject must be placed together?
_______ c. if they must be placed alternately.

________2. A teacher draw a number line on the board and named some points on it. The teacher
then asked the class to list all the rays in the figure. A student answered 56 rays in all and the
teacher said it was correct. How many points were named in the figure?

Page 18 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D4

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

PRACTICE EXERCISE 2:

Directions: Answer the following problems. Write the answer on the space provided before
each number or letter.

1. Six couples want to have their pictures taken. In how many ways can they arrange
themselves in a row if
a. couples must stay together?

b. they may stand anywhere?

2. There are 8 people in a dinner gathering. In how many ways can the host (one of the 8)
arrange his guests around a dining table if
a. they can sit any of the chairs?

b. 4 people insist on sitting beside each other?

c. 3 people refuse to sit beside each other?

REMEMBER

In solving non routine problems involving permutations, the following

concepts and formulas are still useful. Moreover, your understanding
and comprehension skills to solve the problems are needed.

• The number of permutation of n things taken n at a time (all at a

time) is P(n, n) = n! where n! = n(n-1)(n-2)…(3)(2)(1)

• The number of permutation of n things taken r at a time is

P(n, r) = n(n-1)(n-2)…(n -r +1)

𝒏!
or 𝑷(𝒏, 𝒓) = (𝒏−𝒓)! , 𝒏 ≥ 𝒓

Page 19 of 20
 MODULE CODE: PASAY-M10-Q3-W2-D4

Name: ________________________________________________ Date: ______________________

Name of teacher: _______________________________________ Section : ___________________

EVALUATION:
Directions: Answer the following items correctly. Write only the letter that corresponds to the
correct answer on the blank before each number.

_____1. If P(n,2) = 42, then what is the value of n?

A.5 C. 7
B.6 D. 8

_____2. In how many ways a president, a vice president and a secretary can be chosen from
among Ken, JP, KC, Al and Ram?
A. 30 C. 50
B. 40 D. 60

_____3. In how many ways can 2 boys, 3 girls and 3 adults be arranged in arow if there are
no restrictions?
A. 32 008 C. 42 320
B. 40 320 D. 50020

_____4. The store has 2 History books, 3 Mathematics books and 4 English books to be
arranged in a shelf. How many ways can these books be arranged on a shelf if books
of the same kind are to be placed beside each other?
A. 1272 C. 1728
B. 1584 D. 1804

_____5. In how many ways can 4 couples arrange themselves in a row if they wish to stay
together?
A. 48 C. 62
B. 56 D. 74

Prepared by:
Ranel C. Dain
Pasay City East High School
References for further enhancement:
Grade 10 Learner’s Module, pp.296 - 297
E- Math 10 by Oronce et al pp. 338 – 340
Essential Mathematics by LSC pp.162 - 163

Page 20 of 20