0% found this document useful (0 votes)
193 views

Module 21 Math 10 Q3

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
193 views

Module 21 Math 10 Q3

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

10

Mathematics
Quarter 3 – Module 21:
Permutation
Mathematics – Grade 10
Quarter 3 – Module 21: Permutation

Republic Act 8293, section 176 states that: No copyright shall subsist in any work of the Government
of the Philippines. However, prior approval of the government agency or office wherein the work is
created shall be necessary for exploitation of such work for profit. Such agency or office may, among
other things, impose as a condition the payment of royalties.

Borrowed materials (i.e., songs, stories, poems, pictures, photos, brand names, trademarks, etc.)
included in this book are owned by their respective copyright holders. Every effort has been exerted to
locate and seek permission to use these materials from their respective copyright owners. The publisher
and authors do not represent nor claim ownership over them.

Regional Director: Gilbert T. Sadsad


Assistant Regional Director: Jessie L. Amin

Development Team of the Module

Writers: Marife S. Osorio


Editors:
Reviewers: Joy G. Cabrera, Amy B. Dumail
Illustrator: Name
Layout Artist: Name
Mathematics 10

Permutations

To the Learner

How many times did your mother arrange the sala set in your
home? Are you also aware for the number of times your mother arrange
the potted plants in a row? Have you ever thought that there are
numerous ways in doing a task or predicting possible outcomes in one
event? This module will help you understand those things cited. In a long
run, these will help you in making valid conclusions and .sound decisions..
.

In this module you are expected to demonstrate understanding on


the concepts about Plane Coordinate Geometry. Specifically you should
be able to :

1. Illustrates the permutation of objects.


2. Find the number of permutations of n objects taken r at a time..

Vocabulary List

Circular Permutation - the different possible arrangements off objects


in a circle. The number of permutations, P , of n objects around a circle
is given by P = ( n – r) !

Distinguishable Permutation – refers to the permutations of a set of


objects where some of them are alike. The number of distinguishable
permutations of n objects when p are alike, q are alike, and so on is given
𝑛!
by P =
𝑝!𝑞!𝑟!…
Factorial Notation - is the exclamation mark(!), n ! is read as” n factorial”
is the product of the positive integer n and all positive integers less than
n. 5! = (5)(4)(3)(2)(1)

Permutations – refers to the different possible arrangements of a set of


objects.

Let’s Try This

Choose the letter of the correct answer.


1. Which of the following situations or activities involve permutation?
A. matching shirts and pants
B. forming different triangles out of 5 points on a plane, no three of
which are collinear
C. assigning telephone numbers to subscribers
D. forming a committee from the members of a club

2. How many different 4-digit even numbers can be formed from the
digits 1, 3, 5, 6, 8, and 9 if no repetition of digits is allowed?
A. 1 680 B. 840 C. 420 D. 120

3. What is P(8, 5)? A. 56 B. 336 C. 1400 D. 6720

4. If P(n, 4) = 5040, then n = ____.


A. 12 B. 10 C. 9 D. 8

5. If P(9, r) = 3024, what is r ?


A. 2 B. 4 C. 5 D. 6
Study and Learn!
ʘ
Learning Activities
Before going through the lesson on permutation, let me assessed
your knowledge on the basic counting technique called the Fundamental
Counting Principle which will be helpful in understanding the
permutations of objects.

Fundamental Counting Principle.


If an event can occur in n1 different ways, a second event
can occur in n2 different ways, a third event in n3 different ways,
and so on, then the number of ways in which all these events can
happen is
n = n1 ● n2 ● n3, …
Take note we simply multiply the number of different ways in
which the event can happen.

