Lesson 4

The Basics of
Counting
Prepared by: Jhonel E. Hermoso
Introduction

Combinatorics is the study of arrangements of

objects and is an important part of discrete
mathematics. Combinatorial questions arose in the
study of gambling games and made this subject
fascinating and thus studied by many as long early
as the seventeenth century.
Example

Suppose a subdivision in San

Jose, Occidental Mindoro has
four main gates for vehicles to
go in (enter) and out (exit), in
how many ways can garbage
truck enter and leave the
subdivision?
There are three ways to solve the problem

01 02 03

By enumerating By using table By using a tree

(Listing) diagram
01 By enumerating (Listing)
The different entrance-exit pairs are:

𝐆𝟏 , 𝐆𝟏 ; 𝐆𝟏 , 𝐆𝟐 ; 𝐆𝟏 , 𝐆𝟑 ; 𝐆𝟏 , 𝐆𝟒 ;
𝐆𝟐 , 𝐆𝟏 ; 𝐆𝟐 , 𝐆𝟐 ; 𝐆𝟐 , 𝐆𝟑 ; 𝐆𝟐 , 𝐆𝟒 ;
𝐆𝟑 , 𝐆𝟏 ; 𝐆𝟑 , 𝐆𝟐 ; 𝐆𝟑 , 𝐆𝟑 ; 𝐆𝟑 , 𝐆𝟒 ;
𝐆𝟒 , 𝐆𝟏 ; 𝐆𝟒 , 𝐆𝟐 ; 𝐆𝟒 , 𝐆𝟑 ; 𝐆𝟒 , 𝐆𝟒 ;
Therefore, there are 16 different ways a garbage truck can
enter and leave the subdivision.
02 By using table

Possible Possible Exit Gates

Entry Gates G1 G2 G3 G4
G1 G1,G1 G1,G2 G1,G3 G1,G4
G2 G2,G1 G2,G2 G2,G3 G2,G4
G3 G3,G1 G3,G2 G3,G3 G3,G4
G4 G4,G1 G4,G2 G4,G3 G4,G4

Therefore, there are 16 different ways a garbage truck can

enter and leave the subdivision.
03 By using a tree diagram
Possible
Entry Gates Exit Gates Arrangements
G1 G1,G1
G2 G1,G2
G1 G3 G1,G3
G4 G1,G4 Therefore, there
G1 G2,G1
G2 G2,G2
are 16 different
G2 G3 G2,G3 ways a garbage
G4 G2,G4
G1 G3,G1 truck can enter
G3
G2 G3,G2 and leave the
G3 G3,G3
G4 G3,G4 subdivision.
G1 G4,G1
G2 G4,G2
G4 G3 G4,G3
G4 G4,G4
Using the Basic
Counting Principle
 Addition Principle (Rule of Sum)

The Sum Rule states that if a Sum Rule:

task can be performed in either A task can be performed either
two ways, where the two in n1 ways OR in n2 ways, where
methods cannot be performed the two tasks cannot be
simultaneously, then completing performed simultaneously, then
the job can be done by the sum there are n1 + n2 ways to perform
of the ways to perform the task. the task.
 Addition Principle (Rule of Sum)
Example 1:
Suppose a bakery has a selection
of 20 different cupcakes, 10 Solution:
different donuts, and 15 different Since we have to choose from
muffins. If you are to select a either a cupcake or donut or
tasty treat, how many different muffin, we have 20 + 10 + 15 =
choices of sweets can you choose 45 treats to choose from.
from?
 Addition Principle (Rule of Sum)
Example 2:
A student can choose a computer
project from one of three lists. Solution:
The three lists contain 23, 15, and Because no project is on more
19 possible projects, respectively. than one list, by the sum rule
No project is on more than one there are 23 + 15 + 19 = 57
list. How many possible projects ways to choose a project.
are there to choose from?
 Multiplication Principle (Rule of Product)

The Product Rule states that if a Product Rule:

task can be performed in a A task can be performed either
sequence of tasks, one after the in n1 ways AND in n2 ways, after
other, then completing the job the first task is complete, then
can be done by the product of there are n1 · n2 ways to perform
the ways to perform the task. the task.
 Multiplication Principle (Rule of Product)
Example 1:
Solution:
How many different outfits can Since Mike can choose an outfit
Mike have with 2 pants (white and from 2 pants and 3 shirts and 2
black), 3 shirts (red, green, and pairs of boots, we have 2 × 3 ×
blue), and 2 pairs of boots (purple 2 = 12 possible outfits that he
and yellow)? can wear.
 Multiplication Principle (Rule of Product)
