Counting Rules

Counting Rules

✓ the fundamental counting rule

✓ the permutation rule
✓ the combination rule.
❖ The Fundamental Counting Rule

Fundamental Counting Rule

In a sequence of n events in which the first one has 𝑘1 possibilities
and the second event 𝑘2 and the third has 𝑘3 , and so forth, the total
number of possibilities of the sequence will be
𝒌𝟏 ∙ 𝒌𝟐 ∙ 𝒌𝟑 ⋯ 𝒌𝟒
Note: In this case “and” means multiply.
Example 1: A coin is tossed and a die is rolled. Find the number of
outcomes for the sequence of events.

Solution:
H, 1
H, 2 n 𝑐𝑜𝑖𝑛𝑠 = 2
H, 3 n 𝑑𝑖𝑒 = 6
H, 4
H, 5 Let
H, 6 𝑇 = 𝑡𝑜𝑡𝑎𝑙 # 𝑜𝑓 𝑝𝑜𝑠𝑠𝑖𝑏𝑖𝑙𝑖𝑡𝑖𝑒𝑠
T, 1 𝑇 = 𝑛(𝑐𝑜𝑖𝑛𝑠) ∙ 𝑛(𝑑𝑖𝑒)
T, 2
T, 3 =2∙6
T, 4
𝑻 = 𝟏𝟐
T, 5
T, 6
Example 2:

A paint manufacturer wishes to manufacture several different paints.

The categories include

Color red, blue, white, black, green, brown, yellow

Type latex, oil
Texture flat, semi gloss, high gloss
Use outdoor, indoor

How many different kinds of paint can be made if a person can select
one color, one type, one texture, and one use?
Solution:
Color red, blue, white, black, green, brown, yellow
Type latex, oil
Texture flat, semi gloss, high gloss
Use outdoor, indoor

n 𝑐𝑜𝑙𝑜𝑟 = 7 n 𝑡𝑒𝑥𝑡𝑢𝑟𝑒 = 3
n 𝑡𝑦𝑝𝑒 = 2 n 𝑢𝑠𝑒 = 2

𝑇 = 𝑛(𝑐𝑜𝑙𝑜𝑟) ∙ 𝑛(𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑡𝑒𝑥𝑡𝑢𝑟𝑒) ∙ 𝑛(𝑢𝑠𝑒)

=7∙2∙3∙2
𝑻 = 𝟖𝟒
Example 3:
There are four blood types, A, B, AB, and O. Blood can also be Rh+ and
Rh-. Finally, a blood donor can be classified as either male or female.
How many different ways can a donor have his or her blood labeled?

Solution:

Since there are 4 possibilities for blood type, 2 possibilities for Rh

factor, and 2 possibilities for the gender of the donor, there are 4 2 2, or
16, different classification categories, as shown.

𝑇 = 𝑛(𝑏𝑙𝑜𝑜𝑑 𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑅ℎ 𝑡𝑦𝑝𝑒) ∙ 𝑛(𝑔𝑒𝑛𝑑𝑒𝑟)

=4∙2∙2
𝑻 = 𝟏𝟔
𝑇𝑟𝑒𝑒 𝐷𝑖𝑎𝑔𝑟𝑎𝑚:
When determining the number of different possibilities of a sequence of
events, one must know whether repetitions are permissible.

Example 4:
The digits 0, 1, 2, 3, and 4 are to be used in a four-digit ID card. How
many different cards are possible if repetitions are permitted?

Solution: 5 ∙ 5 ∙ 5 ∙ 5 = 54 = 𝟔𝟐𝟓

Example 5:
The digits 0, 1, 2, 3, and 4 are to be used in a four-digit ID card. How
many different cards are possible if repetitions are NOT permitted?

Solution: 5∙4∙3∙2 = 𝟏𝟐𝟎

Summary:

If repetitions are permitted, then the numbers stay the same going
from left to right. If repetitions are not permitted, then the numbers
decrease by 1 for each place left to right.

