COUNTING PRINCIPLES

GROUP 5
Dar, Dela Fuente, Dimaano, Echano, Encinas, Heraldo, Ibias, Ilan, Yaneza
 Basic Rules of Counting
Inclusion – Exclusion Principle
Pigeonhole Principle
TOPICS Permutations
Combinations
Binomial Theorem

05/02/2022 Counting Principles 2

BASIC RULES OF COUNTING
by Ms. Ibias
SUM RULE (DISJUNCTIVE RULE)

• For two separate tasks A and B.

If A can be done in m ways, and B can be done in n ways,
Then A and B can be done in m + n ways.

05/02/2022 Counting Principles 4

PRODUCT RULE (SEQUENTIAL RULE)

• In subsequent tasks, A and B,

If there are m ways to do task A and n ways to do task B,
Then there are mn ways to do A then B.

05/02/2022 Counting Principles 5

INCLUSION – EXCLUSION PRINCIPLE
by Mr. Echano
PRINCIPLE OF INCLUSION & EXCLUSION (PIE)
• A counting technique that computes the number of elements that satisfy at least
one of several properties while guaranteeing that elements satisfying more than
one property are not counted twice.
• An underlying idea behind PIE is that summing the number of elements that
satisfy at least one of two categories and subtracting the overlap
prevents double counting.

05/02/2022 Counting Principles 7

PRINCIPLE OF INCLUSION & EXCLUSION (PIE)
• For instance, the number of people that have at least one cat or at least one dog
can be found by taking the number of people who own a cat, adding the number
of people that have a dog, then subtracting the number of people who have
both.
• PIE is particularly useful in combinatorics and probability problem solving when
it is necessary to devise a counting method that ensures an object is not
counted twice.

05/02/2022 Counting Principles 8

PRINCIPLE OF INCLUSION & EXCLUSION (PIE)
• As a Venn diagram, PIE for two sets can be depicted easily:

05/02/2022 Counting Principles 9

PRINCIPLE OF INCLUSION & EXCLUSION (PIE)
• If there are three sets, the principle of inclusion and exclusion states.

• We can verify these statements for ourselves by considering the Venn diagram of events:

05/02/2022 Counting Principles 10

PIGEONHOLE PRINCIPLE
by Mr. Dela Fuente & Mr. Ilan
THEOREM 1 (THE PIGEONHOLE PRINCIPLE)
• If n pigeons are assigned to m pigeonholes, m<n, then at least one pigeonhole contains two or
more pigeons.
• This informal and almost trivial sounding theorem is easy to use and has unexpected power in
proving interesting consequences.
• It provides an existence proof; there must be an object or objects with a certain characteristics.
• To use the pigeonhole principle, we must identify pigeons(objects) & pigeonholes (categories of
desired characteristics) & be able to count the number of pigeons & the number of pigeonholes.

05/02/2022 Counting Principles 12

THEOREM 2 (THE EXTENDED PIGEONHOLE PRINCIPLE)
• If there are m pigeonholes & more than 2m pigeons, then three or more pigeons will
have to be assigned to at least one of the pigeonholes. In general, if the number of
pigeons is much larger than the pigeonholes. Theorem 1 can be restated to give a
stronger conclusion.
• If n pigeons are assigned to m pigeonholes, then one of the pigeonholes must contain
at least [(n-1)/m] + 1 pigeons.

05/02/2022 Counting Principles 13

PERMUTATION
by Mr. Heraldo & Mr. Encinas
PERMUTATION
• Factorial Notation – is an exclamation mark (!), n! is read as “n factorial” and it is the
product of the positive integers n and all positive integers less than n.
• Factorials (!) are products of every whole number from 1 to n. In
other words, take the number and multiply through by 1.

For example:
• If n is 3, then 3! is 3 x 2 x 1
• If n is 5, then 5! is 5 x 4 x 3 x 2 x 1
• If n is 0, then 0! Is 1

05/02/2022 Counting Principles 15

PERMUTATION
• Permutations – this refers to the different possible arrangements of a set of objects. The
permutation of n objects taken r at a time.
The formula for Calculating Permutations:

Where:

• n – the total number of elements in a set

• r – the number of things to be selected and then arranged

• ! – factorial

05/02/2022 Counting Principles 16

PERMUTATION
Example:
Find the number 3 letter words that can be formed from the letters a, b, c, d, and e in which the letters should not be
repeated.

Solution:

• The number of letters available is, n = 5.

• The number of letters in each word is, r = 3.

The possible number of words is 60

