Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Mathematics 10

Download as pdf or txt
Download as pdf or txt
You are on page 1of 15

MOREH ACADEMY

Ricahuerta Street Cor. A. Bonifacio Avenue, Upper Bicutan,


Taguig City Tel. Nos.: 839-0135; 838-9077 Email:
morehacademy2002@yahoo.com.ph

GRADE 10

MATHEMATICS

MODULE

QUARTER 3 WEEK 2
2

Most Essential Learning Competency


1. Solves problems involving permutations

I. INTRODUCTION
MATH 10

A. Overview

In this section, you will study a special kind of counting task. You will learn how to
count the number of rearrangement than can be made out of a given set of
objects. In mathematics, you refer to any rearrangement of a group of objects as a
permutation of these objects.

B. Objectives

At the end of the module, the student should be able to:

 Illustrates the permutation of objects


 Derives the formula for finding the number of permutations of n objects taken r
at a time.
 Solves problems involving permutations.

C. Topic Outline

Statistics and Probability

 Permutation
3

II. PRE-TEST MULTIPLE CHOICES: Choose the letter of the correct answer, write your
answer on the space provided before the number.
1. How many ways can the first, second, third prize winners of a song writing contest
can be chosen among 12 finalists?
a. 1,480 ways b. 1,320 ways c. 1,230 ways d. 1,840 ways

2. How many ways can a modified true or false test with 10 items be answered if the
choices are always true, sometime true, and never true and no items is left un
answered?
a. 59, 409 b. 59, 049 c. 56, 677 d. 56, 766

3. A group of 6 students went to see a play as part of their requirements for an English
Class. If the group consists of three boys and three girls, how many ways can they
be seated in a row. If the boys and the girls alternate? If the boys sit together and
the girls sit together?
a. 90 ways b. 81 ways c. 72 ways d. 64 ways

4. How many ways can the chairman and the co-chairman of the organizing
committee for the school fair be chosen from among ten nominees for the positions?
a. 90 ways b. 81 ways c. 72 ways d. 64 ways

5. Seven balls are painted with seven colors of the rainbow: red, orange, yellow, green,
blue, indigo, and violet. In how many ways can balls be arranged in a row if the red,
yellow, and blue balls are next to each other?
a. 900 ways b. 810 ways c. 720 ways d. 640 ways

6. Five applicants for a job are to be interviewed on the same day. If two of the
applicants are friends who requested to be interviewed one after another, how many
ways can the interview be done?
a. 48 ways b. 64 ways c. 52 ways d. 72 ways

7. A group of 6 students went to see a play as part of their requirements for an English
Class. How many ways can the students be seated next to each other in a row if two
best friends who are part of the group insist on sitting next to each other?
a. 148 ways b. 164 ways c. 160 ways d. 240 ways

8. Robert borrowed three English books, 4 Mathematics books and 2 science books
from the library. In how many ways can he arrange them between two bookends on
his study table. If the books are arranged by subject matter?
a. 1,728 ways b. 1,628 ways c. 1,640 ways d. 1,720 ways

9. Robert borrowed three English books, 4 Mathematics books and 2 science books
from the library. In how many ways can he arrange them between two bookends on
his study table. If only the Mathematics books should be next to each other?
a. 17, 280 ways b. 16, 280 ways c. 16, 400 ways d. 17, 200 ways

10. Five applicants for a job are to be interviewed on the same day. How many ways
can the secretary schedule the sequence of interviews?
a. 148 ways 164 ways c. 120 ways d. 140 ways
4

III. LEARNING ACTIVITIES Let us learn!

PERMUTATION

A Permutation of a group of objects is any arrangement or


ordering of some or all of these objects.

Example 1
Consider eight students who will be identified as 𝐴, 𝐵, 𝐶, 𝐷, 𝐸, 𝐹, 𝐺 𝑎𝑛𝑑 𝐻, who were
asked to line up, any one of those student can be the first in line. Next, any of the 7
remaining can be the second in line, any of the 6 remaining after can be third, and so on.
Using our fundamental principle, the total number of ways by which the eight students can
arrange themselves in a line is given by:

8 𝑥 7 𝑥 6 𝑥 5 𝑥 4 𝑥 3 𝑥 2 𝑥 1 = 40,320

Permutation Rule No. 1


If n is a positive Integer, then the number of permutation of the rearrangements of
set of n objects in a row is n!

Now suppose you do not need an arrangement of all of the n object in the set, but
only a certain number of objects from this set. How many such arrangements are possible?
Consider for example the task of choosing three winners (first, second and third places)
from among 10 finalists in a singing contest. In how many ways can the winners be
chosen?

Note that order is important here, since you need to distinguish among the three
winners. For example, choosing A,B,C as winners is different from using B,A,C. Using the
fundamental principle again, you see that any one of the 10 finalists can be the first place,
any of the 9 remaining finalists can be the second, and any of the remaining 8 finalists can
be chosen as the third placer.

Thus, the number of ways of selecting the winners is

10 𝑥 9 𝑥 8 = 720
5

Permutation Rule No. 2: Permutation of Subsets


The number of permutation of n objects taken r at a time is given by.

𝑛!
𝑛 𝑃𝑟 = 𝑃(𝑛. 𝑟) =
(𝑛 − 𝑟)!

Example 2
How many different 3-digit numbers can be formed out of the digits 3, 4, 5, 6, 7, and
8 if the repetition is not allowed?

Solution
Since changing the order of the digits chosen changes the number formed,
this is a problem on permutation. Also, since the repetition is not allowed, each
digit can be used only once, so you are asked to find the number ordered subsets
of 3 elements each that can be formed from the set of 6 elements. Using n = 6
and r = 3 the total number of 3 digit numbers with distinct digits that can be formed
is given by.

6! 6! 6 𝑥 5 𝑥 4 𝑥 3!
𝑃(6,3) = = = = 6 𝑥 5 𝑥 4 = 120
(6 − 3)! 3! 3!

This shows that 120 3-digit numbers with different digits can be formed.
Example 2.1

Now suppose you consider any arrangement of a set of letters, not necessarily
distinct, as a “word”. If the letters are to be taken from the letters of the word RUST,
then this is a simple permutation problem of the 4 objects taken 4 at a time.
Thus are 4! = 24 words that can be formed. Some of these words are RUST, RSUT,
SURT, SRUT, URST and USRT.

This example illustrates the following rule for counting the permutation of a set of
objects where some of the elements are identical.
Example 3

How many ways are there of rearranging the letters of the word TATTOO? If the
letters were distinguishable, then there would be 6! = 720 different permutations,
since there are 6 letters.
However, the three T’s and two O’s cannot be distinguished from one another, so
this reduces the total number of rearrangements. The 3 T’s can be arranged in 3! =
6 ways. Similarly, the 2 O’s can be arranged in 2! = 2 ways without changing the
resulting arrangements of all the six letters. Thus, the total number of distinct
arrangements can be obtained by computing
6! 6𝑥5𝑥4
= = 60
3!2! 2!
6

Permutation Rule No. 3: Identical Objects


If 𝑛 objects can be partitioned into k disjoint subsets in which there n, identical
elements in the first subsets, 𝑛2 identical object in the second subsets, and so on up to
𝑛𝑘 identical objects in the kth subset, then the number of permutation of the 𝑛 objects is
given by the formula.

𝑛!
𝑛1 ! 𝑛1 ! . . . 𝑛𝑘 !

Example 3.1
A saleslady is arranging 15 Mathematics book on a shelf there are 5 volumes of a
Statistics book, 3 volumes of an Algebra book, 4 volumes of a Trigonometry Book, and 3
volumes of Calculus books. How many ways can be the books be arranged, assuming that
she can order any way she wants.

