MS.

GIE ANNE MARIE INOT

Objectives:
1.) Determine the number of outcomes in a sequence
of events (through Tree Diagram and Fundamental
Counting Principle).
2.) Find the number of ways r objects can be selected
from n objects considering the order (through
Permutation) and without regard to order
(through Combination).
3.) Apply the counting principles in solving problems.
Why learn Counting Techniques?
▪Counting techniques are the very
bases of being able to find the
different probabilities of events
in any kind of situation.
▪This is not counting one-to-one
but this is collectively counting all
possible ways of a given instance
(ex. Counting all 4-digit number
whose digits are different among
one another)
Probability is the body of knowledge that focuses
on activities that involve predicting chances and
quantifying the randomness of events.

▪Experiment
any probability activity that can be infinitely
repeated and yields results
▪Sample Space
a well-defined set of all possible outcomes
▪Event
a specific outcome to be observed;
a subset of sample space
EXPERIMENT:
Tossing a coin
SAMPLE SPACE:
Head, Tail
EVENT:
Observe a head.
Observe a tail.
EXPERIMENT:
Rolling 2 dice
SAMPLE SPACE:
(1,1), (1,2), (1,3), (1,4), (1,5), (1,6),
(2,1), (2,2), (2,3), (2,4), (2,5), (2,6),
(3,1), (3,2), (3,3), (3,4), (3,5), (3,6),
(4,1), (4,2), (4,3), (4,4), (4,5), (4,6),
(5,1), (5,2), (5,3), (5,4), (5,5), (5,6),
(6,1), (6,2), (6,3), (6,4), (6,5), (6,6)

EVENT:
Observe a sum of 10.
Observe a sum greater
than 12.
EXPERIMENT:
Picking a ball in a lottery
SAMPLE SPACE:
1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
11, 12, 13, 14, 15, 16, 17, 18, 18, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49

EVENT:
Observe an even number.
Observe an odd number.
 Tree Diagram
Fundamental Counting Principle
Permutation
Combination

Other Ways to
Illustrate Sample Space
 TREE DIAGRAM

This is a graphic organizer that

makes use of branching
connecting lines to represent a
certain relationship between
events.
 TREE DIAGRAM

PROBLEM 1:
Find the number of outcomes
when you toss two coins
simultaneously.
 TREE DIAGRAM

When you
toss the

THERE ARE 4
1st coin 2nd coin
OUTCOMES
 TREE DIAGRAM
PROBLEM 2:
Find all possible classifications if
students are classified according to
gender (female or male), field of
specialization (chemistry, mathematics,
or arts), status (regular or irregular).
 TREE DIAGRAM
REGULAR
IRREGULAR
REGULAR
IRREGULAR
REGULAR
IRREGULAR
Students are
REGULAR
classified by, IRREGULAR
REGULAR
IRREGULAR

REGULAR
IRREGULAR

THERE ARE 12
Gender Specialization Status CLASSIFICATIONS
 TREE DIAGRAM
PROBLEM 3:
Use a tree diagram to show
all the outcomes in rolling 2
dice.
 TREE DIAGRAM
When you roll the

1st Die

123456 123456 123456

2nd Die
123456 123456 123456

THERE ARE 36 OUTCOMES

 FUNDAMENTAL
COUNTING PRINCIPLE
MULTIPLICATION RULE
If an independent event can occur in m
ways, another can occur in n ways, and
the another in p ways, then the total
number of ways that all independent
events can occur simultaneously is
𝒏(𝑬) = 𝒎 × 𝒏 × 𝒑 𝒘𝒂𝒚𝒔
 FUNDAMENTAL
COUNTING PRINCIPLE
PROBLEM 4:
Liza brought 3 different pairs of
pants and 4 shirts in a camp.
How many ways can she choose
different outfits to wear?
 FUNDAMENTAL
COUNTING PRINCIPLE

*all pants can be paired to each shirts

