Review of Pre-requisite Concept:

For a main dish, you can choose steak or chicken;

your side dish can be rice or potatoes;
and your drink can be tea or water.
Determine the number of possible meals if you have
just one of each.

steak
8 possible
meals

chicken
A sandwich can be made with 3 different types
of bread, 5 different meats, and 2 types of
cheese.
How many types of sandwiches can be made if
each sandwich consist of one bread, one meat ,
and one cheese.

There are 30 possible types of sandwiches.

Sometimes there are too many possible
outcomes to make a tree diagram or a
list.

The Fundamental Counting Principle

is one method of finding the number
of possible outcomes
 Objectives:
apply fundamental counting
principle
• Solve problems involving
Permutations
Combinations
Fundamental Counting Principle
Fundamental Counting Principle
is the guiding rule that can be used to
determine the number of ways
(possible outcomes) when there are two or
more characteristics .
 For a college interview, Robert has to
choose what to wear from the following:
4 slacks, 3 shirts, 2 shoes and 5 ties.
How many possible outfits does he have to
choose from?

4*3*2*5 = 120 outfits

My fruit salad contains grapes, pineapples,
strawberries, and blueberries.

• Does it matter what order I place the

ingredients in the bowl?
• It is a Combination
• The order that you put the fruit in the fruit
salad does not matter.
• So grapes, pineapple, strawberries,
blueberries is the same as blueberries,
strawberries, pineapple, grapes.
My locker combination
is 23-5-17.

• Does it matter what order I turn the

numbers?
• Another set of numbers in a different
order will not open your locker
• so the order DOES matter.
• So 23- 5 - 17 is very different from
23 - 17 - 5 or any other set of these
3 numbers.
• It is a permutation.
 What is a
Permutation?
 A Permutation is an arrangement of
distinct objects in a particular order.
ORDER MATTERS!
Permutation Notations
If repetition of objects are permitted, then
you can also use the Fundamental
Counting Principle.
__ , __ , __ , __ , __
How many permutations of 4 letters are there,
chosen from the twenty six letters of the
alphabet?
By formula
n = 26, r = 4

By FCP – make 4 slots

Letter • Letter • letter • letter

26 • 26 • 26 • 26
You are making a password for your computer.
You will use 2 letters and followed by a 1 digit
number, repeats are allowed.

You have different categories:

• Letter • Letter • Number
26 • 26 • 10
= 6760 possible outcomes
TWO TYPES OF PERMUTATION ( continuation)

0!=1
 Evaluating Expressions Containing Factorials

Evaluate each expression.

A. 9!

9 • 8 • 7 • 6 • 5 • 4 • 3 • 2 • 1 = 362,880

B. 8!
6!
8 •7 • 6 • 5 • 4 • 3 • 2 • 1 Write out each factorial
6•5•4•3•2•1 and simplify.
8 • 7 = 56 Multiply remaining factors.
 Finding Permutations

Jim has 6 different books.

Find the number of orders in which the
6 books can be arranged on a shelf.

The number of books is 6.

6!
6P6 = (6 – 6)!
= 6! = 6 • 5 • 4 • 3 • 2 • 1 = 720
0! 1
The books are arranged 6
at a time.
There are 720 permutations. This means there are 720
orders in which the 6 books can be arranged on the
shelf.
 n!
p 
n r ( n  r )! where 0  r  n .
2nd DAY
Does order matter?
In how many ways can you choose 5 out of
10 friends to invite to a dinner party?

How many ways can you arrange 10 books

on a bookshelf that has space for only 5
books?

A certain state lottery consists of selecting a

set of 6 numbers randomly from a set of 49
numbers. To win the lottery, you must select
the correct set of six numbers. How many
possible lottery tickets are there?
A Combination is an arrangement of items in
which order does not matter.

A Permutation is an arrangement of
distinct objects in a particular order.
ORDER MATTERS!
Fundamental Counting Principle
Fundamental Counting Principle
is the guiding rule that can be used to
determine the number of ways
(possible outcomes) when there are two or
more characteristics .
 The Number of Permutations of n
elements
 The Number of Permutations of n
elements taken r at a time is
denoted by
There are four candidates for a job. The members of
the search committee will rank the four candidates
from strongest to weakest. How many different
outcomes are possible?

By FPC - 4. 3. 2. 1 = 24
Strongest candidate - 4 options
second strongest candidate - 3 options
third strongest candidate - 2 options
Weakest candidate – 1 option

A shorter way to get this answer is to recognize that

the problem is asking to find the number of ways to
arrange four people.
The number of ways to arrange 4 things is 4!
How many ways can 5 people sit on a park
bench if the bench can only seat 3 people?

• By FPC: Think of the bench as three slots

