MTAP Saturday Program

in Mathematics
GRADE 10 SESSION 6
Counting
Techniques

Session 6
Different Ways Of Counting
• Listing There are only four cyclists: A, B, C and D.
• Tree Diagram There are four cyclists to choose from for
• Tabular the first place, three cyclists to choose
• Box Method from for the second place and two cyclists
to choose from for the third place.

Exercise I. A. 1.
Listing is a counting technique that involves complete list of
all possible outcomes.

• The actual list of all possible arrangements are ABC, ABD,

ACB, ACD, ADB, ADC, BAC, BAD, BCA, BCD, BDA, BDC, CAB,
CAD, CBA, CBD, CDA, CDB, DAB, DAC, DBA, DBC, DCA, DCB.
Therefore, there are 24 possible arrangements.

Exercise I. A. 1.
Tree Diagram is another technique which uses line
segments originating from an event to an outcome.
This is a picture of all possible outcomes when an
event is unfolded.
C C B B
B A A A
D D D C
B A A A
A C B C C B D B
D D D C
B A A A
D D D C
C C B B

Exercise I. A. 1.
Tabular is a technique where values or different possibilities
are tabulated.
Second Third
A B C D A B C D
A AA AB AC AD AB ABA ABB ABC ABD
AC ACA ACB ACC ACD
First

B BA BB BC BD
AD ADA ADB ADC ADD *A cyclist can only be chosen once.
C CA CB CC CD
BA BAA BAB BAC BAD

First & Second

D DA DB DC DD
BC BCA BCB BCC BCD
BD BDA BDB BDC BDD
CA CAA CAB CAC CAD
CB CBA CBB CBC CBD
CD CDA CDB CDC CDD
DA DAA DAB DAC DAD
DB DBA DBB DBC DBD
DC DCA DCB DCC DCD
Exercise I. A. 1.
Box method
First Second Third

4 • 3 • 2 = 24

Exercise I. A. 1.
Factorial
• n factorial is denoted by n! It is the product of all positive integers less than or
equal to n.
Example:
5! can be read as “5 factorial”.
It means 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 which is equal to 120.
We can write 5! In several ways.
5⋅4! 5 ⋅ 4 ⋅ 3! 5 ⋅ 4 ⋅ 3 ⋅ 2! 5⋅4⋅3⋅2⋅1

Exercise I. A. 2.
Fundamental Principle of Counting (FPC)
• is a counting technique in which if two events are independent and
one event occurs in ways, and the other event occurs in ways, then,
these events occur in ways.

Exercise I. A. 3.
Determine the sample space S if you toss/roll

• a. a coin once; two coins once; three coins once; n coins once.

• { H, T } ; { HH, HT, TH, TT} ; {HHH, HHT, HTH, THH, HTT,

THT, TTH, TTT}; {, , … , , }

Exercise I. A. 4.
Determine the sample space S if you toss/roll

• b. a die once; two dice once; three dice once; n dice once.
• S ( a die ) = { 1, 2, 3, 4, 5, 6 };
• S (2 dice) = {(1,1), (1,2), (1,3), ... , (2,1), (2,2), (2,3), ... , (5,1), (5,2),
(5,3), ... , (6,1), (6,2), (6,3), (6,4), (6,5), (6,6)}

Exercise I. A. 4.
Determine the sample space S if you toss/roll

• b. a die once; two dice once; three dice once; n dice once.
• S (3 dice) = {(1,1,1), (1,1,2), (1,1,3), ... , (1,2,1), (1,2,2), (1,2,3), ... ,
(6,1,1), (6,1,2), (6,1,3), ... , (6,6,4), (6,6,5), (6,6,6)}
• S (n dice) = {(), (), (), ... , (), (), ()}

Exercise I. A. 4.
Determine the sample space S if you toss/roll

• c. a coin and a die once

• S(a coin and a die) = {(H, 1), (H, 2), (H, 3), (H, 4), (H, 5), (H, 6),
(T, 1), (T, 2), (T, 3), (T, 4), (T, 5), (T, 6)}

Exercise I. A. 4.
What is the number of elements n(S) in each of the
experiments in (4)?
• a. n(Sa coin) = 2 ; n(S2 coins) = 4 ; n(S3 coins) = 8 ; n(Sn coins) = 2n

• b. n(Sa die) = 6 ; n(S2 dice) = 36 ; n(S3 dice) = 216 ; n(Sn dice) = 6n

• c. n(Sa coin and a die) = 12

Exercise I. A. 5.
A newborn child may be given one or two names. If
there are 200 names to choose from, how many possible
names can a child have? (If a child is to have two names,
it is assumed that the names are different.)
• Suppose the child is to have one name. The child may be named in
200 ways. But, if the child is to have two names, then this can be
done in 200 · 199 = 39800 ways.
Thus, by Addition, the child may be named in
200 + 39800 = 40000 ways.