Solution
Since the books can be arranged in any manner, you consider the number
of permutation of 15 books where 5 are identical and another 3 are identical, a third
group of 4 books are identical, and a fourth subset of 3 identical books. Using the
third permutation rule given above gives you

15!
= 12,512,600
5! 3! 4! 3!

Permutation Rule No. 4: Circular Permutations


The number of ways of rearranging n distinct object in a circle is (𝑛 − 1)!

Example 4
Determine the number of ways of rearranging six colors on a spinner.

Solution

Since there are 6 colors to be rearranged in a circle there are (6 − 1)! = 5! =


120 possible rearrangements.
7

Example 4.1
During an International Students’ Night at a certain school, 4 Japanese, 3 Koreans,
2 Malaysians, and 3 Chinese exchange students are to be seated around a circular table. If
students of the same nationality are to be seated together, how many different
rearrangements are possible?

Solution
Since the students are to be seated by nationality, consider the number of
nationalities as the number of objects, so there are four in all. Thus, these four
nationalities can be arranged in a circle in (4 − 1)! = 3! Ways. However, the
students of the same nationality can rearrange themselves, so Japanese can
rearrange themselves in 4! Ways, the Koreans can sit next to each other in 3!
Ways of rearranging the Chinese among themselves. Since these are all
independent of each other, using the fundamental principle of counting gives you
a total of

3! 4! 3! 2! 3! = 6𝑥24𝑥6𝑥2𝑥6 = 10, 368


ways of seating the students around the table so that those with the same nationality
sit next to each other.

Permutation Rule No. 5:


The number of permutations ways of 𝑛 object taken 𝑟 at a time if repetition is
allowed is

𝑛 𝑥 𝑛 𝑥 . . . 𝑥 𝑛 = 𝑛𝑟

Example 5
In an apartment building, the unit owners can use security codes to prevent unlawful
access to their units. If a code consists of a letter followed by a four digits from 0 to 9, how
many different security codes are possible?

Solution
Since there is no condition that the digits should be distinct, there are
possible sequences of four digits. Since there are 26 choices for the letter, the
number of security codes possible is 26 𝑥 104 = 260,000
8

Let’s Try This!


I. Solve the given permutation problems.

In a game show, a contestant has to correctly guess a four-digit code to open the
door that contains the prizes. The digits of the code are taken from 1, 2, 3, 4, 5,
6.

a. If the code represents an even number, how many codes are possible if all
four digits are different?

b. If the last digit of the code is a prime number, how many codes must the
contestant choose from if repetition of digits is allowed?

c. If only the first and last digits are the same?

d. If it is known that code represents a number divisible by 5, how many different


codes will be the contestant choose from if all four digit of the codes are
identical?
9

MOREH ACADEMY
RIGHTEOUSNESS AND EXCELLENCE
Ricahuerta Street Cor. A. Bonifacio Avenue, Upper Bicutan, Taguig City
Tel. Nos.: 839-0135; 838-9077 Email: morehacademy2002@yahoo.com.ph

Name Date January 18, 2021


Grade &
Teacher Miss Mary Gay Calo
Section

LEARNING ACTIVITY SHEET

Subject/ Learning Area: _____MATH 10_____

PERMUTATIONS

In this section, you will study a special kind of counting task. You will learn how to count the
number of rearrangement than can be made out of a given set of objects. In mathematics, you
refer to any rearrangement of a group of objects as a permutation of these objects.

Objectives:
MELC: Solve problems involving permutations
Code: M10SP-lllb-1
At the end of the lesson, the students solve problems involving permutations

LAS 2.1
Solve the given problem involving permutations. (5 points each)

1. If a “word” is any finite arrangement of letters, how many ten-letters can be formed
out of the letters of the word “STATISTICS” if

a. There are no restrictions on the words to be formed?

b. Each word should begin with a vowel?

c. Each word begins and ends with the letter “T”?


10

Rubrics for 1-poor 2-below 3-average 4-above 5-excellent