___ ___ ___
• There are five people that can sit in the first slot,
leaving four remaining people to sit in the second
position and finally 3 people eligible for the third
slot.
• Thus, there are 5(4)(3)= 60 ways the people can
sit.
The answer could have been found using the
permutations formula: since we are finding the
number of ways of arranging 5 objects taken 3

P3 ).
at a time ( 5

5! 5!
5 p3    5 * 4 * 3  60
(5  3)! 2!
You are creating a password with 4 digits.
Determine how many possible arrangements are
there if repetition of digits is not permitted.

By FPC
Number • Number • Number • Number
10 • 9 • 8 • 7 = 5 040
By Formula

10 P4
If P(n, 4)=5040, then n=_____
 TIME CHECK!

It’s Time to practice!!!

How many different pairs of letters from
the English alphabet are possible?
26  26 = 676

How many ways can 7 students finish

a race in 1st , 2nd, and 3rd place?

210 outcomes
There are 8 hot air balloons in a race. In
how many possible orders can all 8 hot air
balloons finish the race?

40,320

A group of 12 people are forming a

committee. How many different 4-person
committees can be formed?

Not a permutation
A combination lock will open when the right choice
of three numbers (from 1 to 30, inclusive) is
selected. How many different lock combinations is
possible assuming no number is repeated?

30! 30!
30 p3    30 * 29 * 28  24360
( 30  3)! 27!
A computer password is consist of 2 lowercase
letters and followed by 4 digits. Determine how
many passwords are possible if repetition of letters
and digits are not permitted.

You have different categories:

Letter • Letter • Number • Number • Number • Number
26 • 25 • 10 • 9 • 8 •7

= 3 276 000 possible passwords

A computer password is consist of 2 lowercase
letters and followed by 4 digits. Determine how
many passwords are possible if repetition of letters
and digits are allowed.

You have different categories:

Letter • Letter • Number • Number • Number • Number
26 • 26 • 10 • 10 • 10 • 10

= 6 760 000 possible passwords

You are to make a 6 characters computer password.
The first letter must be a vowel first digit cannot be
a 0.
Determine how many passwords are possible if
repetition of letters and digits are NOT permitted.

You have different categories:

Vowel • Letter • Number • Number • Number • Number
5 • 25 • 9 • 9 • 8 •7

= 567 000 possible passwords

James, Nadine, Sue, Daniel and Paulo are waiting in line
to buy concert tickets.
Determine how many ways can they line up in a line?
since each person can only occupy one space , therefore , repetition is
NOT permitted.
There are 5 possible choices for which person stands in the first position.
For each these 5 possibilities, there are 4 possible choices left for who is
in the next position . For each of these 4 possible choices , there are 3
possible choices left for the next position and so on.

5 • 4 • 3 • 2 • 1
= 120 ways
James, Nadine, Sue, Daniel and Paulo are waiting
in line to buy concert tickets
Determine the number of ways they can line up
in a line if Sue insists being in the middle.

since Sue’s position is already determined

Sue
4 • 3 • 1 • 2 • 1

= 24 ways
James, Sue, Daniel , Nadine and Paulo are
waiting in line to buy concert tickets
Determine the number of ways they can line up
in a line if Paulo insists being in the first and
James has to be the last.

since Paulo and James’s position are already

determined
Paulo James
1 • 3 • 2 • 1 • 1

= 6 ways
Suppose we wish to arrange James, Sue, Daniel ,
Nadine and Paulo standing side by side for a groupie
picture. How many such distinct pictures are
possible?

There are 5 possible choices for which person stands

in the first position. For each these 5 possibilities,
there are 4 possible choices left for who is in the next
position . For each of these 4 possible choices , there
are 3 possible choices left for the next position and so
on.
5 • 4 • 3 • 2 • 1 = 5! = 120

FCP 5 factorial
If P( 9, r) = 3024, what is r ?
3rd DAY
Find the number of permutations of the letters of the
word DEER.
 Suppose these letters are distinct, then the number of
permutation is P (4, 4) = 4! = 24 ways
In the word DEER, there are 2 letters are alike .
 When the E’s are interchanged , the result is the same
word
 There are two ways ( 2!) of arranging E’s in a word

So out of 24 arrangements, the number of

distinguishable permutations is 12.
 Distinguishable Permutations

 divide the number of permutation of distinct

elements by the number of permutation of those
elements that are not distinct.
 to eliminate the duplicates
• In how many distinguishable ways can the
letters in BANANA be written?

• Solution:
• This word has six letters, of which three
are A’s, two are N’s, and one is a B. So, the
number of distinguishable ways in which
the letters can be written is

= 60
Find the number of distinguishable
permutations of the letters in the word
MISSISSIPPI

 Here are the frequencies of the letters. M=1,

I=4, S=4, P=2 for a total of 11 letters.

 P = 11! / ( 1! * 4! * 4! * 2! )
= 11! / ( 1 * 24 * 24 * 2 ) = 34,650.

 there are 34,650 distinguishable permutations

in the word MISSISSIPPI.
If we have a collection of ten balls, each a
different color, then the number of
permutations of these balls is
 P (10, 10) = 10!
If all ten balls are red, then the number of
distinguishable permutations would be
one distinguishable permutation
Because all the ways of ordering these
balls look exactly the same.
Find the number of different ways of placing
15 balls in a row given that 4 are red, 3 are
yellow, 6 are black, and 2 are blue.
• Fourteen construction workers are to be
assigned to three different tasks.

– Seven workers are needed for mixing cement,

five for laying brick, and
two for carrying the bricks to the brick layers.

– In how many different ways can the workers

be assigned to these tasks?
A student has a jumble puzzle app. He is trying to
identify a common word that has been scrambled
as LOUVME. How many 6- letter permutation of
LOUVME can be created?
DAY 2
Find n.

nPr = 60 , r =3 ( substitute)

60 = n(n-1)(n-2)
60 = 5(5-1)(5-2)
60 = 5(4)(3)
Which word has the greater number of
permutations of all its letters?

BID or BIB
How many different 5-digit street addresses
can have the digits 4, 7, 3, 4 and 8?

60

Three hardcover books and 5 paperbacks are

placed on a shelf. How many ways can the
books be arranged if all the hardcover books
must be together and all the paperbacks must
be together ?
56
There are 8 cans of soup on a shelf. Three of
the cans contain tomato soup and the other
5 cans are all different. How many ways can the
can be arranged in a row?
 In a function room , four people are seated at a
round table to play a game of cards

 If we seat the four people on chairs in on a straight

line they can be seated in ( n! = 4! = 24 ways)

Circular PERMUTATIONS
In circular arrangement
 in each table, each person moves his position by one place
clockwise or counterclockwise the persons on the left and
on the right of each person are still the same persons.
 So therefore , the relative positions does not changed
 In effect, the four linear permutations ABCD,BCDA,CDAB,
and DABC are just a single permutation:
 This means that the number of linear permutations of 4
persons is four times its number of circular permutations
 the number of linear permutations of 4 persons is four
times its number of circular permutations

.
 Therefore , the number of linear permutations is
x times its number of rotations

 we should get the circular

permutation

If n objects are arranged in a circle then there are

(n-1)! permutations of the n objects around the
circle.
1. Mr. William is at a picnic that has a circular
revolving condiment server. Six condiments are
placed on the table. How many ways can the
condiments be arranged?
 circular permutation
 ( n-1)! = 5! = 120 ways
Find the number of ways in which 5 people A,B,C,D,E
can be seated at a round table, such that A and B
must always sit together.
Solution:
 If we wish to seat A and B together in all arrangements, we
can consider these two as one unit, along with 3 others.
 the number of ways is (4 – 1)! or 6.

But in each of these arrangements, A and B can themselves interchange places

in 2 ways.
12 ways
In how many ways can 3 men and 3 ladies
be seated at around table such that no two
men are seated together?
Solution
Since we don’t want the men to be seated together, the only way to do this is
to make the men and women sit alternately.
 We’ll first seat the 3 women, on alternate seats, which can be done in
 (3 – 1)! or 2 ways,
 if each of the women is shifted by a
seat in any direction, the seating arrangement
remains exactly the same.
 the 3 men can be seated in the remaining seats in
3! or 6 ways.
 the arrangement on the remaining seats is
equivalent to a linear arrangement.
 Therefore the total number of ways in this
case will be 2! X 3! = 12.
TIME TO PRACTICE!

Determine the number of arrangements for

each situation.
1. 9 keys on a key ring with no chain
2. 5 charms on a bracelet with no clasp
3. 6 people seated at a round table with
one person seated next to a door
4. At a dinner party 6 men and 6 women sit
at a round table. In how many ways can
they sit
a) without restriction?
b) men and women alternate.
TIME TO PRACTICE!

