PERMUTATION

Prepared by: Christy Joy “Ligaya” A. Apaitan

Objectives:
At the end of the lesson students
will be able to;
a.Illustrate permutation of
objects
b.solve
problems involving
permutations
 Permutations

An arrangement or listing in which order or placement is important is called a

permutation.

Simple example: “combination lock”

31 – 5 – 17 is NOT the same as 17 – 31 – 5

 Permutations

An arrangement or listing in which order or placement is important is called a

permutation.

Simple example: “combination lock”

31 – 5 – 17 is NOT the same as 17 – 31 – 5

Though the same numbers are used, the order in which

they are turned to, would mean the difference in the lock
opening or not.

Thus, the order is very important.

 Permutations
The manager of a coffee shop needs to hire two employees, one to work at the
counter and one to work at the drive-through window. Sara, Megen, Tricia and Jeff
all applied for a job. How many possible ways are there for the manager to place
the applicants?
 Permutations
The manager of a coffee shop needs to hire two employees, one to work at the
counter and one to work at the drive-through window. Sara, Megen, Tricia and Jeff
all applied for a job. How many possible ways are there for the manager to place
the applicants?

Counter Drive-Through Outcomes

Sara

Megen

Tricia

Jeff
 Permutations
The manager of a coffee shop needs to hire two employees, one to work at the
counter and one to work at the drive-through window. Sara, Megen, Tricia and Jeff
all applied for a job. How many possible ways are there for the manager to place
the applicants?

Counter Drive-Through Outcomes

Megen
Sara Tricia
Jeff
Tricia
Megen Jeff
Sara
Sara
Tricia Megen
Jeff
Sara
Jeff Megen
Tricia
 Permutations
The manager of a coffee shop needs to hire two employees, one to work at the
counter and one to work at the drive-through window. Sara, Megen, Tricia and Jeff
all applied for a job. How many possible ways are there for the manager to place
the applicants?

Counter Drive-Through Outcomes

Megen SM
Sara Tricia ST
Jeff SJ
Tricia MT
Megen Jeff MJ
Sara MS
Sara TS
Tricia Megen TM
Jeff TJ
Sara JS
Jeff Megen JM
Tricia JT
 Permutations
The manager of a coffee shop needs to hire two employees, one to work at the
counter and one to work at the drive-through window. Sara, Megen, Tricia and Jeff
all applied for a job. How many possible ways are there for the manager to place
the applicants?

Counter Drive-Through Outcomes

Megen SM
Sara Tricia ST
Jeff SJ
Tricia MT
Megen Jeff MJ
Sara MS
Sara TS
Tricia Megen TM
Jeff TJ
Sara JS
Jeff Megen JM
Tricia JT

There are 12 different ways for the 4 applicants to hold the 2 positions.
 The permutation of n objects taken r at
a time can be denoted by

P(n,r)

In other books Permutation is denoted as

The number of permutations of n objects taken r at a time is the quotient of
n! and (n – r)! n!
n Pr 
n  r !
 Permutations
In the previous example, the positions are in specific order,
so each arrangement is unique. Outcomes
SM
The symbol 4P2 denotes the number of permutations when ST
arranging 4 applicants in two positions. SJ
MT
MJ
MS
TS
TM
TJ
JS
JM
JT
 Permutations
In the previous example, the positions are in specific order,
so each arrangement is unique. Outcomes
SM
The symbol 4P2 denotes the number of permutations when ST
arranging 4 applicants in two positions. SJ

You can also use the Fundamental Counting Principle MT

to determine the number of permutations. MJ
MS
ways to choose ways to choose TS
first employee X second employee TM
TJ
4 P2  4 X 3 JS
JM
JT
 Permutations and Combinations

ways to choose ways to choose

first employee X second employee Outcomes
SM
4 P2  4 X 3 ST
SJ
MT
MJ
MS
TS
TM
TJ
JS
JM
JT
 Permutations

ways to choose ways to choose

first employee X second employee Outcomes
SM
4 P2  4 X 3 ST
SJ
MT
4 * 3  2 *1  2 *1 MJ
4 P2    Note: 1 MS
1  2 *1  2 *1 TS
TM
TJ
JS
JM
JT
 Permutations

ways to choose ways to choose

first employee X second employee Outcomes
SM
4 P2  4 X 3 ST
SJ
MT
4 * 3  2 *1  2 *1 MJ
4 P2    Note: 1 MS
1  2 *1  2 *1 TS
TM
TJ
4 * 3 * 2 *1
4 P2  JS
2 *1 JM
JT
 Permutations and Combinations

ways to choose ways to choose

first employee X second employee Outcomes
SM
4 P2  4 X 3 ST
SJ
MT
4 * 3  2 *1  2 *1 MJ
4 P2    Note: 1 MS
1  2 *1  2 *1 TS
TM
TJ
4 * 3 * 2 *1
4 P2  JS
2 *1 JM
JT
4!
4 P2 
2!
 Permutations

ways to choose ways to choose