Counting Rules
✓ the fundamental counting rule
o the permutation rule
o the combination rule.
Factorial Notation, 𝒏!

Factorial Formulas
For any counting number, 𝑛
𝑛! = 𝑛 𝑛 − 1 𝑛 − 2 … 1
0! = 1

Examples:
5! = 5 4 3 2 1 = 𝟏𝟐𝟎
9! = 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1 = 𝟑𝟔𝟐, 𝟖𝟖𝟎
❖ Permutations
A permutation is an arrangement of 𝑛 objects in a specific order.

Example 1:

A business owner has a choice of five locations in which to establish

her business. She decides to rank each location according to certain
criteria, such as price of the store and parking facilities. How many
different ways can she rank the five locations?

5! = 5 4 3 2 1 = 𝟏𝟐𝟎
Example 2:
There are four candidates for a job. The members of the search
committee will rank the four candidates from strongest to weakest.
How many different outcomes are possible?

Solution: Strongest candidate ⇒ 4 options

2nd -Strongest candidate ⇒ 3 options
3rd -Strongest candidate ⇒ 2 options
Weakest candidate ⇒ 1 option
4 3 2 1 = 𝟐𝟒
The number of ways to arrange 4 things is 4!
4! = 𝟐𝟒
Example 3:
Gomer has a 20 volume set of World Book Encyclopedia. If Gomer is
going to choose 9 of the 20 books, and arrange them on a shelf, how
many arrangements are possible?

Solution:
1. Choose first book: 20 options 6. Choose sixth book : 15 options
2. Choose second book: 19 options 7. Choose seventh book: 14 options
3. Choose third book: 18 options 8. Choose eighth book: 13 options
4. Choose fourth book: 17 options 9. Choose ninth book: 12 options
5. Choose fifth book: 16 options

20 19 18 17 16 15 14 13 12
= 𝟔𝟎, 𝟗𝟒𝟗, 𝟑𝟐𝟒, 𝟖𝟎𝟎 arrangements
Example 4:
Suppose the business owner in Example 1 wishes to rank only the top
three of the five locations. How many different ways can she rank
them?

Solution:

1st Choice 2nd Choice 3rd Choice

(5) (4) (3) = 60
Example 5:
In how many different ways can the letters of the word “OPTICAL” be
arranged so that the vowels always come together?
Solution: __ __ __ __ __ __ __

O, I, A
The number of ways to arrange all the letters ⇒ 5!
The number of ways to arrange the 3 vowels⇒ 3!

Thus, the number of ways to arrange the letters of the word

“OPTICAL” be arranged so that the vowels always come together is
5! 3! = (120)(6) = 𝟕𝟐𝟎 𝑤𝑎𝑦𝑠
Example 6:
How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7
and 9 if none of the digits is repeated.
Solution:
(4) (5) (6)
______ ______ ______
Hundreds Tens Ones

6 5 4 = 𝟏𝟐𝟎

Thus, 120 3-digit numbers can be formed from the given digits.
Example 7:
How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7
and 9 which are divisible by 5 and none of the digits is repeated.
Solution:
(4) (5) (1)
______ ______ ______
Hundreds Tens Ones

1 5 4 = 𝟐𝟎

Thus, 20 3-digit numbers that are divisible by 5can be formed from

the given digits.
Permutation Rule
The arrangement of 𝑛 objects in a specific order using 𝑟 objects at a
time is called a permutation of 𝑛 objects taking 𝑟 objects at a time.
It is written as 𝑛𝑃𝑟 and the formula is
𝒏!
𝒏𝑷𝒓 = 𝑷 𝒏, 𝒓 =
𝒏−𝒓 !

Example:
6! 6! 6∙5∙4∙3∙2∙1
6𝑃4 = 𝑃 6,4 = = = = 𝟑𝟔𝟎
6−4 ! 2! 2∙1
Example 1:

A business owner has a choice of five locations in which to establish her

business. She decides to rank each location according to certain criteria,
such as price of the store and parking facilities. How many different
ways can she rank the five locations?