At a dinner party 6 men and 6 women sit at

a round table. In how many ways can they
sit
a) without restriction?
b) men and women alternate.
c) Ted and Carol must sit together
d) Bob, Ted and Carol must sit together
 1. Mr. William is at a picnic that has a circular
revolving condiment server. Six condiments are
placed on the table. How many ways can the
condiments be arranged?
 circular permutation
 ( n-1)! = 5! = 120 ways

2. Eleven people are to be seated at a round table

where one person is seated closest to the exit.
How many possible arrangements of people
relative to the exit are possible?
 Circular Permutation with a Fixed/Reference
Point

Ex.1. Seating around a round table with one person

next to a computer

2. Eleven people are to be seated at a round table

where one person is seated closest to the exit.
How many possible arrangements of people
relative to the exit are possible?

the arrangements relative

to the exit door
 Circular Permutation with reflective arrangement
 If the circular permutation looks the same when it is turned
over, such as a plain key ring, the second arrangement appears.
 Thus there is really only one arrangement of the keys.
 These two arrangements are reflections of one another.
 There are only half as many arrangements when reflections are
possible.
 Thus the number of permutations must be divided by two.

How many different ways can 5 keys be arranged in

a key ring?
- Circular permutation, bracelet can be turned over
- It also reflective

12
CIRCULAR PERMUTATIONS
The circular permutations of n objects refers
to the arrangements of the objects when
arranged in a circle.