Example 2:
Solution:
The chairs inside OMSC The procedure of labelling a chair
auditorium are to be labelled consists of two tasks, namely, assigning
with an uppercase English to the seat one of the 26 uppercase
letter followed by a positive English letters, and then assigning to it
one of the 50 possible integers. The
integer not exceeding 50.
product rule shows that there are 26 × 50
What is the largest number of
= 1,300 different ways that a chair can
chairs that can be labelled be labelled.
differently?
 At Rey’s Pizza House, you are deciding on what you want for
dinner. The pizza offers 8 different meats, 4 different cheeses,
3 different crust types and 2 different sauces. How many
different pizzas do you have to choose from?

192
 A bag contains five (5) 10-peso coins, two (2) 5-peso coins,
and four (4) 1-peso coins. What is the probability of picking a
5-peso coin?

2/11 or 18.1818%
How many ways can an even number be rolled in a 6-sided
die?

3 ways
How many ways can a face card can be drawn from a standard
52-card deck?

12 ways
How many ways can an even number be rolled in a 6-sided die
or a face card can be drawn from a standard 52-card deck?

15 ways
 Lesson 4

The Pigeonhole
Principle
Topic 2
Let’s observe the figure below.

pigeon > pigeonhole

Pigeonhole Principle

Pigeons can be sometimes Theorem:

referred to “Items” and If k is a positive integer and k+1
pigeonholes can be referred to or more objects are placed into k
“containers.” boxes, then there is at least one
box containing two or more of
the objects.
Pigeonhole Principle
Pigeonhole Principle
Example 1: Solution:
How many students must be in a n = 100;
class to guarantee that at least k+1=2 → k=2–1
two students receive the same → k=1
score on the final exam, if the m = kn + 1 = 1 (100) + 1
exam is graded on a scale from 1 = 100 + 1
to 100 points? m = 101
There are 101 possible scores on the final. The pigeonhole
principle shows that among any 101 students there must be at
least 2 students with the same score.
 Pigeonhole Principle
Example 2: Solution:
What is the minimum number of n = 5;
students required in a mathematics k+1=6 → k=6–1
class to be sure that at least six will → k=5
receive the same grade, if there are m = kn + 1 = 5 (5) + 1
five possible grades 1, 2, 3, 4, and = 25 + 1
5? m = 26
Therefore, 26 is the minimum number of students needed to
ensure that at least six students will receive the same grade.
 Pigeonhole Principle

Theorem 2:
Generalized Pigeonhole
If n objects are placed into k
Principle gives us a guarantee
boxes, then there is at least one
on what can happen in the worst 𝑛
case scenario box containing at least
𝑘
objects.

Example:
75
Among 75 people there are at least = 𝟕 who were
12
born in the same month.
Pigeonhole Principle
Example 2: Solution:
There are 38 different time n = 677; k = 38
periods during which classes at 𝑛 677
a university can be scheduled. = ≈ 17.816 = 𝟏𝟖
𝑘 38
If there are 677 different
classes, what is the minimum There exists a time period will
number of different rooms that have at least 18 classes during
will be needed? it. So 18 different rooms will be
needed.
What is the minimum number of English Words required to be sure
that at least two words will begin with the same letter if the only
letters of the English alphabet will be used?

27 words to ensure that at least two words

begin with the same letter.
Find the minimum number of students in a class that at least three of
them are born in the same month.

25 is the minimum number of students needed to ensure

that at least three of them share the same birth month.
Factorial
Factorial (!)

Factorial is the product of positive numbers, each number is one

less than the preceding number.

Factorial n is denoted by n! and is universally defined as

𝒏! = 𝒏 × 𝒏 − 𝟏 × 𝒏 − 𝟐 × 𝒏 − 𝟑 × ⋯ 𝟑 × 𝟐 × 𝟏
 Factorial (!)
The factorial of a natural number only uses the operation of
multiplication across the sequence of natural numbers.

For example, what is the factorial of 6?

6! = 6 × 5 × 4 × 3 × 2 × 1
= 720

What is 0!?
0! = 1
 Lesson 4

Permutation
Topic 3
Permutation (P)
Permutation refers to the arrangement of objects with reference to
order. It is used to determine the number of ways a sample population
can be arranged.

Universally, if given a set with n objects, then we can take r objects

from the set. The total number of permutations of n distinct objects
taken r at a time is represented by the notation nPr or P(n,r) and can be
evaluated using the formula. The notation nPr or P(n,r) is read as “the
number of permutations of n objects taken r at a time.”
 There are four types of Permutation
01 03

