Mathematics 10_Q3

Quarter 3 – Module 4
Problem Solving in Permutations and Combinations

What I Need to Know

The module contains only one lesson:

 Lesson 5 - Solve problems involving permutations and combinations

In this module, you are expected to:

1. solve problems involving permutation; and
2. solve problems involving combinations

What’s In

Permutation is an arrangement of all possible collection of things, where order is important. That is, ORDER
MATTERS.
It is written as (𝒏,𝒓) or as nPr. where n = total and r = want (arrangement)

2 Types of Permutation
1. Permutation in a Row
Under permutation in a row there are three different categories:
 Permutation of n different objects taken r at a time
a. With repetition
b. Without repetition
 Permutation of n different objects taken all at a time
 Distinguishable permutations

2. Permutation in a Circle (Circular Permutation)

Combinations refers to the number of ways of selecting from a set when the order is not important.
It is written as (𝒏,𝒓) or as nCr.

2 Types of Combination of n different object taken r at a time

1. With repetition
2. Without repetition

The difference between permutation and combinations is that in permutation the order of an object important
(order matters), while in combination the order of the object does not important (order does not matter).

What’s New

Permutation and combination are tricky in problem solving but there were easy tricks to easily identify
permutation and combination in a problem. It is the power of its “keywords”.

PERMUTATION
Keywords arrange, ordered ways, distinct ways, distinguish,
unique and many more arranging words
Types of Permutation Formula
 𝒏!
without repetition: nPr = (𝒏−𝒓)!
n taken r at a time

with repetition: P(n, r) or nPr = n x n x …(r times)= n

n taken all at a time P = n!
Distinct or distinguishable permutation 𝒏!
P=
𝒑!𝒒!𝒓!…,
Circular permutation P = (n-1)!

COMBINATIONS
Keywords select/selected, choice/choose, pick/picked,
form/formed, draw/drawn and many other combining
terms
Types of Combination Formula
n taken r at a time 𝒏!
without repetition: C (n, r) = (𝒏−𝒓)𝒓! , n ≥ r

(𝒓+𝒏−𝟏)!
with repetition: C (n, r) =
𝒓!(𝒏−𝟏)!

What is it

This time, you will apply what you have learned from the previous topics, on how to solve problems involving
permutations and combinations through the following examples:

Solving Problems Involving Permutations

 Finding permutation of n different objects taken r at a time, without repetition

Example 1: How many 3-digit numbers can be uniquely arranged from the digits 1,2,3,6, and 7 if repetition of
digits is not allowed?

Solution: keyword: uniquely arranged

For 3-digit numbers, there are obviously three place value, namely, ones, tens and hundreds place value.
Since the repetition of digit is not allowed, there are 5 possible choices on the hundreds value, 4 possible choices
on the tens place value and 3 place value on the tens digit. Using the Fundamental Counting Principle, 5 x 4 x 3
= 60 3-digit numbers. Using the formula,

𝒏!
nPr = (𝒏−𝒓)! , where n= 5 (composed of 1,2,3,6,7) and r = 3 (3-digit number)

𝟓! 𝟓 𝒙 𝟒 𝒙 𝟑 𝒙 𝟐!
5P3 = (𝟓−𝟑)! = = 60
𝟐!

Therefore, there are 60 3-digit numbers can be formed.

Example 2: In how many ways can we arrange 6 different potted plants if we wish to arrange 4 of them in a row?

Solution: keyword: arranged

n = 6 and r =4, using the formula
 𝒏! 𝟔!! 𝟔 𝒙 𝟓 𝒙 𝟒 𝒙 𝟑 𝒙 𝟐!
nPr = (𝒏−𝒓)! = (𝟔−𝟒)!
= = 360
𝟐!

Therefore, there are 360 ways that we can arrange 6 different potted plants if we wish to arrange 4 of
them in a row.

 Finding permutation of n different objects taken r at a time, with repetition

Example 1: How many 4 - letter words with or without meaning can be arranged out of the letters of the word
“MODULES” when repetition of letters is allowed?

Solution: keyword: arranged

There are 7 letters, then n=7, r= 4 (4 letter word). The repetition of letters is allowed. Using the formula,