Scoring: average average
Category
Effort Student’s Student put Student gave Student spent Student went
work shows for minimal effort to the a lot of time above and
little effort. Has a project. Met working to beyond the
preparation, few errors and all the make sure the assignment.
creativity or could have expectations. presentation Did extra
effort. added more to Didn’t go was well done. research and
Lots of errors the above and Got help and work.
and sloppy presentation beyond. asked for
handwriting feedback
Understandi Didn’t Understood a Student Student Student
ng of incorporate few of the understood understood mastered the
concepts concepts into concepts, but concepts and the concepts concepts and
project. still left out completed all and did more even added
Misundersta pieces and the tasks in the than what was more to the
nding the parts of the assignment expected of principles.
ideas and assignment him/her
principles.
Correct Most or all of Half of the Student got Student got Student got
answer to the answer problems were most of the every problem every problem
problem to each incorrect. problems correct correct,
problem correct with including the
were only a few bonus work.
incorrect. errors

References:
Lim, Yvette et al Math for Engaged Learning Sibs Publishing House Inc.

Teacher`s Remarks/ Comments:


________________________________________________________________________________
________________________________________________________________________________
____________________________________________________________________

Checked by:
_____________________________
Teacher`s Signature

Date: __________________________
11

MOREH ACADEMY
RIGHTEOUSNESS AND EXCELLENCE
Ricahuerta Street Cor. A. Bonifacio Avenue, Upper Bicutan, Taguig City
Tel. Nos.: 839-0135; 838-9077 Email: morehacademy2002@yahoo.com.ph

Name Date January 18, 2021


Grade &
Teacher Miss Mary Gay Calo
Section

LEARNING ACTIVITY SHEET

Subject/ Learning Area: _____MATH 10_____

PERMUTATIONS

In this section, you will study a special kind of counting task. You will learn how to count the
number of rearrangement than can be made out of a given set of objects. In mathematics, you
refer to any rearrangement of a group of objects as a permutation of these objects.

Objectives:
MELC: Solve problems involving permutations
Code: M10SP-lllb-1
At the end of the lesson, the students solve problems involving permutations

LAS 2.2
Solve the given problem involving permutations. (5 points each)

1. In a student organization, there are four positions in the executive committee,


namely, President, Vice President, secretary and treasurer. This officer will be
chosen from 12 finalists who were elected by the members at Large. How many
ways can the positions be filled up;

a. If the secretary has to be chosen among the five female finalist?

b. If Francis will only serve in the executive committee if he is chosen as


president?

c. If two of the finalists refuse to become the presidents?


12

Rubrics for 1-poor 2-below 3-average 4-above 5-excellent


Scoring: average average
Category
Effort Student’s Student put Student gave Student spent Student went
work shows for minimal effort to the a lot of time above and
little effort. Has a project. Met working to beyond the
preparation, few errors and all the make sure the assignment.
creativity or could have expectations. presentation Did extra
effort. added more to Didn’t go was well done. research and
Lots of errors the above and Got help and work.
and sloppy presentation beyond. asked for
handwriting feedback
Understandi Didn’t Understood a Student Student Student
ng of incorporate few of the understood understood mastered the
concepts concepts into concepts, but concepts and the concepts concepts and
project. still left out completed all and did more even added
Misundersta pieces and the tasks in the than what was more to the
nding the parts of the assignment expected of principles.
ideas and assignment him/her
principles.
Correct Most or all of Half of the Student got Student got Student got
answer to the answer problems were most of the every problem every problem
problem to each incorrect. problems correct correct,
problem correct with including the
were only a few bonus work.
incorrect. errors

References:
Lim, Yvette et al Math for Engaged Learning Sibs Publishing House Inc.

Teacher`s Remarks/ Comments:


________________________________________________________________________________
________________________________________________________________________________
____________________________________________________________________

Checked by:
_____________________________
Teacher`s Signature

Date: __________________________
13

IV. GENERALIZATION Let us wrap-up!


IV.
 A Permutation of a group of objects is any arrangement or ordering of some

