Subject: Statistics and Probability

Authors: Mr. Jonie B. Cruz and Mr. Larry B. Miranda

Editors:
Reviewer:

WEEK 2 - LESSON 2: PERMUTATIONS AND COMBINATIONS

This lesson will introduce the concept of counting techniques, permutations and combinations. It
also helps you develop skills in solving problems involving permutations and combinations Are you
ready?

Description of the Lesson:

Objectives
At the end of the lesson, you are expected to:
a. determine the formula to be used in problems involving permutations and combinations.;
b. solve problems involving permutation and combination;
c. apply theorems and concepts involving counting techniques; and
d. recognize the importance of permutation and combination in real-situation.

Day 1: Pre-assessment (What I know)

How are you? I know you are excited to the next lesson, but before that let us have an activity.
Directions: Write TRUE if the statement is correct and FALSE if it is not.
__________1. Permutation refers to the arrangement of objects.
__________ 2. Permutation does not concern with order of objects.
__________3. Order of object does not count in combination.
__________4. There are 12 outcomes if a coin and a die is tossed.
__________5. We could represent outcomes of an event as an ordered pair.

Great! Let us pour you some of the knowledge that you need in this lesson. Have a happy
learning experience!

Lesson Content (What’s New)

Directions: Read, and understand the lesson. You may take a note or highlights the important information
to aid you in your study.
FUNDAMENTAL COUNTING PRINCIPLES: MULTIPLICATION RULE

If a certain experiment can be performed in n1 ways and corresponding to each of these ways
another experiment can be performed in n2 ways, then the combined experiment can be
performed in n1 • n2 ways.

Suppose a coin and a die are tossed. Find how many outcomes there are in the sample space.

Statistics and Probability P a g e 1 | 11

We could represent the outcomes as ordered pair, where the first component refers to the experiment
involving a coin and the second to the one with a die, as follows:

Hence, using tree diagram, there are 12 outcomes. Applying the basic principle, there are 2•6 = 12
outcomes.

The basic counting principle can be extended to cases where the combined experiment consists of three
or more steps.
Example
If the repetition of the digit is not allowed, how many three-digit numbers can be formed from digits,
1,2,3,4,5 and 6? How many of these are odd?
A three-digit numbers is composed of hundred’s, ten’s, and unit’s digit. Initially, we have six choices for
the hundreds digit. After selecting one to six, since repetition of digits is not permitted, we choose the tens
digit from the 5 remaining digits. Finally, we only have four options for the ones digit and by multiplication
rule, there are 6 ● 5 ● 4 = 120 three-digit numbers.
If we restrict only to those odd numbers, then we start for the units digit for which we only have 1 or 3 as
the options. Then we choose the hundreds digits from the remaining five digits, and the tens digit will be
chosen from the four remaining digits and apply multiplication rule. 5 ● 4 ● 3 = 60 three-digit odd
numbers.
Example
If repetition is not permitted, how many distinct 3-digit numbers is to be formed from the numbers
1,2,3,4,5,6, and 8:
a. Are even?
b. Are odd?
c. Greater than 300?
d. Greater than 330
a. Are even?
To form an even number, the units digit must be 2, 4, 6 or 8. So there are four options for the units digits.
Since, repetition is not allowed, we deduct one to the total number of options in the hundreds digit. So,
we have, 6, and Since, we use the 2 options, for the tens digit we only have 5 options. So, the number of
distinct 3-digit even numbers are (6)(5)(4) = 120 𝑡ℎ𝑟𝑒𝑒 − 𝑑𝑖𝑔𝑖𝑡 𝑒𝑣𝑒𝑛 𝑛𝑢𝑚𝑏𝑒𝑟𝑠.
b. Are odd?
To form odd number, there are three options that can be used, the number 1, 3, and 5. Then for the hundreds
digit there are 6 options, and in the tens digit there are 5 options. So, the number of distinct 3-digit odd
numbers is (6)(5)(3) = 90 𝑤𝑎𝑦𝑠.