first employee X second employee Outcomes
SM
4 P2  4 X 3 ST
SJ
MT
4 * 3  2 *1  2 *1 MJ
4 P2    Note: 1 MS
1  2 *1  2 *1 TS
TM
TJ
4 * 3 * 2 *1
4 P2  JS
2 *1 JM
JT
4!
4 P2 
2!
In general, nPr is used to denote the number of permutations of n objects taken r
at a time.
In a school club there are 5 possible choices for the
president, a secretary , a treasurer and an auditor.
Assuming that each of them is qualified for any
positions , in how many ways can the 4 officers be
elected?

 Solution
P(5,4) = 5.4.3.2
= 120 ways

The number of permutation of n objects taken r at a

time, P(n,r).
What if there are to be arranged and we would arrange all
of them every time? That is n= 5 , and
r= 5

In how many ways can 5 people arrange

themselves in a row for picture taking?

 Solution
n=5 r=5
P(5,5) = 5.4.3.2.1
= 120 possible pictures.
 Remember!
 we used all the numbers from the previous
example
n=5 down to 1. another way writing 5.4.3.2.1 is 5!

Similarly : 4!= 4.3.2.1 =24

8!= 8.7.6.5.4.3.2.1 = 40 320
3!= 3.2.1 = 6
1!= 1
 Permutations and Combinations
Permutation: (Order is important!)

Find 10 P6
 Permutations
Permutation: (Order is important!)

Find 10 P6

10!
10 P6 
10  6 !
 Permutations
Permutation: (Order is important!)

Find 10 P6

10!
10 P6 
10  6 !
10! 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 *1
10 P6  
4! 4 * 3 * 2 *1
 Permutations
Permutation: (Order is important!)

Find 10 P6

10!
10 P6 
10  6 !
10! 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 *1
10 P6  
4! 4 * 3 * 2 *1

10 P6  10 * 9 * 8 * 7 * 6 * 5 or 151,200

There are 151,200 permutations of 10 objects taken 6 at a time.

Let’s Find out!
 Thought Shapes

-The most -The ideas

important thing and skills I
I learn is.. learn is

-What I enjoyed -The thought

most is.. still going
around in my
head..
 Combinations
An arrangement or listing in which order is not important is called a combination.

For example, if you are choosing 2 salad ingredients from a list of 10,
the order in which you choose the ingredients does not matter.
 Combinations
An arrangement or listing in which order is not important is called a combination.

For example, if you are choosing 2 salad ingredients from a list of 10,
the order in which you choose the ingredients does not matter.

Combination
The number of combinations of n objects taken r at a time is the quotient
of n! and (n – r)! * r!
n!
n Cr 
 n  r  ! r!
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the students are chosen does not matter, so this situation
represents a combination of 7 people taken 4 at a time.
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the students are chosen does not matter, so this situation
represents a combination of 7 people taken 4 at a time.

n Cr  7 C4
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the students are chosen does not matter, so this situation
represents a combination of 7 people taken 4 at a time.

n Cr  7 C4

7!
7 C4 
(7  4)! 4 !
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the students are chosen does not matter, so this situation
represents a combination of 7 people taken 4 at a time.

n Cr  7 C4

7! 7 * 6 * 5 * 4 * 3 * 2 *1
7 C4  
(7  4)! 4 ! 3 * 2 *1 * 4 * 3 * 2 *1
 Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the students are chosen does not matter, so this situation
represents a combination of 7 people taken 4 at a time.

n Cr  7 C4

7! 7 * 6 * 5 * 4 * 3 * 2 *1
7 C4  
(7  4)! 4 ! 3 * 2 *1 * 4 * 3 * 2 *1

7 *6*5
 or 35
3 * 2 *1
There are 35 different groups of students that could be selected.
 Permutations and Combinations

When working with permutations and combinations, it is vital that you

are able to distinguish when the counting order is important, or not.

This is only recognizable after a considerable amount of practice.

 Permutations and Combinations

When working with permutations and combinations, it is vital that you

are able to distinguish when the counting order is important, or not.

This is only recognizable after a considerable amount of practice.

Consider our previous example:

The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?
 Permutations and Combinations

When working with permutations and combinations, it is vital that you

are able to distinguish when the counting order is important, or not.

This is only recognizable after a considerable amount of practice.

Consider our previous example:

The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the people are being chosen does not matter because the
positions for which they are being chosen are the same. They are all going to be
members of the student council, with the same duties. (Combination)
 Permutations and Combinations

When working with permutations and combinations, it is vital that you

are able to distinguish when the counting order is important, or not.

This is only recognizable after a considerable amount of practice.

Consider our previous example:

The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people who
were nominated to serve on the Student Council.
How many different groups of students could be selected?

The order in which the people are being chosen does not matter because the
positions for which they are being chosen are the same. They are all going to be
members of the student council, with the same duties. (Combination)

However, if Mr. Fant’s class was choosing 4 out of 7 students to be president,

vice-president, secretary, and treasurer of the student council, then the order in
which they are chosen would matter. (Permutation)
Permutations and Combinations