nPr = n x n x n … = n4 = 74 = 2,401

Therefore, there are 2,401 4-letter words can be formed.

Example 2: How many 3-digit codes can be arranged from the numbers 0,1,2,3,4,5,6,7,8,9 if repetition of digits
is allowed?

Solution: keyword: arranged

There are 10 digits, then n =10, and r = 3. Thus,

nPr = 10 x 10 x … (3 times) = 103 = 1,000

Therefore, there are 1,000 3-digit codes formed.

 Solving Permutation of n different object taken all at a time

Example 1: In how many ways can we arrange 6 different potted plants in a row?

Solution: keyword: arrange

n= 6, then, P = n! = 6! = (6)(5)(4)(3)(2)(1) = 720 ways.

Therefore, there are 720 ways that we can arrange 6 different potted plants in a row.

 Solving Distinguishable Permutations

(The number of distinguishable permutations, P, of n objects where p objects are alike, q objects are alike, r
objects are alike, and so on…)

Example 1: In how many distinguishable ways can we arrange the letters of the word STATISTICS?

Solution: keyword: distinguishable ways

There are 10 letters of the word STATISTICS, n = 10, Repeated letters are: S = 3 = p; T = 3 = q; and I =
2 = r.
Using the formula:

𝒏! 𝟏𝟎! 𝟑,𝟔𝟐𝟖,𝟖𝟎𝟎 𝟑,𝟔𝟐𝟖,𝟖𝟎𝟎

P= = = = = 50, 400
𝒑!𝒒!𝒓!…, 𝟑!𝟑!𝟐! 𝟔𝒙𝟔𝒙𝟐 𝟕𝟐

Therefore, there are 50, 400 distinguishable ways that we can arrange the letters of the word
STATISTICS.
Example 2: How many ways can 3 red, 4 yellow and 2 blue bulbs be arranged distinctly in a string of Christmas
tree lights with 9 sockets?

Solution: keyword: arranged distinctly

n = 9; p = 3 red; q=4 yellow and r = 2 blue.

Using the formula:

𝑛! 9! 362,880 362,880
P= = = = = 𝟏, 𝟐𝟔𝟎 𝒘𝒂𝒚𝒔
𝑝!𝑞!𝑟!…, 3!4!2! 6 𝑥 24 𝑥 2 288

Therefore, there are 1,260 ways that 3 red, 4 yellow and 2 blue bulbs can be arranged in a string of Christmas
tree lights with 9 sockets.

 Solving problems involving Circular Permutations

Example 1: In how many ways can 6 people be seated around a circular table?

Solution: keyword: ways - seated around

n= 6, using the formula

P = (n -1)! = (6 – 1)! = 5! = 5 x 4 x 3 x 2 x 1 = 120 ways

Therefore, there are 120 ways can 6 people be seated around a circular table.

Example 2: In how many ways can 4 boys and 3 girls sit on a merry go round, where there are no two girls sit
together?

Solution: keyword: ways – sit on a merry go round

4 boys can be seated in a circular table in (4-1)! ways = 3! = 6 ways There are 4 spaces between the
𝟒! 𝟒!
boys, which can be occupied by 3 girls in P (4,3) ways = (𝟒−𝟏)! = = 24 ways. Hence, the total number of ways
𝟏!
is 6 x P (4,3) = 6 x 24 = 144 ways.

Therefore, there are 144 ways that 4 boys and 3 girls can sit around a circular table, so that no two girls
sit together.

Solving Problems Involving Combinations

 Solving Problem involving Combination without Repetition

Example 1: In how many ways can a committee consisting of 4 members be formed from 8 people?

Solution: Keyword: formed

n = 8, r = 4. Using the formula,

𝑛! 8! 8! 8 𝑥 7 𝑥 6 𝑥 5 𝑥 4! 8𝑥7𝑥6𝑥5
C (n, r) = (𝑛−𝑟)!𝑟! = (8−4)!4!
= = = = 70
4!4! 4!4! 4!

Therefore, there are 70 ways that a committee consisting of 4 members can be formed from 8 people.
Example 2: In how many ways can a committee of 5 be formed from 5 junior and 7 senior students if the
committee must have 3 seniors?

Solution: Keyword: selected