or all of these objects.

 Permutation Rule No. 1

If n is a positive Integer, then the number of permutation of the

rearrangements of set of n objects in a row is n!

 Permutation Rule No. 2: Permutation of Subsets

The number of permutation of n objects taken r at a time is given by.

𝑛!
𝑛 𝑃𝑟 = 𝑃(𝑛. 𝑟) =
(𝑛 − 𝑟)!

 Permutation Rule No. 3: Identical Objects

If 𝑛 objects can be partitioned into k disjoint subsets in which there n,

identical elements in the first subsets, 𝑛2 identical object in the second

subsets, and so on up to 𝑛𝑘 identical objects in the kth subset, then the

number of permutation of the 𝑛 objects is given by the formula.

𝑛!
𝑛1 ! 𝑛1 ! . . . 𝑛𝑘 !

 Permutation Rule No. 4: Circular Permutations

The number of ways of rearranging n distinct object in a circle is (𝑛 − 1)!

 Permutation Rule No. 5:

The number of permutations ways of 𝑛 object taken 𝑟 at a time if repetition

is allowed is

𝑛 𝑥 𝑛 𝑥 . . . 𝑥 𝑛 = 𝑛𝑟
14

V. ASSESSMENT Let us check!


V.
MULTIPLE CHOICES: Choose the letter of the correct answer,
write your answer on the space provided before the number.

1. Five applicants for a job are to be interviewed on the same day. If two of the
applicants are friends who requested to be interviewed one after another, how many
ways can the interview be done?
a. 48 ways b. 64 ways c. 52 ways d. 72 ways

2. A group of 6 students went to see a play as part of their requirements for an English
Class. How many ways can the students be seated next to each other in a row if two
best friends who are part of the group insist on sitting next to each other?
a. 148 ways b. 164 ways c. 160 ways d. 240 ways

3. Robert borrowed three English books, 4 Mathematics books and 2 science books
from the library. In how many ways can he arrange them between two bookends on
his study table. If the books are arranged by subject matter?
a. 1,728 ways b. 1,628 ways c. 1,640 ways d. 1,720 ways

4. Robert borrowed three English books, 4 Mathematics books and 2 science books
from the library. In how many ways can he arrange them between two bookends on
his study table. If only the Mathematics books should be next to each other?
a. 17, 280 ways b. 16, 280 ways c. 16, 400 ways d. 17, 200 ways

5. Five applicants for a job are to be interviewed on the same day. How many ways
can the secretary schedule the sequence of interviews?
a. 148 ways 164 ways c. 120 ways d. 140 ways

6. How many ways can the first, second, third prize winners of a song writing contest
can be chosen among 12 finalists?
a. 1,480 ways b. 1,320 ways c. 1,230 ways d. 1,840 ways

7. How many ways can a modified true or false test with 10 items be answered if the
choices are always true, sometime true, and never true and no items is left un
answered?
a. 59, 409 b. 59, 049 c. 56, 677 d. 56, 766

8. A group of 6 students went to see a play as part of their requirements for an English
Class. If the group consists of three boys and three girls, how many ways can they
be seated in a row. If the boys and the girls alternate? If the boys sit together and
the girls sit together?
a. 90 ways b. 81 ways c. 72 ways d. 64 ways

9. How many ways can the chairman and the co-chairman of the organizing
committee for the school fair be chosen from among ten nominees for the positions?
a. 90 ways b. 81 ways c. 72 ways d. 64 ways

10. Seven balls are painted with seven colors of the rainbow: red, orange, yellow, green,
blue, indigo, and violet. In how many ways can balls be arranged in a row if the red,
yellow, and blue balls are next to each other?
a. 900 ways b. 810 ways c. 720 ways d. 640 ways
15

Lim, Yvette et al Math for Engaged Learning (pp 4-10) Sibs Publishing House Inc.

Prepared by:

MARY GAY CALO

JHS Mathematics Teacher

You might also like