Example 1
A restaurant offers a serving of soup, sandwich and beverage.
There are 2 kinds of soups ( corn or asparagus) . 4 sandwiches ( chicken,
egg, ham or tuna) and 5 beverages ( coffee, tea, milk, coke or orange to
choose from. How many possible servings can we select from?

Solution:
Since n1 = 2, n2 = 4, and n3 = 5, there are
n1 ● n2 ● n3 = ( 2) (4)(5) = 40 ways

Therefore there are 40 ways we can choose form 2 soups, 4 sandwiches


and 5 beverages.
Example 2
How many ways can a 4-digit number be formed from the digit 0, 1, 2, 3,
…,9?
a. Repetition of digit is not allowed
b. If repetition is allowed

Solution:
a. Repetition of digit is not allowed

For the ones digits there are 10 choices, 9 choices for the tens
digits, 8 choices for the hundreds digits and 6 for the thousands
digits since 0 is not included in the choices. Thus,

n = (6)(8)(9)(10) = 4, 320 numbers


Therefore there are 4,320 numbers that can be forms if repetition is not
allowed.

b. If repetition is allowed.
N = ( 9)(10)(10)(10) = 9,000 numbers
Therefore, there are 9,000 numbers that can be formed if repetition is
allowed.

The order of a particular position of a number displays


significantly the importance of arrangements of objects and numbers. Let
us now extend our understanding of arrangement.
Permutation is an arrangement of objects or elements where
order is important. Example or permutation includes the following:
a. Seating arrangement of 6 persons in round table
b. arranging 6 potted plants in a row
c. entering PIN number at your ATM card
d. Opening a combination lock
To illustrate the permutation, let’s try this, In how many ways you
can arrange the letters a, b and c ?
The possible arrangements or permutations are :
abc acb bac bca cab cba
There are 6 arrangements. Using the Fundamental Counting
Principle, for n1 there are 3 choices, n2 have 2 choices and n3 has one
choice, giving the total of n = ( 3) (2) (1) = 6 permutations.

In general, the number of permutation of n objects taken r at a time


is ;
𝑛!
P ( n, r) =
( 𝑛−𝑟)!
, n≥r

And the permutations of n objects taken all at a time is :


P (n , n) = n!

Example 3
Find P ( 5, 5) = ?

Solution:
n = 5, r = 5, this is the arrangements of objects all at a time, so
P ( 5, 5) = ( 5) (4)(3)(2)(1) = 120 ways

Remember:
P(5,5) = 5! -= ( 5)(4)(3)(2)(1); 5! reads as” 5 factorial”

Example 4
Solve; P ( 7, 3)
Solution:
n = 4, r – 3, thus
𝑛!
P ( n, r) =
( 𝑛−𝑟)!
,
7!
P ( 7, 3) =
( 7−3)!
7!
=
4!
7●6●5●4 ●3● 2 ●1
=
4 ●3● 2 ●1
= 210

Example 5.
P (n , 2) = 42
Solution:
Here the value of n is missing, thus
𝑛!
P ( n, r) =
( 𝑛−𝑟)!
,
𝑛!
( 𝑛−𝑟)!
,= 42

𝑛 ( 𝑛−1)(𝑛−2)!
= 42
( 𝑛−2)!
. n2 – n = 42
n2 – n – 42 = 0
( n -7) (n + 6) = 0 , thus n = 7 and = -6
Therefore the value of n is 7 because we disregard the negative value of
n.

Example 6
P ( 7, r) = 840
Solution:
The value of r is missing, so,
7!
P ( n, r) =
( 7−𝑟)!
,
7!
( 7−𝑟)!
,= 840

7●6●5●4 ●3● 2 ●1
= ( 7 – r)! , multiply: (7)(6)(5)(4) = 840
840
3! = ( 7 – r) !
r = 7 -3
r=4
Therefore the value of r = 4, to check ,
7! 7!
P (7, 4) =
( 7−4)!
= ( 3)!,
7●6●5●4 ●3● 2 ●1
=
3● 2 ●1
= 840

Let me discuss with you other types of permutations which will be


helpful in problem solving.

Take note that in the previous examples, the objects to be arranged


are all distinct. Suppose some of the objects are alike to be arranged are
not distinct, that is some are identical, let’s take for example the
number 949944, here the 3 9’s are alike, the same with 3 4’s are alike
so there are 6 numbers in all, which is the number off objects.

Here the three 9’s are the same and so with the three 4’s. The
duplication are eliminated by division, so the permutation of 949944 would
be:
6!
P= ,
3!3!
2 2
6●5●4 ●3● 2 ●1
=
3● 2 ●1● 3● 2 ●1
= 2● 5 ●2
= 20 arrangements
This lead us to rule of distinguishable permutation.

The number of distinguishable permutations, P, of n objects


where p objects are alike, q objects are alike and r objects are
𝑛!
alike, and so on is: P= ,
𝑝!𝑞!𝑟!

At this point let us consider the arrangement of objects in a circle,


which is called circular permutations.
The permutation of n objects arranged in a circle is :
P – ( n -1) !

Example 7.

Determine the number of arrangement of 6 person seated in a


circle.

Solution:

P = ( n -1) !

P = ( 6 -1) !

P = 5! = 5●4 ●3● 2 ●1

P = 120

Did the presentations and examples provided in this module


help you in understanding different arrangements of objects? Can you
now calculate the different permutations? I am sure you can, just coupled
you virtue with diligence so you can get the exact result. In the next
module, be ready with the problem solving.
Let’s Do This

Practice Task 1
Which of the following tasks or activities illustrates permutations?
1. Choosing 5 questions to answer out of 10 questions in a test.
2. Opening a combination locker
3. Winning in a contest
4. Selecting 7 people to form a student affairs committee Forming
triangle from distinct points
5. Forming triangle from 6 distinct points
6. Assigning seat to a guest at dinner
7. Drawing asset of 6 numbers in a lottery game
8. Entering the PIN (Personal Identification Number) at your ATM
card.
9. Selecting 3 posters to hang out of 6 different posters
10. Listing the element =s of subsets of a given test

Let’s Do More

Practice Task 2
Evaluate the following. Show your solution
1. 6!
2. 11!
3. 10!
4. P ( 5, 2)
5. P ( 6,6)

Let’s Try Harder

Solve for the unknown in each item. Show your solution


1. P ( 12, 5)= ____
2. P ( 10, 3) = _____
3. P ( n, 3) = 60
4. P ( 8, r) = 6720
5. P ( 8, 3) -= _____
6. P ( n, 4) = 3024
7. P ( 13, r) = 156
8. P ( n, 2) = 30
10!
9. = ___
4!3!2!2!
10. ( 8-1)! = ____

Let’s Test Ourselves

Choose the letter of the correct answer.

1. A certain restaurant allows you to assemble your own vegetable salad.


If there are 8 kinds of vegetables available, how many variations of the
salad can you make containing at least 5 vegetables?
A. 56 B 84 C. 93 D. 96

2.What do you call the different arrangements of the objects of a group?


A. selection C. permutation B. differentiation D. combination

3. . Which situation illustrates permutation?


A. forming a committee of councilors
B. selecting 10 questions to answer out of 15 questions in a test
C. choosing 2 literature books to buy from a variety of choices
D. assigning rooms to conference participants

4. Which of the following situations illustrate permutation?


A. selecting fruits to make a salad
B. assigning telephone numbers to homes
C. choosing household chores to do after classes
D. selecting posters to hang in the walls of your room

5. How many different 3-digit numbers can be formed from the digits 1, 3,
4, 6, 7, 9 if repetition of digits is not allowed?
A. 840 B. 720 C. 360 D. 120
6. Calculate P(12, 4). A. 40 320 B. 11 880 C. 990 D. 495

7!
7. Calculate : 3!2!
.
A. 420 B. 840 C. 1680 D. 2520

8. If x = P(7, 4), y = P(8, 4), and z = P(9, 3), arrange x, y, and z


from smallest to greatest.
A. x, y, z B. z, x, y C. y, x, z D. x, z, y
9. If P(n, 4) = 17 160, then n = ____ .
A. 9 B. 11 C. 13 D. 14

10.. If P(9, r) = 504, what is r?


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

Let’s Enrich Ourselves

Answer each questions:


1. Explain why 6!, gives the correct solution to the possible
arrangement of the letters in the word HONEST
2. Why is it the number of ways of arranging the letters BILL is less
than the number of ways of arranging the letters of MARK?
ANSWER KEY

Let’s Try This

1. C
2. D
3. D
4. B
5. B

Let’s Do This

1. Tasks/activities that illustrates permutations


Opening the combination locker
Winning in a contest
Assigning seat to guests at dinner
Entering PIN number

Let’s Do More
1. 720
2. 39 916 800
3. 3 628 800
4. 20
5. 720

Let’s Try Harder


1. 95 040
2. 720
3. 5
4. 5
5. 336
6. 9
7. 2
8. 6
9. 6 300
10. 5 040

Let’s Test Ouselves

1. B
2. C
3. D
4. B
5. D
6. B
7. A
8. B
9. C
10 D

Let’s Enrich Ourselves


1. The six letters in the word HONEST do not have objects
alike, so 6! Is the only solution.
2. BILL MARK
4! 4!
P= P=
2!1!1! 1!1!1!1!
= so therefore the permutation of the letter in BILL is less that
MARK

You might also like