Statistics and Probability P a g e 2 | 11

c. Greater than 300?
To form 3-digit number greater than 300, there are five options in the hundreds digit 3, 4, 5, 6, and 8.
Then, in the tens digit we can use all the number except the one that we select in the hundreds digit, so we
have 6 options in the tens digit. In the ones or unit digits, we have only 5 options. the number of distinct
3-digit numbers greater that 300 are (5)(6)(5) = 150 𝑤𝑎𝑦𝑠.
d. Greater than 330?
To form 3-digit numbers greater than 330, we split this into two parts. First, (i) distinct 3-digit numbers
that start with 4,5, 6, or 8 which is greater than 330. And second, (ii) distinct 3-digit numbers that start
with 3 which is greater than 330.
i. To form distinct 3-digit numbers that start with 4, 5, 6, and 8 which is greater than 330, we have four
options in the hundreds digit. In the tens digit, we have 6 options, and in the ones digit we have 5 options.
Hence, we have (4)(6)(5)=120 ways.
ii. To form distinct 3-digit numbers that start with 3 and greater than 330, we have 4 options in the tens
digit and 5 options in the ones digit, so we have (4)(5) = 20 ways
The total distinct 3-digit numbers greater than 330 is 120 + 20 = 140 ways
This is called Counting Principle for alternative case.

Suppose that doing one thing can be broken down into several alternative cases where each case
does not have anything in common with other cases. If cases can be done in n1 ways, case 2 can
be done in n2 ways, case 3 can be done in n3 ways, and so on, n1 + n2 + n3 +. . . +nk

PERMUTATION
The term permutation refers to the arrangement of all or part of a set of objects. Some useful permutation
techniques involve the following:
A. Factorial Permutation
If we arranged all of the number in a certain order, the number of permutations can be obtained by the
simple multiplication rule. Consider the letters a, b, c, and d is to be arranged then these are the possible
arrangements:
abcd abdc acbd acdb adbc adcb
bacd badc bcad bcda bdac bdca
cabd cadb cbad cbda cdab cdba
dabc dacb dbac dbca dcab dcba

It can also be mathematically computed using the basic counting principle. Consider that for the first
letter; there are four possible choices: a, b, c, and d. Assuming that we have chosen a, we will have three
choices for the second letter: b, c, and d. If we have chosen b, then we will have two choices for the third
letter: c or d until we have only one option for the last letter.
(4)(3)(2)(1) = 24 ways
This can be best stated using the rule:

The number of permutations of n distinct objects is n!

We define n! (read as n factorial) as the product of all counting numbers up to n. In symbol, n! = 1 • 2 •

3 •. . .• n. Thus, the number of permutations of the letters a, b, c, and d is 4! = 24 ways.
B. Permutation

Statistics and Probability P a g e 3 | 11

Suppose that only part of the whole is to be arranged in order. For example, three letters from a, b, c, and
d is to be arranged;
abc acb abd adb acd adc
bac bca bad bda bcd bdc
cab cba cad cda cbd cdb
dab dba dac dca dbc dcb

It could be considered as having three slots for the three letters to be arranged. For the first slot, there are
four options: a, b, c, and d. Supposed the letter a has been chosen for the first slot, the second slot is
allotted for the three letters b, c, or d. If letter b has chosen for the second slot, the remaining slot is
allotted for letters c or d, then the number of arrangements is (𝟒)(𝟑)(𝟐) = 𝟐𝟒 𝐰𝐚𝐲𝐬.
This can be stated as follows:

𝐧!
The number of permutations of n objects taken r at a time is 𝐏(𝐧, 𝐫) =
(𝐧−𝐫)!

From the previous illustration, we have

n!
P(n, r) =
(n − r)!
4!
P(4,3) =
(4 − 3)!
4! (4)(3)(2)(1)
= = = 24 𝑤𝑎𝑦𝑠
1! (1)

