CHAPTER 5

COUNTING TECHNIQUES

If one has to make a prediction regarding the

outcome of a certain activity, then the possible
outcomes requires the knowledge of counting. In
counting, the simplest method is done by
enumerating all the possible outcomes. This
method, however, is too laborious and hence,
most an efficient method. In this chapter, we
shall consider the most commonly used methods
of counting- the fundamental principle of
counting, permutation and combination.

FUNDAMENTAL PRINCIPLE OF
COUNTING

Consider the numbers 1, 2, 3, and

4. Suppose we want to determine
the total two- digit number that
can be formed if these numbers
are combined.

First, let us assume that no digit is to be repeated.

Thus the possible two- digit numbers that can be
enumerated as follows:
12 21 31 41
13 23 32 42
14 24 34 43
Notice that we are able to exhaust all the
possibilities through enumeration. In this example,
we have 12 possible two- digit numbers.

Repetition is allowed:
11 12 13 14
21 22 23 24
31 32 33 34
41 42 43 44
Hence, we have 16 possible outcomes.
If the first activity can be done in n1 ways
and after it has been done, the second
activity can be done in n2 ways, then the
total number of ways in which activities
can be done is equal to n1 x n2.

Example 1:
How many two- digit numbers can be formed from
the numbers 1, 2, 3, 4 if
a. repetition is not allowed
b. repetition is allowed?
a. n1 x n2

=4x3

12 ways

b. n1 x n2 = 4 x 4

16 ways

Example 2:
How many three- digit numbers can be formed from
the digits 1, 2, 3, 4, 5 if any of the digits can be
repeated?
n1 =number of ways of filling the
hundreds
place
n2 =number of ways of filling the tens
place
n3 =number of ways of filling the unit
place
n1 x n2 x n3 =
5 x 5 x 5 = 125 ways

Example 3:
Consider the numbers 2, 3, 5, and 7. If repetition is not
allowed, how many three- digit numbers can be formed such
that
a. they are all odds?
b. they are all even?
c. they are greater than 500?
n1 = be the number of ways of filling the hundreds place.
n2 = number of ways of filling the tens place
n3 = numbers of ways of filling the unit
place

n1 x n2 x n3 =

2 x 3 x 3 = 18 ways

To verify, the required numbers are:

235
325
573

237
327
537

253
357
723

257
375
725

273
523
735

275
527
753

n1 x n2 x n3 =

2x3x1=

6 ways

To verify, the required numbers are:

352
372

532
572

732
752

n1 x n2 x n3 =

2 x 3 x 2 = 12 ways

To verify, the required numbers are:

523
735

572
532

732
723

527
752

573
537

753
725

PERMUTATION
The term permutation refers to the
arrangement of objects with reference
to order. Given a set with n objects,
then we can take r objects from the
set. The total number of permutation
of n objects taken r at a time is
represented by the notation nPr and
can evaluated using the formula:

PERMUTATION
nPr =_ n!__
(n r)!
where n! is read as n factorial
The factorial of any integer n
denoted by n! is defined as follows:
n! = n x (n-1) x (n-2) x (n-3) x x 3 x 2 x 1

Example 1
Evaluate the following:
a. 5!
b. 7!
c. 10!

Example 2:
Evaluate the value of the
following:
a. 10P5
b. 5P3 + 5P4 + 5P5
c. 4 ( 8P4)

Solution:
a.

10P5 = __10!__
( 10 5 )!
= 10!
5!
= 30, 240

The sum of the three terms, therefore

shall be
=
60 + 120 + 120
5P3 + 5P4 + 5P5
=
c. 4( 8P4)

=4x

_8!_

(8-4)!
= 4 x 1680
= 6720

300

Example 3
In how many ways can a
president, a vice president, a
secretary, and a treasurer be
elected from a class with 39
students

P =

39 4

Example 4
In how many ways can 8
individuals be seated in a row of
8 chairs?

P =

8 8

Example 5
In how many ways can 8 individuals be
seated in a row of 8 seats if two
individuals wanted to be seated side
by side?

P*P =

7 7 2 2

PERMUTATIONS WITH THINGS

THAT ARE ALIKE
The number of permutations of n objects taken
altogether, where r1 are if one kind and r2
are of the other kind, and so on is given by:
nPn = ____n!___
r1! x r2!...r3!

Example 1:

Determine the number of permutations that

can be formed using letters of the word
DADDY.
Solution:
the value of n is 5. We let r1 be the number Ds, r2 be the
umber of As and r3 be the number o Ys. Hence, we can
say that
5P5

r1 = 3
r2 = 1
r3 = 1
60

= ____5!___
3! x1! x 1!
= 120
= 20

Example 2:

Find the total 7-digit numbers that

can be formed using all the digits in
the following numerals 5771535

P =

7 7

CIRCULAR PERMUTATION

If n distinct objects are arranged in a circle,

then the arrangement is known as circular
permutation. The number of circular
permutations of n objects taken altogether is
n-1Pn-1 = (n 1)!

Example 1:

In how many ways can 6 individuals be

seated in a round table with 6 chairs?
Solution:
This is circular permutation problem. The value of n = 6
6-1P6-1

= ( 6-1)!

= 5!
= 120 ways

Example 2:
In how many ways can 6 persons be seated
around a table with 6 chairs if two individuals
wanted to be seated side by side?
Solution:
We first consider the two individuals who wanted to be seated
side by side as one person, thus making n = 5. The number of
circular permutations of these 5 individuals is ( 5- 1)! = 24
Then we consider the permutation of the two persons treated
as one. We have 2P2 = 2!= 2. hence, by the fundamental principle of
counting, we have

24 x 2 = 48 ways

COMBINATION
The computing formula for the combination
of n objects taken r at a time given by
nCr = ____n!___
( n r ) ! r!

Example 1:
In how many ways can a committee of 3 members be
chosen from a group with 6 members?
Solution:
Grouping in terms of committees is treated as
a combination problem since only one position is being
filled, that is, committee membership. Thus we have
a situation of having 6 objects taken 3 at a time.
6

C3 = ___6!___
( 6-3)! 3!
= _6!_ =
3! 3!

20 ways

Example 2:

A class consist of 5 boys and 7 girls.

a. in how many ways can the class elect
the
president, the vice president and
the
secretary?
b. in how many ways can the class elect 3
members
of a certain committee
Solution:
a. Election of the president, vice president, and the
secretary means filling three distinct
positions.
Thus,
we can say that this is a permutation
problem.

Hence,

P =

12 3

__12!
(12 3 ) !

= 1, 320 ways

b. Choosing members of a committee implies filling

only one position and therefore, a combination
problem.

C3 = ____12!___

12

(12! 3!) ! 3!
= 220 ways

Example 3:

In how many ways can a student

answer 5 out 8 questions if he is
required to answer 3 of the first 4
questions?

C3*4C2 =

Example 4:

A box contains 7 red and 6

green balls. In how many
ways can 2 balls be drawn
such that
a.They are both green?
b. 1 is red and 1 is green?

a.

C2*7C0 =

b.

C1*6C1 =

Thank you for listening