Warm – Up

Evaluate

1) 3! =6

2) 7!= 5040
4!
3) = 1/30
6!
10!
4) = 5040
10  4 !
Fundamental counting principle
 Fancy way of describing how we
can determine the number of
ways a sequence of events can
take place.
 States that if an event has m
possible outcomes and another
independent event has n possible
outcomes, then there are mxn
possible outcomes for the two
events together.
 Fundamental counting principle
You are at your school cafeteria that allows you to choose a
lunch meal from a set menu. You have two choices for the
Main course (a hamburger or a pizza), Two choices of a drink
(orange juice, apple juice) and Three choices of dessert (pie,
ice cream, jello).
12 meals
How many different meal combos can you select?_________
Method one: Tree diagram Lunch
Hamburger Pizza

Apple Orange Apple Orange

Pie Ice cream jello Pie. Ice cream Jello Pie. Icecream. Jello Pie. Icecream. Jello
 Fundamental counting principle
Method two: Multiply number of choices

2x2x3= 12 meals

Ex 2: No repetition
During the Olympic 400m sprint, there are 6 runners.
How many possible ways are there to award first,
second, and third places?
1st 2nd 3rd
3 places ____
6 x ____
5 x ____
4 = 120 different ways
 Fundamental counting principle
Ex 3: With repetition
License Plates for cars are labeled with 3 letters followed
by 3 digits. (In this case, digits refer to digits 0 - 9. If a
question asks for numbers, its 1 - 9 because 0 isn't really a
number) How many possible plates are there? You can use
the same number more than once.
___
26 x ___
26 x ___
26 x ___
10 x ___
10 x ___
10 = 17,576,000 plates

Ex 4: Account numbers for Century Oil Company consist

of five digits. If the first digit cannot be a 0 or 1, how many
account numbers are possible?
___
8 x ___
10 x ___
10 x ___
10 x ___
10 = 80,000 different account #’s
Factorials
5 • 4 • 3 • 2 • 1 = 5! Factorial
7!= 7 • 6 • 5 • 4 • 3 • 2 •1 = 5040
7! 7  6  5  4  3  2  1
  42
5! 5 4  3 2 1

8! 8 7  6  5 4  3 2 1 8 7  6
 
5!3! 5  4  3  2  1  3  2  1 3  2  1
8 7
 56
1
Evaluate the following.
At planting season, a farmer has the option of
planting rice, corn, or sugarcane; of using urea,
guano, horse manure, or compost fertilizer; and of
using homemade herbal extract T or A for pesticide.

a.In how many possible ways can he plant his crop if

he has the option to plant one crop and use one
fertilizer and one pesticide only? Make a diagram for
this problem.

b.How many ways of planting are possible, if he will

not use any of the fertilizers and pesticides? If he
will use either one fertilizer or one pesticide?
 Answer the following problems.
 1. Determine how many different computer
passwords are possible if:
a. 3 digits followed by 4 letters ( digits
and letters can be repeated
b. 2 digits followed by 5 letters ( digits
and letters cannot be repeated)
2. How many eight-digit numbers can be
formed if the leading digit cannot be a zero
and the last number cannot be one?
 Permutations
 is an arrangement of items in a particular
order. (ORDER MATTERS)
Can be written as: P(6,4) or 6 P4
Permutation of n objects Taken all at a
Time:
Twelve skiers are competing in the final round of Olympic
freestyle skiing aerial competition.

a) In how many different ways can the skiers finish the

competition? (Assume there are no ties.)

There are 12! different ways that the

skiers can finish the competition.

Use your calculators to find 12! = 479,001,600

Permutations of n objects taken r at a time

The number of permutations of r objects taken

from a group of n distinct objects is denoted by
P
n r and is given by:

n!
n Pr 
n  r !
You are considering 10 different colleges. Before you
decide to apply to the colleges, you want to visit some or
all of them. In how many orders can you visit (a) 6 of the
colleges and (b) all 10 colleges?
a) The number of permutations of 10 objects taken 6 at a
time is:
10! 10! 3, 628,800
P6    151, 200
10
10  6 ! 4! 24
b) The number of permutations of 10 objects taken 10 at
a time is:

10 10P 3, 628,800

Example of PERMUTATION Taken All at a Time

•In how many ways can 7 athletes be

arranged in a straight line?

Example of PERMUTATION n Objects Taken r at a

Time:

•In how many different ways can a first,

