PERMUTATIONS

• Illustrates the permutations of objects

(M10SP-IIIa-1)
• Solves problems involving
permutations ( M10SP-IIIb-1)

OBJECTIVES
• Recall the fundamental counting principle
• Define and illustrate permutations of
objects
• Solve problems involving permutations of
objects

SUBTASKS
Have you ever wondered
why some locks have
codes?
Cards have PINs ?
Why order is important?
Why there is seating
arrangment?
Why arrangement is
important even on
tables?
Where else is
ORDER or
arrangement
important?
And even with plants in
the garden?
Recall:
An OUTCOME is the result of a single trial of a
process involving chance, called probability
experiment. The set of all probable outcomes is called a
SAMPLE SPACE. A TREE DIAGRAM can be used to
systematically list the outcomes in a sample space.

When you need to know the total number of outcomes,

you can use the FUNDAMENTAL COUNTING
PRINCIPLE.
 Fundamental Counting Principle
In words:
The number of possible outcomes in a sample
space can be found by multiplying the
number of possible outcomes for each event.

In symbols:
If event M can occur in m ways and is
followed by event N that occur in n ways,
then the event M followed by N occur in m
x n ways.
• Counting Principle – involves outcomes with different
categories similar to a tree diagram.
• Example: You are making a password for your computer. You
will use 2 letters and 1 number, repeats are allowed.

• You have different categories:

• Letter • Letter • Number
• 26 • 26 • 10 = 6760 outcomes possible
Suppose you secured your computer using
a passcode lock. Later you realized that
you forgot the four-digit code. You only
remembered that the code contains the
digits 1, 3, 4, and 7.

4 x 3 x 2 x 1 = 24
The product 4 x 3 x 2 x 1 can also be written as 4!, which is
read as 4 factorial.

Key Concept: FACTORIAL

WORDS: n factorial is the product of all counting
numbers beginning with n and counting backward to 1.
Zero factorial is defined to equal to 1.

SYMBOLS: and
10-9 Permutations and Combinations

The factorial of a number is the product of

all the whole numbers from the number down
to 1. The factorial of 0 is defined to be 1.

5! = 5 • 4 • 3 • 2 • 1
Reading Math
Read 5! as “five factorial.”

Course 3
10-9 Permutations and Combinations
Additional Example 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.

Course 3
10-9 Permutations and Combinations
Additional Example 1: Evaluating Expressions
Containing Factorials

10!
C. (9 – 2)!

10! Subtract within parentheses.

7!

10 • 9 • 8 • 7 • 6 • 5 • 4 • 3 • 2 • 1
7654321

10 • 9 • 8 = 720

Course 3
10-9 Permutations and Combinations
Check It Out: Example 1

Evaluate each expression.

A. 10!
10 • 9 • 8 • 7 • 6 • 5 • 4 • 3 • 2 • 1 = 3,628,800
B. 7!
5!
7•6•5•4•3•2•1 Write out each factorial
5•4•3•2•1 and simplify.

7 • 6 = 42 Multiply remaining
factors.

Course 3
Example:

There are 8 finalists in a band competition. In how

many ways can the bands be ranked if they cannot
receive the same ranking?
8!=8∗ 7∗ 6 ∗5 ∗ 4 ∗3 ∗ 2∗ 1 𝑜𝑟 40,320 𝑤𝑎𝑦𝑠

Permutation of n distinct objects

Suppose we have 6 different potted plants and we wish
to arrange 4 of them in a row. In how many ways can
this be done?

Permutation is the arrangement of a

group of distinct objects.
The permutation of 6 potted plants taken 4 at a
time is denoted by
KEY CONCEPT: Permutation of n objects
taken r at a time
The number of permutations of n objects taken r at
a time from a group of n distinct objects is given
by:
n r=

The permutation of n objects taken all at a time is:

P(n, n) = n!
Example:

There are 8 finalists in a band competition. Suppose

you want to know how many different ways the
first, the second, and third place rankings could be
awarded.

First place Second Place Third Place Permutations

8 * 7 * 6 = 336
nr=
Using the formula:

83= =
 1. In how many ways can 5
plotted plants be arranged in
a row?
5P5 = 120
2. A teacher wants to assign 4
different tasks to her 4
students. In how many
possible ways can she do it?
4P4 = 24
 3. How many ways can the
manager of a softball team
choose players for the top 4
spots in the lineup if she has 7
possible players in mind?
7P4 = 840
 4. In how many different
ways can 5 cars be parked if
there are 7 available parking
spaces?
7P5 = 2520
5. How many 4-digit numbers
can be formed from the digits
1, 3, 5, 6, 8, and 9 if no
repetition is allowed?
6P4 = 360
 6. If there are 10 people and
only 6 chairs are available, in
how many ways can they be
seated?
10P6 = 151,200
 7. In how many different
ways can 10 people occupy
the 10 seats in a front row of
a mini theater?
10P10 = 10!
= 3,628,800
 8. There are 4 different
Mathematics books and 5
different Science books. In
how many ways can the
books be arranged on a shelf
if there are no restrictions?
9P9 = 9!
= 362,880
 9. There are 4 different
Mathematics books and 5
different Science books. In
how many ways can the
books be arranged on a shelf
if books of the same subject
must be placed together?
SSSSSMMMM
MMMMSSSSS

P = (5!x4!)x2!
= 5760
 10. There are 4 different
Mathematics books and 5
different Science books. In
how many ways can the
books be arranged on a shelf
if they must be placed
alternately?
SMSMSMSMS
MSMSMSMSS
5!*4! = 2880
P = 5!x4!
= 2880
In how many ways can 3
persons sit in a circular
table?
Image uploaded by Miguel Andaya
KEY Concept: Circular Permutations

The circular permutations of n objects is

P = (n-1)!
Find the number of ways in which
five persons A, B, C, D, and E sit
around a round table such that:
a. There is no restriction
b. A and D must always sit
together.
c. C and E must not sit together.
 A

D
B

P = (4-1)!2! P=(5-1)! =24

C

=3!2! A&D will not sit together

24-12 =12 ways
=12
 A

D
B

P = (3-1)!3!
=2!3!
=12
How many arrangements can be
made with the letters of the word
BOOK?

= 4*3 = 12 ways
OOHCSE
LAAICTLOFRA
DEROR

MAIOERPUTNT
 Find the number of permutations of the letters of the
word STATISTICS
There are 10 letters of the word. Assuming that the
letters are distinct, there are P(10, 10) = 10!
permutations
However, we have to take into consideration that the 3 S’s are alike,
the 3 T’s are alike, and the 2 Is are also alike.
The permutations of the 3 S’s is P(3, 3) = 3!.
The permutations of the 3 T’s is P(3, 3) = 3!
The permutationof the 2 I’s is P(2, 2) = 2!

So we must divide 10! by 3! 3! 2! in order to eliminate the

duplicates.
Thus, P = = 50 400 permutations
KEY Concept: DISTINGUISHABLE PERMUTATIONS
Words: Different arrangement of objects where some of them
are identical
Symbols: The number of distinguishable permutations, P, of n
objects where p objects are alike, q objects are alike, r objects
are alike, and so on, is
bookkeeper

woodenness

keenness

successfully