Exercise I. B. 1.
A prospective buyer of a new car can choose between
manual or automatic transmission and can also choose
from 4 colors: red, blue, pink or green. How many
different choices does the buyer have?

Exercise I. B. 2.
A club with 25 members must choose a president and a
secretary. In how many ways can this happen if each
member is eligible for each position?

Exercise I. B. 3.
For your morning snack, you may choose from coffee,
milk or juice. You also have two choices for sandwich:
ham or tuna. How many possible snacks can you have?

Exercise I. B. 4.
A certain bag factory manufactures ladies' bags in 8
styles, 6 colors and 4 sizes. How many different bags are
available?

Exercise I. B. 5.
Permutation is the arrangement of objects in
which order is important. The permutation of
objects taken at a time is denoted by or .

Exercise II. A. 1.
Permutation

Exercise II. A. 1.
Consider this situation, “You are the leader of a
group, and you need to pick an assistant leader
and a secretary for your group.” Assume that
you have 𝑛 members and we are to take 𝑟 of
them at a time, where 𝑟 = 2 (since only two
positions are to be assigned).
Then, we have,

𝑃 ( 𝑛, 2 ) =𝑛(𝑛−1)=𝑛(𝑛− 2+1)
Exercise II. A. 2.
Extending this concept for other values of 𝑟, we
have,

r P(n, r) Equivalent Expression

3 𝑛(𝑛−1)(𝑛−2) 𝑛(𝑛−1)(𝑛−3+1)
4 𝑛(𝑛−1)(𝑛−2)(𝑛−3) 𝑛(𝑛−1)(𝑛−2)(𝑛−4+1)
5 𝑛(𝑛−1)(𝑛−2)(𝑛−3)(𝑛−4) 𝑛(𝑛−1)(𝑛−2)(𝑛−3)(𝑛−5+1)

Exercise II. A. 2.
Using these specific instances, let us try to derive
the formula for finding the permutation of 𝑛
objects taken 𝑟 at a time. As observed, we can say
in general that,

𝑃 ( 𝑛,𝑟 ) =𝑛(𝑛−1)(𝑛−2)⋅ …⋅(𝑛−𝑟+1).

Exercise II. A. 2.
Without loss of generality, this is the same as

𝑛(𝑛−1)(𝑛− 2)⋅…⋅(𝑛− 𝑟 +1)(𝑛−𝑟 )(𝑛−𝑟 − 1)⋅…⋅3⋅2⋅1

𝑃 ( 𝑛,𝑟 ) =
(𝑛−𝑟 )(𝑛−𝑟 −1)⋅…⋅3⋅2 ⋅1

Exercise II. A. 2.
Using the definition of factorial, we can say that,

, where

Exercise II. A. 2.
Different Kinds Of Permutation

• Permutation of Distinct Objects

where

Exercise II. A. 3.
Different Kinds Of Permutation

• Permutation of Identical Things

,

where is total number of objects and , , , …,are numbers of identical

elements.

Exercise II. A. 3.
Different Kinds Of Permutation

• Permutation of Circular Objects

where n is total number of objects.

Exercise II. A. 3.
Solve for:

• a. P(10, 3)

Exercise II. A. 4.
Solve for:

• b. n, given P (n, 2) = 110

Exercise II. A. 4.
In how many ways can 8 books be displayed in a shelf if
the space is enough for 3 at a time?

Exercise II. A. 5.
Find the number of ordered pairs (a, b) of integers such
that .
• Since and are positive integers, then, consider two cases:
Case 1: If a = 0, then b = 0, or b = ± 1,
giving ordered pairs (0, 0), (0, –1), (0, 1).
Case 2: If │a│=1, then a = ± 1 and b = 0 or ± 1,
giving (1, 0 ), (1, 1), (1, –1), ( –1, 0), ( –1, 1), ( –1, –1).
Hence, by the Addition Principle, the total number of
ordered pairs (a, b) satisfying is 3 + 6 = 9.

Exercise II. A. 6.
How many different five-digit numbers can be formed
using the digits in 23672?
• We have a set of 5 digits of which two are alike of a second kind,
two. Then, .

Exercise II. A. 7.
During a book sale, 5 Algebra, 8 Geometry and 6 Calculus books are
available. Find the number of ways that a bargain hunter can buy a set of
three books with 1 Algebra book, 1 Geometry book and 1 Calculus book.

• By the Multiplication Principle, there are 5(8)(6) = 240 possible

ways of buying a set of three books.

Exercise II. A. 8.
Combination

Exercise II. B. 1.
Combination
• A combination of 𝑛 distinct objects taken 𝑟, , at a time is a subset
containing 𝑟 objects of a set that has 𝑛 objects.
• The number of combinations of 𝑛 distinct objects taken 𝑟 𝑟, , at a
time, denoted by 𝐶(𝑛, 𝑟), is

Exercise II. B. 1.
Solve the following:

•=

Exercise II. B. 2.
Solve the following:

Exercise II. B. 2.
Given 5 different points on a circle, how many distinct

Exercise II. B. 3.
A bag contains 9 marbles numbered 1 to 9. If five marbles
are drawn from the bag, how many different sets can be
drawn?

𝟗!
C ( 9, 5 )=
( 𝟗− 𝟓 ) ! 𝟓!
Exercise II. B. 4.
A combination of three balls is picked at random from a
box containing five red, four white and three blue balls. In
how many ways can the set chosen contain at least
• a. one white ball?
C(4,1) ∙ C(8,2) + C(4,2) ∙ C(8,1) + C(4,3) ∙ C(8,0) =
112 + 48 + 4 = 164
• b. one white and one red ball?
C(4,1) ∙ C(5,1) ∙ C(3,1) + C(4,2) ∙ C(5,1) + C(4,1) ∙ C(5,2) =
4 ∙ 5 ∙ 3 + 5 · 6 + 4 · 10 = 130

Exercise II. B. 5.
In how many ways can a person get a bridge hand of 13
cards consisting of only aces or faces?

• Since there are 4 aces and there are 3 ∙ 4 = 12 faces,

C(16,13) = 560

Exercise II. B. 6.
How many committees of 5 can be formed from 8
sophomores and 4 freshmen if each committee is to have at
least 3 sophomores?
• C(8,3)∙C(4,2) + C(8,4)∙C(4,1) + C(8,5) = 336 + 280 + 56
= 672

Exercise II. B. 7.
How many different five-digit numbers can be formed
using the digits in 23672?

• We have a set of 5 digits of which two are alike of a second

kind, two. Then, .

Exercise II. B. 8.
Find the number of positive divisors of 600.

• The prime factorization of 600 = 23 • 3 • 52 , which is of the form

2n • 3m • 5p, where 0 ≤ n ≤ 3, 0 ≤ m ≤ 1, and 0 ≤ p ≤ 2. Thus, by
the Multiplication Principle, the number of possible factors of 600
is the product of the set of all possible exponents of 2, 3, and 5.
So, 4(2)(3) = 24.

Challenge!!! 1.
From 6 Science books and 8 Mathematics books, in how
many can a student choose 2 Science and 3 Math books
and arrange them on the Learning Nook shelf.
• C(6,2) ∙ C(8,3) ∙ P(5,5) = ∙ ∙ 5!
= 15 ∙ 56 ∙ 120 = 960

Challenge!!! 2.
A student can choose a computer project from one of three different lists.
If the thee lists contain 25, 14, and 12 possible projects, respectively, how
many possible projects are there to choose from?

• The student can choose a project from the first list in 25 ways, from
the second list in 14 ways and from the third list in 12 ways. Thus,
by the Addition Principle, there are 25 + 14 + 12 = 51 possible
projects that the student can choose from.

Challenge!!! 3.
A committee of five is to be chosen from a group of 6
boys and 9 girls.
• a. How many different committees can be formed?
C(15, 5) = 3003
• b. How many of these committees are all boys?
C(6, 5) = 6
• c. How many of the committees will be all girls?
C(9, 5) = 126

Challenge!!! 4.
How many different six-letter symbols can be formed from
the letters of the word “PEOPLE” if no conditions are
given?

𝟔!
=𝟏𝟖𝟎
𝟐!𝟐!
Challenge!!! 5.
In how many ways can a 5-item multiple choice test be
answered if there are 4 options, and a student is

• a. allowed to leave an item not answered?

55 = 3125
• b. not allowed to have two consecutive numbers with the
same answer?
4(34) = 324

Challenge!!! 6.
How many ways can 5 people sit at the round table if

• a. there are no restrictions?

(5 – 1)! = 24
• b. two insist on sitting next to each other?
2(4 – 1)! = 12
• c. two refuse to sit next to each other?
12

Challenge!!! 7.
In how many ways can 3 boys and 3 girls be seated in a
row if

• a. the row begins and ends with a boy?

3 • 4! • 2 = 144
• b. all boys and all girls must sit side by side?
3! 3! 2! = 72

Challenge!!! 8.
How many four-digit numbers can be formed from the
digits 0, 1, 2, 3, 4, 5 if
• a. no digit may be repeated in a number?
5 • 5 • 4 • 3 = 300
• b. the numbers are to be even, and no digits are repeated?
Consider 2 cases:
ends in 0: 60
ends in 2 or 4: 96
60 + 96 = 156

Challenge!!! 9.
Determine the number of diagonals of a
convex n-gon.
• A diagonal of an n-gon is a segment connecting two non-adjacent
vertices. The diagonals are all the segments that may be formed
from any two of the vertices, other than the sides. Since there are n
sides of a convex n-gon and there are C(n, 2) segments formed by
any two vertices, then the number of diagonals is C(n, 2) – n .
This is equal to or .

Challenge!!! 10.
Prepared by: Bernard Lucenecio

Writer: Ms. Thelma T. Villaluna