Solution:
5! 5! 5∙4∙3∙2∙1
5𝑃5 = 𝑃(5,5) = = = = 𝟏𝟐𝟎
5−5 ! 0! 1

Therefore, the business owner can rank the 5 locations in 120 ways.
Example 2:

A business owner has a choice of five locations in which to establish her

business. She decides to rank each location according to certain criteria,
such as price of the store and parking facilities. How many different
ways can she rank the locations if only three locations will be selected?

Solution:
5! 5! 5∙4∙3∙2∙1
5𝑃3 = 𝑃(5,3) = = = = 𝟔𝟎
5 − 3 ! 2! 2∙1

Therefore, the owner can rank 3 locations in 60 ways.

Example 3:
A television news director wishes to use three news stories on an
evening show. One story will be the lead story, one will be the second
story, and the last will be a closing story. If the director has a total of
eight stories to choose from, how many possible ways can the program
be set up?

Solution:
8! 8!
8𝑃3 = 𝑃(8,3) = = = 𝟑𝟑𝟔
8−3 ! 5!

Therefore, the director can set up three new stories out of the eights
stories in 336 ways.
Example 4:

How many different ways can a chairperson and an assistant

chairperson be selected for a research project if there are seven
scientists available?

Solution:
7! 7!
7𝑃2 = 𝑃(7,2) = = = 𝟒𝟐
7−2 ! 5!

Therefore, from 7 scientists, a chairperson and an assistant may be

selected in 42 different ways.
Example 5:

A large office building has 8 exists. In how

many ways a man enter the building and
leave by a different exit?

Solution:

8! 8! 8 ∙ 7 ∙ 6!
8𝑃2 = 𝑃(8,2) = = = = 𝟓𝟔
8−2 ! 6! 6!

The total number of ways a man may enter the building and leave by
a different exit is 56 ways
Example 6:

In how many ways can 3 different prizes be

awarded among 8 people if no person is to
receive more than one prize? (3rd, 2nd, and 1st
place)

Solution:
8!
8𝑃3 = 𝑃(8,3) =
8−3 !
8! 8 ∙ 7 ∙ 6 ∙ 5!
= = = 𝟑𝟑𝟔
5! 5!
There are 336 possibilities that 3 different
prizes can be awarded among 8 people.
Example 7:

Suppose you have three books A, B, and C, but you

have room for only two on your bookshelf. In how
many ways can you select and arrange the two
books?

Solution:
3! 3!
3𝑃2 = 𝑃 3,2 = = =𝟔
3 − 2 ! 1!

There are 336 possibilities that 3 different prizes can be awarded

among 8 people.
Example 8:

In how many different ways can the letters of the word 'DETAIL' be
arranged such that the vowels must occupy only the odd positions?
Solution:
3 vowels (EAI) and __ __ __ __ __ __
3 consonants (DTL) (1) (2) (3) (4) (5) (6)

# of ways to arrange # of ways to arrange

the vowels the consonants
3! 3!
3𝑃3 = 𝑃 3,3 = 3𝑃3 = 𝑃 3,3 =
3−3 ! 3−3 !
3! 3!
= =𝟔 = =𝟔
0! 0!
Thus, the number of ways the letters of the word 'DETAIL’ can be
arranged such that the vowels must occupy only the odd positions is

𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑡𝑜 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑤𝑎𝑦𝑠 𝑡𝑜

=
𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡ℎ𝑒 𝑣𝑜𝑤𝑒𝑙𝑠 𝑎𝑟𝑟𝑎𝑛𝑔𝑒 𝑡ℎ 𝑐𝑜𝑛𝑠𝑜𝑛𝑎𝑛𝑡𝑠

= 6 6 = 𝟑𝟔 𝒘𝒂𝒚𝒔
NUMBER OF DISTINGUISHABLE PERMUTATIONS

Given 𝑛 objects of which 𝑘 are alike, the number of distinguishable

permutations of the n objects is
𝑛!
𝑘!

The number of distinguishable permutations of n elements taken at