Permutations Permutations
with Repetition with Multi-Sets
02 04

Permutations Circular
without Repetition Permutations
01 Permutations with Repetition
We can easily calculate the permutation with repetition. The
permutation with repetition of objects can be written using the
exponent form.

𝒏 × 𝒏 × 𝒏 … 𝒓 times = 𝒏𝒓
This is the permutation formula to compute the number of
permutations feasible for the choice of “𝒓” items from the
“𝒏” objects when repetition is allowed.
01 Permutations with Repetition

For example: How many 3 letter words with or without meaning can
be formed out of the letters of the word SMOKE when
repetition of words is allowed?

𝒏 = 𝟓; 𝒓 = 𝟑 𝒏𝒓 = 𝟓𝟑 = 𝟏𝟐𝟓

Therefore, there 125 3-letter words with or without meaning

can be formed out of the letters of the word SMOKE.
02 Permutations without Repetition
If 𝒏 is a positive integer and 𝒓 is a whole number, such that 𝑟 < 𝑛,
then 𝑷(𝑛, 𝑟) represents the number of all possible arrangements or
permutations of 𝒏 distinct objects taken 𝒓 at a time. In the case of
permutation without repetition, the number of available choices will
be reduced each time. It can also be represented as: 𝑛𝑷𝑟.

𝒏!
𝑷 𝒏, 𝒓 =
𝒏−𝒓 !
02 Permutations without Repetition
For example: How many different ways can a Governor and Vice-
governor be arranged for political party if there are 5
eligible members from party to run for the said positions?
𝒏 = 𝟓; 𝒏! 𝟓! 𝟓!
𝒓=𝟐 𝑷 𝒏, 𝒓 = = =
𝒏−𝒓 ! 𝟓 − 𝟐 ! 𝟑!
𝟓 × 𝟒 × 𝟑!
= =𝟓×𝟒
𝟑!
= 𝟐𝟎 𝐰𝐚𝐲𝐬
03 Permutations with Multi-Sets
Permutation of 𝒏 different objects when 𝒓𝟏 objects among ‘𝒏’ objects
are similar, 𝒓𝟐 objects of the second kind are similar, 𝒓𝟑 objects of
the third kind are similar ……… and so on, 𝒓𝒌 objects of the 𝒌𝒕𝒉 kind
are similar and the remaining of all are of a different kind.

𝒏!
𝑷=
𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! … 𝒓𝒌 !
This is also called “Distinguishable Permutations.”
03 Permutations with Multi-Sets
For example: How many different permutations can be made from
the word “MISSISSIPPI”?

𝒏 = 𝟏𝟏; 𝒏! 𝟏𝟏!
𝑷= =
𝒓𝟏 (𝑰) = 𝟒 𝒓𝟏 ! 𝒓𝟐 ! 𝒓𝟑 ! 𝟒! 𝟒! 𝟐!
𝒓𝟐 𝑺 = 𝟒 𝟏𝟏 × 𝟏𝟎 × 𝟗 × 𝟖 × 𝟕 × 𝟔 × 𝟓 × 𝟒!
𝒓𝟑 (𝑷) = 𝟐 =
𝟒! 𝟒! 𝟐!
= 𝟑𝟒, 𝟔𝟓𝟎
04 Circular Permutation
A circular permutation is the number of arrangements of items in a
circle when the order of items matters. Often, rotations are not
considered to be different outcomes. This is also called “Circular
Permutations”.

𝑷= 𝒏−𝟏 !
04 Circular Permutation

For example: In how many ways can seven family members be

seated around a circular family dining table?

𝒏=𝟕 𝑷 = 𝒏 − 𝟏 ! = 𝟕 − 𝟏 ! = 𝟔!
=𝟔×𝟓×𝟒×𝟑×𝟐×𝟏
= 𝟕𝟐𝟎
Therefore, there 720 possible seating arrangements.
05 Permutations Formula Taken All at
a Time
The number of ways of arranging 𝒏 different things among
themselves is nothing but arranging 𝒏 things out of 𝒏 things and is
given by:
𝒏! 𝒏! 𝒏!
𝒏𝑷𝒏 = = =
𝒏−𝒏 ! 𝟎! 𝟏!
𝒏𝑷𝒏 = 𝒏!
05 Permutations Formula Taken All at
a Time
For example: How many different light signals can be made using
four torches of different beam colors if all the torches
must be used in each signal?

𝒏=𝟒 𝒏𝑷𝒏 = 𝒏! = 𝟒!
=𝟒×𝟑×𝟐×𝟏
= 𝟐𝟒 different light signals.