second and third prizes can be awarded in a
game with eight contestants?
Seatwork:
1. How many four letter can be formed from the
letters A, B, C and D?
2. In how many ways can the first, second, and
third placer can be selected in a runner of 25?
3. How many permutations can be made by using
the letters in the word PANDEMIC?
4. From a group of 9 different books, 4 books are
to be selected and arrange on a shelf. How many
arrangement are possible?
5. Find a number of ways a president, a vice –
President, a secretary and a treasurer can be chosen
from a class of 40 students
Permutations with repetition
(Distinguishable Permutation)

The number of distinguishable permutations of

n objects where one object is repeated q1 times,
another is repeated q2 times, and so on is:

n!
P=
q1 !q2 !.....qk !
Find the number of distinguishable permutations of the
letters in (a) OHIO and (b) MISSISSIPPI

a) OHIO has 4 letters of which O is repeated 2 times. So,

the number of distinguishable permutations is …

4! 24
 12
2! 2
b) MISSISSIPI has 11 letters of which I is repeated 4
times, S is repeated 4 times and P is repeated 2 times. So,
the number of distinguishable permutations is …
11! 39,916,800
 34, 650
4!4!2! 24242
CIRCULAR PERMUTATION are
arrangements of objects in a circle where
the order of objects matters.

Example:
1.How many ways can 5 people sit around a
circular table?
2.In how many ways can 11 different
colored beads be arranged on a bracelet?
SEATWORK:
1.Arranging the letters in the word LOLLIPOP?
2.Drawing one by one and arranging in a row 4
identical blue, 5 identical yellow, and 3 identical
red balls in a bag?
3.Find the number of distinguishable permutation
of the word HIPPOPOTAMUS?
4.In how many 9 different-colored horses be
positioned in a carousel?
5.A math teacher wants to keep books of the same
book together on his shelf. If he has 12 spaces for 5
Algebra, 4 Geometry and 3 Trigonometry books, in
how many ways can they be placed on a shelf?
 Permutation Problems Involving Conditions
Permutation problems sometimes involve conditions. For
example, in certain situations, objects may be arranged in
a line where two or more objects must be placed
together, or certain objects must be placed in certain
positions.

We will look specifically at three types of conditions:

Case 1: When an element must be placed in a
specific position. For example, Morgan must be the first
student in the lineup.
Case 2: When two or more elements must be
grouped together. For example Michelle and Alicia must sit
together in class.
Case 3: When two or more elements must not be
grouped together. For example, the red book and the blue
book must not be placed next to each other on the shelf.
Case 1: When An Element Must Be Placed in a
Specific Position
Example 1:
At a used car lot, seven different car models are to
be parked close to the road for easy viewing. The
three red cars must be parked so there is a red car
at each end, and one exactly in the middle. How
many ways could the seven cars be parked?
Example 2:
Vanessa has a blue book, a red book, a yellow book
and a green book that she wants to put in line on a
shelf. If the red book must go at either end, how
many possible arrangements are there?
Case 2: When Two or More Elements
Must Be Grouped Together

1. How many arrangements of the word

FAMILY exist if A and L must always be
together?

2. At a used car lot, seven different car

models are to be parked close to the road
for easy viewing. The three red cars must
be parked side by side. How many ways
can the seven cars be parked?
 Case 3: When Two or More Elements Must Not Be
Grouped Together

We will not calculate the number of arrangements in

these problems directly, but rather we will use the
following:
Number of possible
Number of
Total number of arrangements when
arrangements when
two elements = possible - The two
arrangements arrangements are
cannot be grouped
grouped together
together

This is called indirect reasoning.

Example :
1. Michael, Bradley, Jarod and Andrew are to be
arranged in a line from left to right. How many ways
can they be arranged if Michael and Bradley are not
to stand next to each other?

2. Todd, Jean, Kyle, Colin and Lori are to be arranged

in a line from left to right.
a. How many ways can they be arranged?
b. How many ways can they be arranged if Jean
and Lori cannot be side by side?
c. How many ways can they be arranged if Kyle
and Colin must be side by side?
d. How many ways can they be arranged if Jean
must be at one end of the line? HINT: Jean must be in
the first OR the last location.
PROBLEM SOLVING INVOLVING PERMUTATION:
1. A photographer is trying to take a picture of two men,
three women, and four children. If the men, the women,
and the children are always together, how many ways can
the photographer arrange them?
2. In how many ways can 4 girls and 4 boys be seated in a
row containing eight seats,
a. if they may seat anywhere?
b. if the boys and girls must alternate?
3. There are 4 books on fairy tales, 5 novels, and 3 plays. In
how many ways can you arrange so that books on a fairy
tales are together, novels are together, and plays are
together and in order, books on fairy tales, novels and plays?
4. In how many ways can 7 students be seated in a:
a. row
b. round table, if 2 particular students must not be
seated next to each other?