a. Since there are 7 seniors, & we will be needing 3, so, n=7 and r = 3. Using the formula,

𝑛! 7! 7!
C (n, r) = (𝑛−𝑟)!𝑟! = C (7,3) = (7−3)!3!
= = 35
4!3!

b. For 5 juniors; we will be taking 2 only to complete a committee of 5. So, n=5 and r = 2
𝑛! 5! 5!
C (n, r) = (𝑛−𝑟)!𝑟! = C (5,2) = (5−2)!2!
= = 10
3!2!

By the fundamental counting principle, for every 3 seniors, they can be grouped with any 2 juniors.

So, 35 x 10 = 350

Therefore, there are 350 ways that a committee of 5 can be selected from 5 juniors and 7 senior
students if the committee must have 3 seniors.

 Solving Problem involving Combination with Repetition

A combination with repetition of r objects from n is a way of selecting r objects from a list of n. The selection
rules are:
1. The order of selection does not matter (the same objects selected in different orders are regarded
as the same combination.
2. Each object can be selected more than once.

Example 1: There are 4 colored pens in the store. If you can buy 10 pieces with your money, how many
combinations can you make if repetition is allowed?

Solution: keyword: combinations – repetition is allowed

n= 4 and r = 10 (that may be repeated). Using the formula

(𝑟+𝑛−1)! (10+4−1)! 13! 13 𝑥 12 𝑥 11 𝑥 10! 13𝑥12𝑥11

C (n, r) = = = = = = 286
𝑟!(𝑛−1)! 10!(4−1)! 10!(3!) 10!(3!) 3!

Therefore, there are 286 possible combinations.

Example 2: Rowell has ₱50.00. He plans to spend this on pens worth ₱25.00 each. If there are red-, blue-,
black-, and violet-colored pens, how many different combinations of these pens can he buy?

Solution: keyword: combinations

The order in which the pens are chosen does not actually matter. Moreover, pens can be chosen more than
once. Thus, the number of combinations of pens that Rowell can choose is the number of possible combinations
with repetition of 2 pens (2 pens can be bought from ₱50.00 if each one costs ₱25.00) from 4. We have the
following solution: n= 4; r = 2

(𝑟+𝑛−1)! (2+4−1)! 5! 5𝑥4𝑥3! 5𝑥4

C (n, r) = = = = = = 10
𝑟!(𝑛−1)! 2!(4−1)! 2!(3!) 2!!(3!) 2!

Therefore, there are 10 different combinations of the pens that Rowell can buy.
Remember:

In solving problems involving permutations and combinations, we must know how to:

1. Identify the keywords in the problem.

2. Distinguish whether it is a permutation or a combination.
3. Identify what type of permutation or combination is the problem.
4. Use the formula given in each type of permutation or combination.
5. Determine the value of n and r.
6. Substitute the value n and r to the formula.
7. Simplify and Solve.
8. Write a conclusion.

What I Can Do

Activity 1: Identify Me!

Directions: Identify the following given problem whether it is a permutation or combination.

Write your answer on the space provided. (3 pts each)

____________1. In how many ways can 10 people be seated in a circular position?

____________2. In how many ways can first, second, third, and fourth prizes be selected in a lucky draw bowl
with 20 names in it?
____________3. In how many ways can we arrange distinctly the letters of the word MATHEMATICS?

____________4. In how many ways can we arrange 15 people to occupy the 4 vacant seats at the back of the
driver’s seat?

____________5. In how many ways can a president, a treasurer and a secretary be chosen from among 7
candidates?

Activity 2: Solve Me!

Directions: Solve the following problems. Show your solution. (5 pts. each)

1. In how many ways can 10 Boy Scout members arrange themselves at a bonfire in a circular position?

2. In how many distinguishable ways can we arrange the letters of the word “MISSISSIPPI”?

3. A platoon will select a Leader, Flag Bearer, and Secretary – from among 30 Boy Scout members. How many
ways can this three be selected from the platoon?

4. In how many ways can we arrange 10 Boy Scout members in a row?

5. A rover scout wants to buy an ice cream with the following flavors: rocky road, chocolate, ube cheese,
strawberry, and mango. In how many ways can he select 2 flavor of ice cream for his members?