Cases are:
1. How many different ways can 5 charms be
placed on a bracelet that has no clasp?

- Circular permutation, bracelet can be turned over

- It also reflective

12
2. Howmany different ways can 5 charms be
placed on a bracelet that has a clasp?
(12-1)! = 11! = 39 916 800
 Ex 17:
• How many 9 letter patterns can be formed from the letters of
the word
ISOSCELES

• How many eleven letter patterns can be formed from the

letters of the word REPETITION
 Permutation With Repetition and Circular
Permutations
• Circular Permutations:
• No beginning or end..... : (n-1)! Children on a Merry-
Go-Round
• Fixed point of reference.....considered Linear : n!
Seating around a round table with one person next to a computer
• If the circular permutation looks the same when it
is turned over, such as a plain key ring, then the
number of permutations must be divided by two.
 Permutation With Repetition and
Circular Permutations
• During an activity at school, 10 children are asked to sit in a
circle
• Is the arrangement of children a linear or circular permutation? Explain.

• arrangement is a circular permutation since the children sit in a circle and there is
no reference point.
• There are ten children so the number of arrangements can
be described by (10 - 1)! or 9!

9! = 9  8  7  6  5  4  3  2  1 or 362,880
How many ways can a student government
select a president, vice president, secretary,
and treasurer from a group of 6 people?

How many ways can a stylist arrange 5

of 8 vases from left to right in a store
display?
Awards are given out at a costume party. How
many ways can “most creative,” “silliest,” and
“best” costume be awarded to 8 contestants if
no one gets more than one award?
1. How many different committees of 5 people can be
chosen from 10 people?
2. How many permutations of 3 different digits are there,
chosen from the ten digits 0 to 9 inclusive?

3. A password consists of two letters of the alphabet followed by

three digits chosen from 0 to 9. If repetitions are allowed, how
many different possible passwords are there?

4. An encyclopedia has eight volumes. In how many ways can the

eight volumes be replaced on the shelf?

5. A special type of password consists of four different letters of the

alphabet, where each letter is used only once. How many different
possible passwords are there?
 Combinations
A Combination is an arrangement
of items in which order does not
matter.
ORDER DOES NOT MATTER!
Since the order does not matter in
combinations, there are fewer combinations
than permutations. The combinations are a
"subset" of the permutations.
 Combinations

To find the number of Combinations of

n items chosen r at a time, you can use
the formula
n!
C  where 0  r  n .
n r r! ( n  r )!
 Combinations
To find the number of Combinations of
n items chosen r at a time, you can use
the formula n!
C  where 0  r  n .
n r r! ( n  r )!
5! 5!
5 C3   
3! (5  3)! 3!2!
5 * 4 * 3 * 2 * 1 5 * 4 20
   10
3 * 2 * 1* 2 * 1 2 *1 2
 Combinations
Practice:

To play a particular card game, each

player is dealt five cards from a
standard deck of 52 cards. How
many different hands are possible?

Answer Now
 Combinations
Practice: To play a particular card game, each
player is dealt five cards from a
standard deck of 52 cards. How
many different hands are possible?
52! 52!
52 C5   
5! (52  5)! 5!47!
52 * 51 * 50 * 49 * 48
 2,598,960
5* 4* 3* 2*1
 Combinations
Practice:

A student must answer 3 out of 5

essay questions on a test. In how
many different ways can the
student select the questions?

Answer Now
 Combinations
Practice: A student must answer 3 out of 5
essay questions on a test. In how
many different ways can the
student select the questions?

5! 5! 5 * 4
5 C3     10
3! (5  3)! 3!2! 2 * 1
 Combinations
Practice:
A basketball team consists of two
centers, five forwards, and four
guards. In how many ways can the
coach select a starting line up of
one center, two forwards, and two
guards?
Answer Now
 Combinations
Practice: A basketball team consists of two centers, five forwards,
and four guards. In how many ways can the coach select a
starting line up of one center, two forwards, and two
guards?
Center: Forwards: Guards:
2! 5! 5 * 4 4! 4 * 3
2 C1   2 C
5 2    10 4 C2   6
1!1! 2!3! 2 * 1 2!2! 2 * 1

2 C1 * 5 C 2 * 4 C 2

Thus, the number of ways to select the

starting line up is 2*10*6 = 120.