THE FUNDAMENTAL

COUNTING
PRINCIPLE
Topic 4.2
 COMPETENCIES
1. Use the Fundamental Counting Principle and Formula
to count the permutations:
a) of n distinct objects taken r at a time arranged in
a line/row
b) of n objects where some are alike arranged in a
line/row (distinguishable permutations)
c) of n distinct objects arranged in a circular manner
(circular permutations)
2. Use the Fundamental Counting Principle and Formula
to count the combinations of distinct objects taken r at
a time.
 PRE-TEST
Directions: Solve and provide the solutions on a one
whole sheet of paper the given problems.
1.He has 3 pairs of pants, 2 shirts, and 2 hats, how
many different ways can he dress?
2.The ice cream shop offers 20 flavors, 8 syrups, and
6 toppings, how many flavor combinations can you
try?
3.There are 7 daily newspapers and 4 weekly
magazines published in town,how many ways can
you read both?
4.How many dates can you make within 10 years?
5.A restaurant has 5 appetizers, 8 beverages, 9
entrees, and 6 desserts, how many meals can you
arrange?
 PRE-TEST
1.A store sells 3 flowers, 6 trowels, 8 pots, and 4
gloves. How many different items of each can you
buy?
2.Choosing from 8 car models, 5 exterior paint colors,
and 2 interior colors, how many combinations can
you make?
3.How many pairs can you make with 1 consonant and
1 vowel?
4.There are 6 children in a classroom and 6 benches
for them to sit, how many ways can they be seated
in the classroom?
5.From one of 3 processor speeds, 2 sizes of memory,
and 4 sizes of hard drive, how many choices can you
make?
 DISCUSSION
The Fundamental Counting Principle states that if there
are m ways to do one thing and n ways to do another,
then there are m×n ways to do both.
This principle extends to any number of independent
events.​To count the permutations of n distinct objects
taken r at a time, arranged in a line or row, we use the
formula for permutations:
 DISCUSSION
where:
• n is the total number of distinct objects.
• r is the number of objects selected and arranged.
• n! (n factorial) is the product of all positive integers
from 1 to n:
• (n−r)! is similarly the factorial of (n-r).

We have n choices for the first position in the

Example:
Let's say we have 5 distinct objects (A, B, C, D, E) and
we want to arrange 3 of them in a row.
Using the formula:
 DISCUSSION
When dealing with permutations of n objects where
some are alike, the formula changes because the
identical objects are indistinguishable when arranged.
We can't simply use the formula for permutations of
distinct objects.
Let's say we have n objects in total, with n1​identical
objects of type 1, n2​identical objects of type 2, ..., n​k
identical objects of type k, where n1​+n2​+...+nk​=n.
The formula for the number of distinguishable
permutations is:
 DISCUSSION
The numerator, n!, represents the number of
permutations if all objects were distinct. However, since
some objects are identical, we must divide by the
factorial of the number of each type of identical object
to account for the overcounting. This is because
swapping two identical objects doesn't create a new
distinguishable arrangement.
Example:
Suppose we have the letters: A, A, B, B, B, C.
Here, we have a total of n = 6 objects. We have:
• (two A's)
• (three B's)
• (one C)
 DISCUSSION
The Fundamental Counting Principle still applies to
circular permutations, but the formula changes because
the starting point of a circular arrangement is at
random. Rotating a circular arrangement doesn't create
a new, distinct permutation.
Therefore, the formula for circular permutations of n
distinct objects is:

Where:
• n is the total number of distinct objects
 DISCUSSION
Example:
Consider arranging 4 distinct objects (A, B, C, D) in a
circle.
 DISCUSSION
The Fundamental Counting Principle still applies to
combinations, but the formula changes because we're
no longer concerned with the order of the objects. A
combination is a selection of objects where the order
doesn't matter.
 DISCUSSION
Where:
• n! represents the number of ways to arrange all n
objects if order mattered (permutations).
• r! represents the number of ways to arrange the r
objects selected (permutations of the selected
group).
• (n-r)! represents the number of ways to arrange the
remaining objects not selected (permutations of the
unselected group).
We divide the total number of permutations (n!) by the
number of permutations of the selected group (r!) and
the number of permutations of the unselected group
((n-r)!) to account for the fact that order doesn't matter
in combinations.
 DISCUSSION
Example:
Let's say we have 5 distinct objects (A, B, C, D, E) and
we want to choose 3 of them.
Using the formula:
 POST-TEST
1.A men’s department store sells 3 different suit
jackets, 6 different shirts, 8 different ties, and 4
different pairs of pants. How many different suits
consisting of a jacket, shirt, tie, and pants are
possible?
2.A single die is rolled. How many ways can you roll a
number less than 3, then an even, and then an odd?
3.A single die is rolled. How many ways can you roll a
number that is prime, followed by a 6?
4.A red die and a blue die are rolled – in how many
ways can you get a sum of 6?
5.You have 5 runners on a relay team. How many
different ways can you order them for the race?
6.How many even 3-digit positive integers can be
written using the digits 1, 2, 4, 7, and 8?
 POST-TEST
1.How many odd 2-digit positive integers greater than
20 are there?
2.How many ways are there to write a 3-digit positive
integer using the digits 1, 3, 5, 7, and 9 if no digit is
used more than once?
3.A basket contains 8 apples, 5 oranges, and 3 pears.
How many ways can you choose 4 fruits if you must
choose at least one of each type?
4.An ice cream shop offers 10 flavors. You want to
choose 3 scoops. How many different combinations
of flavors can you choose?
QUESTIONS?