n(choose different outfits) = 3 * 4

= 12 ways
 FUNDAMENTAL
COUNTING PRINCIPLE

PROBLEM 5:
A three-digit number is formed
using the digits 2, 4, 5, 6, and 9.
How many ways can you form a
three-digit odd numbers?
 FUNDAMENTAL
COUNTING PRINCIPLE

*all numbers can be used more than once

**there are 2 odd numbers

n(three-digit odd numbers) = 5 * 5 * 2

= 50 ways
 FUNDAMENTAL
COUNTING PRINCIPLE
PROBLEM 6:
How many 4 digit numbers are
there if no single digit must be
repeated in it?
 FUNDAMENTAL
COUNTING PRINCIPLE

*0 cannot be the first digit

**number used on the greater place value must not be use
again on the lower ones

n(4 non-repeated digits) = 9 * 9 * 8 * 7

= 4 536 ways
 FUNDAMENTAL
COUNTING PRINCIPLE
ADDITION RULE
For two separate tasks, if task A can be
done m ways and task B can be done in n
ways. Then the mutually exclusive events
A and B can be done
𝒏(𝑬) = 𝒎 + 𝒏 𝒘𝒂𝒚𝒔
 FUNDAMENTAL
COUNTING PRINCIPLE
PROBLEM 7:
Jacob bought some ping pong balls.
The store had a total of 5 orange balls
and 7 white balls. In how many ways
can he can use a ball, either orange or
white?
FUNDAMENTAL
COUNTING PRINCIPLE

n(use orange or white ball)

=5+7
= 12 ways
 FUNDAMENTAL
COUNTING PRINCIPLE
PROBLEM 8:
Consider a set of numbers
𝑆 = −4, −2, 1 , 3 , 5 , 7, 8 , 9, 10 .
How many negative or odd
number can you choose from set 𝑆?
 FUNDAMENTAL
COUNTING PRINCIPLE

*there are 2 negative numbers

**there are 5 odd numbers

n(choose a negative or an odd number) = 2 + 5

= 7 ways
 FACTORIAL NOTATION
The factorial of an integer k is the
product of all integers from 1 to k.
This is usually denoted as k! read
as “k factorial”.
Examples:
𝟕! = 𝟕 ∙ 𝟔 ∙ 𝟓 ∙ 𝟒 ∙ 𝟑 ∙ 𝟐 ∙ 𝟏 = 𝟓𝟎𝟒𝟎
3! = 𝟑 ∙ 𝟐 ∙ 𝟏 = 𝟔
 DISTINCT
PERMUTATION
This is an ordered
arrangement of objects in a
set. Here in permutation, if
all objects are distinct, they
cannot be repeated.
 DISTINCT
PERMUTATION
Permutation is usually denoted by nPr read
as “the permutation of n objects taken r at a
time”.
The general formula for permutation is
𝒏!
𝒏𝑷𝒓 =
𝒏−𝒓 !
n is the total number of objects
r is the number of objects in consideration
 DISTINCT
PERMUTATION
PROBLEM 9:
How many permutations can we
get if we rearrange the letters
of the word “CAT” ?
DISTINCT
PERMUTATION
Possible Arrangements:
CAT ATC TAC
CAT CTA ACT TCA

P(arrangement of the
word CAT)
= 3! or 3P3
= 6 permutations
 DISTINCT
PERMUTATION
PROBLEM 10:
How many ways can 5 books be
arranged in a shelf, if
Mathematics and Biology must
go together?
DISTINCT
PERMUTATION
*The 5 books can be arranged in 4! ways,
since Mathematics and Biology must go
together. The two books can also be
arranged in 2! ways.

P(arrangement of 5 books
in a shelf, Math and
Biology must go together)
= 4!2!
= 48 ways
 PERMUTATION WITH