Example
In how many ways can the class officers with nine different positions be arranged from a class of 25
students?
Solution:
First, determine if it is a permutation n!
P(n, r) =
or combination. Since, it is concern (n − r)!
with the arrangement and different
arrangement matters so we will use
permutation. Then, we use the
formula for taken part out of the
whole.
Substitute the given to the formula, n!
P(n, r) =
so we have, (n − r)!
25!
P(25,9) =
(25 − 9)!
(25)(24)(23)(22)(21)(20)(19)(18)(17)(16!)
=
16!
25!
=
16!
= 2,042,975 𝑤𝑎𝑦𝑠

You can use calculator to aid you in Shift+ button with nPr.
computation. nPr(25,9) = 741,354,768,000 ways
Just press 2nd function or shift button
and press button where you can see
nPr. Then, input the data.

Statistics and Probability P a g e 4 | 11

c. Circular Permutation
Suppose letters a, b, c, and d, is to be arranged in a circular way, the starting point of the circle can
arbitrarily choose to be fixed. Then the possible arrangements are:

This is known as the circular permutation, which can be stated as follows:

The number of permutations of n distinct objects arranged in a circle is (𝐧 − 𝟏)!

Example
In how many ways can 8 people be arranged in a Merry Go Round?
Solution:
Substitute the given to the formula, so we have, (n − 1)!
= (8 − 1)!
= 7!
= 5040 𝑤𝑎𝑦𝑠

To find 7 factorials, just press 7, press shift, and 7! = 5040 ways

the button with n! or x!

d. Permutation with Repetition

Consider the case when the objects to be arranged are not all distinct. Suppose the letters a, a, and b are
to be arranged. The possible permutations are: aab, aba, baa
This is known as permutation with repetitions, which can be best stated as follows:

The number of distinct permutations of n objects of which n1 are of the first kind, n2 of a
𝐧 𝐧!
second kind, nk of a kth kind is (
𝐧𝟏 , 𝐧𝟐 , . . . 𝐧𝐤 ) = 𝐧𝟏 ! 𝐧𝟐 !...𝐧𝐤!

Statistics and Probability P a g e 5 | 11

The possible arrangements can be proved by the number of permutations of n objects has n1 ways. Since
the number of permutations of 𝑛1 objects can be arranged in 𝑛1 ! ways but all of them are the same; we
divide this to the total permutation 𝑛! and served as the proof of the given formula.
Example
In how many ways can the letters of the word Philippines be arranged?
Solution:
List the distinct letters and find their frequency. 𝑛 = 11
𝑛1 = P = 3
𝑛2 = H = 1
𝑛3 = I = 3
𝑛4 = L = 1
𝑛5 = N = 1
𝑛6 = E = 1
𝑛7 = S = 1
Substitute the needed data to the formula. n!
n1 ! n2 !. . . nk !
n!
=
(n1 )(n2)(n3 )(n4 )(n5 )(n6 )(n7 )
11!
=
(3!)(1!)(3!)(1!)(1!)(1!)(1!)

= 1108800 ways

COMBINATION

The combination of n objects taken r at a time is a selection of r objects out of n where order
does not count. it is denoted by any one of the following symbols:
n
nCr C(n, r) or ( )
r
𝐧 𝐧!
and given by the formula ( ) = 𝐫!(𝐧−𝐫)!
𝐫

Examples
A high school wants to buy six computers for its laboratory from a local supplier. The supplier has ten
computers in the stock of which are foreign-made.
a. How many ways are there to buy six computers from the supplier?
Since there are ten computers and the high school wants six of these computers, then by direct
substitution we have, 10C6 = 210 ways
b. How many ways are there to buy the six computers, if high school wants four domestic and two
foreign-made computers?
The condition here is out of six computers, four must be domestic and two foreign-made. The four
domestic computers must be selected from 6 domestic and the two foreign-made from 4 foreign-made
computers, hence, by multiplication rule, we have (6C4)(4C2) = 90 ways.
To check what you have learned from this lesson, let us have an activity.
Practice (What is it) (30 points)
Directions: Read, analyze and solve the following problems below. (50 points)
1. The digits 0, 2, 3, 4, and 8 were used to form a three-digit number. How many of numbers:
a. are formed?