05/02/2022 Counting Principles 17

PERMUTATION
• Circular Permutation – the different possible arrangements of objects in a circle. The number of
permutations, P, of n objects around a circle is given by P = (n – r)!
Example :

How many ways can 5 girls be seated at a round table?

Solution:
P = (n-1)!
= (5-1)!
= 4!
= 4•3•2•1 = 24
There are 24 ways that 5 girls be seated at a round table.

05/02/2022 Counting Principles 18

PERMUTATION
• Distinguishable Permutation – refers to the permutations of a set of objects where some of them are
alike. The number of distinguishable permutations of n objects when p are alike, q are alike, and so
on is given by P = 𝑛! 𝑝!𝑞!𝑟!

05/02/2022 Counting Principles 19

PERMUTATION
Example:

Find the number of permutations of the letters of the word MATHEMATICS.

Solution:

05/02/2022 Counting Principles 20

COMBINATION
by Mr. Dimaano & Mr. Yaneza
COMBINATION:
• Combinations, unlike permutations, are the number of ways of selecting from a set or
collection of items where the order is not important. It refers to the combination of n things
taken r at a time without repetition. Its formula is:
𝑛!
C(n, r)=
(𝑛−𝑟)!𝑟!

or
𝑃(𝑛,𝑟)
C(n, r) =
𝑟!

05/02/2022 Counting Principles 22

COMBINATION:
Example scenarios where combination is used:
• Selection of menu, food, clothes, subjects, team.
• Picking team members from a group.
• Picking colours from a colour brochure.
• Picking winners.
• Choosing 3 questions to answer 5 questions in a test.
• Selecting 4 people to form a committee for an event.
• Forming triangles from 7 distinct points in which no 3 points are collinear.
• Drawing a set of 6 numbers in a lottery containing numbers 1 to 42.
• Listing the elements of subsets of a given set.

05/02/2022 Counting Principles 23

BINOMIAL THEOREM
by Mr. Dar
BINOMIAL THEOREM
• A binomial is an algebraic expression containing 2 terms.
We sometimes need to expand binomials as follows:
(a + b) 0 = 1
(a + b) 1 = a + b
(a + b) 2 = a 2 + 2ab + b 2
(a + b) 3 = a 3 + 3a 2b + 3ab2 + b 3
(a + b) 4 = a 4 + 4a 3b + 6a 2b 2 + 4ab3 + b 4
(a + b) 5 = a 5 + 5a 4b + 10a 3b 2 + 10a 2b 3 + 5ab4 + b 5

05/02/2022 Counting Principles 25

BINOMIAL THEOREM
Pascal's Triangle
• We note that the coefficients (the numbers in front of each term) follow a pattern. [This was noticed long before Pascal, by
the Chinese.]
1
11
121
1331
14641
1 5 10 10 5 1
1 6 15 20 15 6 1
You can use this pattern to form the coefficients, rather than multiply everything out as we did above.

05/02/2022 Counting Principles 26

BINOMIAL THEOREM
• We use the binomial theorem to help us expand binomials to any given power without direct
multiplication. As we have seen, multiplication can be time-consuming or even not possible in some
cases.
Properties of the Binomial Expansion (a + b) n
• There are n+1 terms.
• The first term is an and the final term is bn.
• Progressing from the first term to the last, the exponent of a decreases by 1 from term to term while
the exponent of b increases by 1. In addition, the sum of the exponents of a and b in each term is n.
• If the coefficient of each term is multiplied by the exponent of a in that term, and the product is
divided by the number of that term, we obtain the coefficient of the next term

05/02/2022 Counting Principles 27

BINOMIAL THEOREM
General formula for (a + b)n There are n+1 terms.
• First, we need the following definition:
Definition: n! represents the product of the first n positive integers i.e.
n! = n(n − 1)(n − 2) ... (3)(2)(1)
We say n! as "n factorial".

05/02/2022 Counting Principles 28

BINOMIAL THEOREM FORMULA
• Based on the binomial properties, the binomial theorem states that the following binomial formula is valid for all
positive integer values of n:

05/02/2022 Counting Principles 29

 THANK YOU!

05/02/2022 Counting Principles 30

References:
• (220) RULE of SUM and RULE of PRODUCT - DISCRETE MATHEMATICS - YouTube
• 21-2-ICS-BSIT-1A-IT104: IT 104 Learning Materials No. 5 (cnsc.edu.ph)
• Permutation and Combination (Definition, Formulas and Examples) (byjus.com)

05/02/2022 Counting Principles 31