a time with 𝑛1 elements alike, 𝑛2 of another kind alike … 𝑛𝑘 of the
kth alike is
𝑛!
𝑛1 ! 𝑛2 ! … 𝑛𝑘 !
Example:

In how many ways may 12 flags be arranged

if 4 are red, 3 are blue and 5 are green?

Solution:
𝑛! 12! 12 ∙ 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5!
= =
𝑛1 ! 𝑛2 ! … 𝑛𝑘 ! 4! 3! 5! (4 ∙ 3 ∙ 2 ∙ 1)(3 ∙ 2 ∙ 1)5!
12 ∙ 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7 ∙ 6 ∙ 5!
=
(4 ∙ 3 ∙ 2 ∙ 1)(3 ∙ 2 ∙ 1)5!
= 𝟐𝟕, 𝟕𝟐𝟎

Thus, 27, 720 flag arrangement can be formed

Example:

How many arrangements can be made out of the letters of the word
‘ENGINEERING’?

Solution:
The word 'ENGINEERING' has 11 letters.
'E' occurs 3 times, 'N' occurs 3 times, ‘G’ and ‘I’ occurs 2 times

number of ways to arrange these letters,

𝑛! 11!
= = 𝟐𝟕𝟕, 𝟐𝟎𝟎
𝑛1 ! 𝑛2 ! … 𝑛𝑘 ! 3! 3! 2! 2!
CIRCULAR PERMUTATION

A special type of permutation where the objects are arranged in

a circular pattern.