REPETITION
The formula for finding the
distinguishable permutation from n
set of objects is
𝒏!
𝒏𝑷𝒂, 𝒃, 𝒄 … =
𝒂!𝒃!𝒄!
Where a, b, c are the number of
times a particular object exists on n.
 PERMUTATION WITH
REPETITION
PROBLEM 11:
How many permutations can we
get if we rearrange the letters
of the word “DAD”?
PERMUTATION WITH
REPETITION
Possible Arrangements:
DAD DAD DDA ADD

*since we cannot distinguish the

first D from the second one

P(arrangement of the word DAD)

𝟑!
=
𝟐!
= 3 permutations
 PERMUTATION WITH
REPETITION
PROBLEM 12:
Find the number of
distinguishable permutation of
the word “PHILIPPINES”.
PERMUTATION WITH
REPETITION
PHILIPPINES*take note of the letters that are
used more than once

P(arrangement of the word PHILIPPINES)

𝟏𝟏!
=
𝟑!𝟑!
= 1 108 800 permutations
 CIRCULAR
PERMUTATION
The number of ways n objects
can be arranged in a circular
manner is given by

𝑷 𝒏 = 𝒏−𝟏 !
 CIRCULAR
PERMUTATION
PROBLEM 13:
How many ways can 4 people
be seated on a round table with
4 seats?
CIRCULAR
PERMUTATION
*no matter where the first person sits,
the permutation is not affected

P(4 people in a 4-
seater round table)
= (4 – 1)!
= 6 ways
 CIRCULAR
PERMUTATION
PROBLEM 14:
How many ways can five couples
be seated at a round table if no
two men sit together?
CIRCULAR
PERMUTATION
*If we fix the position of one woman at any point,
then women can be arranged in (5-1)! ways. Once
the women sit down, there are 5! ways to arrange
the men in between the women.

P(5 couples are seated at a

round table, such that no 2
men sit together)
= (5 – 1)! 5!
= 2 880 ways
 CIRCULAR
PERMUTATION
PROBLEM 15:
Find the number of ways in which
5 people A, B, C, D and E can be
seated at a round table, such that
C and D never sit together.
CIRCULAR
PERMUTATION
*There are (5-1)! ways to arrange 5 people in a
round table. Since C and D must not sit together,
then subtract it with the ways they can be seated
together. That is (4-1)! 2!

P(5 people are seated at a

round table, such that C and D
must not sit together)
= (5–1)! – [(4– 1)!2!
= 12 ways
 COMBINATION
This is a mathematical technique
that determines the number of
random selection in a collection
of items where the order of the
selection does not matter.
 COMBINATION
Combination is usually denoted by nCr read
as “the combination of n objects taken r at
a time”.
The general formula for combination is
𝒏!
𝒏𝑪𝒓 =
𝒓! 𝒏 − 𝒓 !
n is the total number of objects
r is the number of objects in consideration
 COMBINATION

PROBLEM 16:
How many combinations can we
get from the word “CAT” ?
COMBINATION
*since arrangements do not matter, then
CAT = ATC = TAC = CTA = ACT = TCA
CAT
C(the word CAT)
= 3C3
= 1 combination
 COMBINATION

PROBLEM 17:
How many possible combinations
are there in 5 cards when
randomly selected from a
standard deck of 52 cards?
COMBINATION
*since arrangements do not matter,
we need to choose 5 out of 52 cards
randomly

C(choose 5 from 52 cards)

= 52C5
= 2 598 960 combinations
 COMBINATION
PROBLEM 18:
There are 5 defective light bulbs
in a bin containing 60 light bulbs.
How many ways can you select at
most 1 defective light bulbs when
you choose 4 light bulbs at
random?
 COMBINATION
*There are 5 defective
bulbs and 55 functioning.
The possible combinations
could be 1 defective bulb
and 3 functioning bulbs, or
4 functioning bulbs

C(select at most 1 defective bulb when

you choose 4)
= [5C1*55C3] + [55C4]
= 472 230 combinations