Statistics and Probability P a g e 6 | 11

b. are less than 400?
c. are even?
d. are odd?
2. A shelf contains three algebra books, two calculus books, and six statistics books all of the different
titles. In how many ways can all books be arranged on the shelf?
a. along the shelf?
b. if algebra books are placed beside each other?
c. if the books of the same topic are placed beside each other?
d. if the statistics book is not to be placed beside another statistics book?
e. if calculus book is not to be placed beside the other calculus book?

Good job! You have gained knowledge and skills in solving problems involving simple interest.
Keep it up!

Day2: Review

It is good to see you in the second day of our exploration. I strongly encourage you to go over
the lesson again so you will grasp the lesson much better. If you have any questions feel free to
ask me as your instructor.

Application (What Can I do)

Directions: Read, understand and solve the following problems. Show your solution. (20 points)
1. In selecting a set meal, the customer should be choosing rice, soup, a dessert, the main course, and
drink. The restaurant offers three different servings of rice, two soup options, five desserts, eight main
course options, and six drinks. In how many ways can a customer set up his meal?
2. From a basketball team of 12 players all of whom can play the specific positions, how many ways can
the first five players be selected by their coach to play their specific positions? (Center, Power forward,
Small Forward, Shooting Guard, and Point Guard)
3. In the game “Dr. Quack-Quack” 8 individuals hold hands to form a circle. How many ways can Dr.
Quack-Quack see his friends around forming the circle?
4. In how many ways can the letters of the word ELECTROLYTE be arranged?

Wonderful work! I am sure you have given your best in our previous activity. Let us get started
with your next activity.

Valuing/Integration (What’s More?)

Direction: Read, understand and analyze the problem below. Answer the following questions. (10
points)

1. What is the difference between the permutation and combination? Cite some situation that can you
apply these concepts?

2. What new realization have you acquired in this lesson?

Statistics and Probability P a g e 7 | 11

 Wonderful work! I am sure you have given your best in our previous activity. Let us get started
with your next activity.

Day 3: Post-Assessment (What I have learned?)

Directions: Read, understand and solve the following problems. Show your solution. (20 points)
1. A student can be identified as engineering or non-engineering student, first year to fifth year, male or
female, scholar or non-scholar. How many classifications of students are there?
2. A track and field competition has 8 participants, in how many ways can the medalist be proclaimed?
(Gold, Silver, and Bronze Medal).
3. In how many ways can eight blood samples be placed in an 8-position centrifuge?
4. In how many ways can the letters of the word ENGINEERING be arranged?

Congratulations! I’m proud of what you have accomplished. I look forward that you will show
again eagerness to learn in our next module
.
Reference:
Arciaga, R.L. & Magcuyao, D.H. (2016). Statistics and Probability. Pasay City, Philippines:JFS
Publishing Services. pp. 7-18.

Statistics and Probability P a g e 8 | 11

 Subject: Statistics and Probability
Name:
Course/ Year & Section:
Instructor:

WEEK 2 - LESSON 2: PERMUTATIONS AND COMBINATIONS

PRE-ASSESSMENT (WHAT I KNOW?)

1.
2.
3.
4.
5.

PRACTICE (WHAT IS IT?)

A.
a.

b.

c.

d.

B.
a.

b.

Statistics and Probability P a g e 9 | 11

c.

d.

e.

f.

APPLICATION (WHAT CAN I DO?)

1.

2.

3.

Statistics and Probability P a g e 10 | 11

4.

VALUING/INTEGRATION (WHAT’S MORE?)

1.__________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
2..__________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________
____________________________________________________________________________________

POST-ASSESSMENT (WHAT I HAVE LEARNED?)

1.

2.

3.

4.

Statistics and Probability P a g e 11 | 11