𝑃𝑐 = 𝑛 − 1 !
Example:
Linear permutation of 3 objects is 3! = 6
{1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, {3,2,1}
Circular permutation of 3 objects is (3 − 1)! =2
{1,2,3}, {1,3,2}
Example:
Circular permutation of 4 objects is (4 − 1)! =6

{1,2,3,4}, {1,2,4, 3}, {1,3,2,4},{1,3,4,2},{1,4,2,3},{1,4,3,2}

Example:

In how many ways can 7 children be

seated around a circular table?

Solution:
𝑃𝑐 = 𝑛 − 1 !

𝑃7 = 7 − 1 ! = 6! = 𝟕𝟐𝟎

The 7 children can be seated around the circular table in 720 ways.
Example:

Find the number of ways 6 people Ann, Ben, Carol, Dan, Eve and Faye
can be seated at a round table, such that Eve and Faye must always sit
together.

Solution: Ways for Eve and Faye to seat together

⇨ 2!
Arrangement of 5 people to in a circle
⇨ (5 − 1)!

Therefore, the number of ways is

(4!)(2!) = 𝟒𝟖
❖ Combinations
A selection of distinct objects without regard to order is called a
combination.

Example:
Selection of menu, food, clothes, subjects, the team are examples of
combinations.
Example:
A dress designer wishes to select two colors of material to design a
new dress, and she has on hand four colors. How many different
possibilities can there be in this situation?
Example:
Given the letters A, B, C, and D, list the permutations and combinations
for selecting two letters.

Solution:
The permutations are The combinations are
AB BA CA DA AB BA CA DA
AC BC CB DB AC BC CB DB
AD BD CD DC AD BD CD DC
There are 12 permutations. There are 6 combinations.

Combinations are used when the order or arrangement is not

important, as in the selecting process.
Combination Rule
The number of combinations of r objects selected from n objects is
denoted by 𝑛𝐶𝑟 and is given by the formula
𝒏!
𝒏𝑪𝒓 = 𝑪 𝒏, 𝒓 =
𝒏 − 𝒓 ! 𝒓!

Example:
How many combinations of 4 objects are there, taken 2 at a time?

Solution:
4! 4! 4 ∙ 3 ∙ 2!
4𝐶2 = 𝐶(4,2) = = = =𝟔
4 − 2 ! 2! 2! 2! 2 ∙ 1 ∙ 2!
Combination Rule: Permutation Rule:
𝒏! 𝒏!
𝒏𝑪𝒓 = 𝒏𝑷𝒓 =
𝒏 − 𝒓 ! 𝒓! 𝒏−𝒓 !

𝒏!
𝒏𝑪𝒓 =
𝒏 − 𝒓 ! 𝒓!

𝒏𝑷𝒓
𝒏𝑪𝒓 =
𝒓!

divides out the duplicates from the

number of permutations
Example 1:
A bicycle shop owner has 12 mountain bicycles in the showroom. The
owner wishes to select 5 of them to display at a bicycle show. How
many different ways can a group of 5 be selected?

Solution:
12! 12!
12𝐶5 = 𝐶(12,5) = =
12 − 5 ! 5! 7! 5!
12 ∙ 11 ∙ 10 ∙ 9 ∙ 8 ∙ 7!
=
7! 5 ∙ 4 ∙ 3 ∙ 2 ∙ 1
= 𝟕𝟗𝟐
Example 2:
Six points lie on the circumference of a
circle. How many inscribed triangles can
be drawn having these points as vertices?

Solution:
6! 6!
6𝐶3 = 𝐶 6,3 = = = 𝟐𝟎
6 − 3 ! 3! 3! 3!

Thus, there are 20 inscribed triangles that can be drawn having

those six points are vertices.
Example 3:
Sharon’s class must select 2 students out of 5
candidates as class representatives. How many
different pairs can be selected from the five
candidates.
Candidates
Solution: Reyes
5! 5! Santos
5𝐶2 = 𝐶 5,2 = = = 𝟏𝟎
5 − 2 ! 2! 3! 2! Dela Cruz
Perez
Therefore, there are 10different pairs that
can be selected from the five candidates. Salonga
Example 4:
In a club there are 7 women and 5 men. A committee of 3 women and
2 men is to be chosen. How many different possibilities are there?

Solution:
7𝐶3 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 7 𝑤𝑜𝑚𝑒𝑛,
𝑡𝑎𝑘𝑒𝑛 3 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒 7𝐶3 ∙ 5𝐶2
7!
7𝐶3 = 7! 5!
7 − 3 ! 3! = ∙
7 − 3 ! 3! 5 − 2 ! 2!
5𝐶2 = 𝑐𝑜𝑚𝑏𝑖𝑛𝑎𝑡𝑖𝑜𝑛 𝑜𝑓 5 𝑚𝑒𝑛,
= 𝟑𝟓𝟎
𝑡𝑎𝑘𝑒𝑛 2 𝑎𝑡 𝑎 𝑡𝑖𝑚𝑒
5!
5𝐶2 =
5 − 2 ! 2!
Example 5:
Out of 7 consonants and 4 vowels, how many 5-letter words of 3
consonants and 2 vowels can be formed?
Solution:
# of ways of selecting 3 consonants from 7 = 7𝐶3
# of ways of selecting 2 vowels from 4 = 4𝐶2

# of ways of selecting 3 consonants from 7 and 2 vowels from 4,

7! 4! 7! 4!
7𝐶3 4𝐶2 = =
7 − 3 ! 3! 4 − 2 ! 2! 4! 3! 2! 2!
= 𝟐𝟏𝟎
Therefore, 210 words can be formed with 5 letters (3 consonants and
2 vowels)
Example 6:
In a group of 6 boys and 4 girls, four children are to be selected. In how
many different ways can they be selected such that at least one boy
should be there?
Solution:
If 4 boys are selected, then the # of ways to this = 6𝐶4
If 3 boys and 1 girl are selected, then the # of ways to this = 6𝐶3 4𝐶1
If 2 boys and 2 girls are selected, then the # of ways to this = 6𝐶2 4𝐶2
If 1 boy and 3 girls are selected, then the # of ways to this = 6𝐶1 4𝐶3

Thus, the total number of ways

6𝐶4 + 6𝐶3 4𝐶1 + 6𝐶2 4𝐶2 + 6𝐶1 4𝐶3
 6𝐶4 + 6𝐶3 4𝐶1 + 6𝐶2 4𝐶2 + 6𝐶1 4𝐶3

6! 6! 4! 6! 4!
= + ∙ + ∙ +
6 − 4 ! 4! 6 − 3 ! 3! 4 − 1 ! 1! 6 − 2 ! 2! 4 − 2 ! 2!
6! 4!
∙
6 − 1 ! 1! 4 − 3 ! 3!

= 15 + 20 ∙ 4 + 15 ∙ 6 + 6 ∙ 4 = 𝟐𝟎𝟗

Thus, there are a total of 209 ways to select 4 children from 6 boys
and 4 girls where at least one boy is there.
Example 6 (alternative solution):
In a group of 6 boys and 4 girls, four children are to be selected. In how
many different ways can they be selected such that at least one boy
should be there?

Solution:
6 boys and 4 girls = 10 participants
out of the 10 participants, 4 of children are needed without an all
girls situation

10! 4!
10𝐶4 − 4𝐶4 = − = 𝟐𝟎𝟗
10 − 4 ! 4! 4 − 4 ! 4!
Summary of Counting Rules

Rule Definition Formula

The number of ways a sequence 𝑘1 ∙ 𝑘2 ∙ 𝑘3 ⋯ 𝑘𝑛
Fundamental of 𝑛 events ca occur if the first
Counting Rule event occur in 𝑘1 ways, the
second in 𝑘2 ways, etc.

The number of permutations of 𝑛

𝑛!
Permutation Rule objects taking 𝑟 objects at a time 𝑛𝑃𝑟 =
𝑛−𝑟 !
(order is important)
The number of combinations of r 𝑛!
Combination Rule objects taken from n objects 𝑛𝐶𝑟 =
𝑛 − 𝑟 ! 𝑟!
(order is not important)
Probability and
Counting Rules
Example 1:
Find the probability of getting 4 aces when 5 cards are drawn from
an ordinary deck of cards.

Solution:
ways to draw 5 cards from a deck ⟹ 52𝐶5
ways to get 4 aces ⟹ 4𝐶4
possibilities to get the 5th card ⟹ 48

4𝐶4 ∙ 48 1 ∙ 48 𝟏
𝑃 4 𝑎𝑐𝑒𝑠 = = =
52𝐶5 2,598,960 𝟓𝟒, 𝟏𝟒𝟓
Example 2:
A box contains 24 transistors, 4 of which are defective. If 4 are sold at
random, find the following probabilities.
a. exactly 2 are defective c. all are defective
b. none is defective d. at least 1 is defective

Solution: ways to sell 4 transistors ⟹ 24C4

a. Two defective transistors can be selected as 4C2 and 2 non-defective

ones as 20C2
4𝐶2 ∙ 20𝐶2 1140 𝟏
𝑃 𝑒𝑥𝑎𝑐𝑡𝑙𝑦 2 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = = =
24𝐶4 10,6260 𝟓𝟒, 𝟏𝟒𝟓
b. The number of ways to choose no defectives is 20C4.

20𝐶4 4845 𝟏, 𝟔𝟏𝟓

𝑃 𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = = =
24𝐶4 10,6260 𝟑, 𝟓𝟒𝟐

c. The number of ways to choose 4 defectives from 4 is 4C4, or 1.

4𝐶4 𝟏
𝑃 𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠 = =
24𝐶4 𝟏𝟎, 𝟔𝟐𝟔𝟎
d. To find the probability of at least 1 defective transistor, find the
probability that there are no defective transistors, and then
subtract that probability from 1.

𝑃 𝑎𝑡 𝑙𝑒𝑎𝑠𝑡 1 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒 = 1 − 𝑃(𝑛𝑜 𝑑𝑒𝑓𝑒𝑐𝑡𝑖𝑣𝑒𝑠)

20𝐶4
=1−
24𝐶4
1615
=1−
3542
𝟏𝟗𝟐𝟕
=
𝟑𝟓𝟒𝟐
Prepare for Quiz #3 next meeting.

Topics: Probability
Counting Rules

Good Luck!