COUNTING

TECHNIQUES
- used to determine possible
outcomes that are associated
with the occurrence of certain
events.
1. TREE DIAGRAM
 Isa device used to list all possibilities of a
sequence of events in a systematic way.

 Also called the “listing method”

Example 1. Suppose that a family has three (3)
children. Using tree diagram, we can find all the
possible outcomes for the genders of the children.
POSSIBLE
FIRST BORN SECOND BORN THIRD BORN OUTCOME

BOY BBB
BOY BBG
GIRL
BOY
BOY BGB
GIRL
GIRL BGG
BOY BOY GBB
GIRL GIRL GBG
BOY GGB
GIRL
GIRL
GGG
Example 2. UAAP Crown is between De La Salle Green
Archers (DLSU) and Ateneo Blue Eagles (ADMU). Determine
the number of possible outcome of the game if a team must
win two (2) out of three (3) games.
POSSIBLE
FIRST GAME SECOND GAME THIRD GAME OUTCOME

DLSU- DLSU - x

DLSU- ADMU - DLSU

DLSU- ADMU - ADMU

ADMU - DLSU- DLSU

ADMU – DLSU - ADMU

ADMU - ADMU
Example 3. Your school cafeteria offers chicken or tuna
sandwiches; chips or fruit; and milk, apple juice, or
orange juice. If you purchase one sandwich, one side item
and one drink, how many different lunches can you
choose? There are 12 possible lunches.

Sandwich(2) Side Item(2) Drink(3) Outcomes

apple juice chicken, chips, apple
chips orange juice chicken, chips, orange
milk chicken, chips, milk
chicken apple juice chicken, fruit, apple
fruit orange juice chicken, fruit, orange
milk chicken, fruit, milk
apple juice tuna, chips, apple
chips orange juice tuna, chips,
milk orange tuna, chips,
tuna apple juice tuna,
milk fruit, apple
fruit orange juice tuna, fruit, orange
milk tuna, fruit, milk
2. FUNDAMENTAL PRINCIPLE OF
COUNTING
(MULTIPLICATION RULE)
 If activity 1 can be done in n1 ways, activity 2 can
be done in n2 ways, activity 3 can be done in n3
ways, and so on, then all of these operations
can be done simultaneously in
n1 x n2 x n3 x … x n k
Example 4. How many 3-digit codes can be formed
using the digits 3, 7 and 9
a. with repetition
b. without repetition

a. Repetition is allowed

3 3 3 27
1 digit
st
2 digit
nd
3 digit
rd
ways
 333 337 339 373 377 379 393 397 399
 733 737 739 773 777 779 793 797 799

 933 937 939 973 977 979 993 997 999

Example 4. How many 3-digit codes can be formed
using the digits 1, 2 and 3
a. without repetition
b. with repetition

b. Repetition is not allowed

3 2 1 6
1st digit 2nd digit 3rd digit
ways

123 - 132 - 213 - 231 - 312 - 321

 Example 5. A greeting card software program offers 24 different
greetings, 10 different graphic images, and 8 font styles. How
many different greeting cards can you make?

There are 1,920 possible greeting cards.

Greeting(24) Image(10) Font (8) Outcomes
In this situation it makes more sense to use the
Fundamental Counting Principle.

24 • 10 • 8 = 1,920
Example 6. Suppose a school has three (3) gates,
in how many ways can a student enter and leave
the school? (Gates A, B and C)

3 3 9
Entrance Exit ways

AA – AB – AC – BA – BB – BC
CA – CB - CC
Example 7. How many different 4-digit numbers can be
formed using 1, 2, 3, 4 and 5 if:
a. Repetition is not allowed?
b. Repetition is not owed and the numbers are even?
c. Repetition is not allowed and the numbers are odd?
d. Repetition is allowed

a. Repetition is not allowed

5 4 3 2 120
1000’s 100’s 10’s 1’s
ways
Example 7. How many different 4-digit numbers can be
formed using 1, 2, 3, 4 and 5 if:

b. Repetition is not allowed, numbers are even

4 3 2 2 48
1000’s 100’s 10’s 1’s
ways
a. Repetition is not allowed, numbers are odd

4 3 2 3 72
1000’s 100’s 10’s 1’s
ways
Example 7. How many different 4-digit numbers
can be formed using 1, 2, 3, 4 and 5 if:

d. Repetition is allowed

5 5 5 5 625
1000’s 100’s 10’s 1’s
ways
MUTUALLY EXCLUSIVE
EVENTS
 Eventscan not occur simultaneously (not at
the same time)

 Example: obtaining a head in tossing a coin

and obtaining a tail in the same toss.
3. FUNDAMENTAL PRINCIPLE OF
COUNTING
(ADDITION RULE)
 If activity 1 can be done in n1 ways, activity 2 can be
done in n2 ways, activity 3 can be done in n3 ways,
and so on, and if the events are mutually exclusive,
then the total number of possible outcomes will be
n1 + n 2 + n 3 + … + n k
 Example 8. How many numbers greater than 5,000
can be formed from the digits 1, 2, 3, 4 and 5 using
each digit once in the number?
 Repetition is not allowed
EVENT 1. Forming 4 digit number greater than 5,000

1 4 3 2 24
1000’s 100’s 10’s 1’s
ways
EVENT 2. Forming 5 digit number greater than 5,000

5 4 3 2 1 120
10000’s 1000’s 100’s 10’s 1’s ways
Example 8. How many numbers greater than 5,000
can be formed from the digits 1, 2, 3, 4 and 5 using
each digit once in the number?

24 + 120 = 144
Event 1 Event 2 ways
 Example 9: If repetition is allowed,
how many 3 digit number can be
formed out of the digit 0-9 if:
 a. No Restriction
 b. If the numbers must be odd

 c. If the numbers must be even

 d. Numbers must be greater than 600 (n > 600)

Example 9: If repetition is allowed,
how many 3 digit number can be
formed out of the digit 0-9 if:
a. NO RESTRICTION

9 10 10 900
100’s 10’s 1’s
ways
Except 0
Example 9: If repetition is allowed,
how many 3 digit number can be
formed out of the digit 0-9 if:
b. Numbers must be odd

9 10 5 450
100’s 10’s 1’s
ways
1, 3, 5, 7, 9
Example 9: If repetition is allowed, how many 3 digit number
can be formed out of the digit 0-9 if:
c. Numbers must be even
Event : 1’s = 0,2,4,6,8

9 10 5 450
ways
100’s 10’s 1’s
Example 9: If repetition is allowed, how many 3 digit number
can be formed out of the digit 0-9 if:
d. Numbers must be greater than 600 (n > 600)

4 10 10
100’s 10’s 1’s
400
6, 7, 8, 9

400 – 1 = 399
(600) ways
 If repetition is NOT allowed, how
many 3 digit number can be
formed out of the digit 0-9 if:
 a. No Restriction
 b. If the numbers must be odd
 c. If the numbers must be even
 d. Numbers must be greater than 600 (n > 600)