1) permutation 2) combination permutations and combinations determine probabilities using...
TRANSCRIPT
1) Permutation2) Combination
Permutations and CombinationsPermutations and Combinations
Determine probabilities using permutations.
Determine probabilities using combinations.
Permutations and CombinationsPermutations and Combinations
An arrangement or listing in which order or placement is important is called apermutation.
Simple example: “combination lock”
31 – 5 – 17 is NOT the same as 17 – 31 – 5
Permutations and CombinationsPermutations and Combinations
An arrangement or listing in which order or placement is important is called apermutation.
Simple example: “combination lock”
31 – 5 – 17 is NOT the same as 17 – 31 – 5
Though the same numbers are used, the order in whichthey are turned to, would mean the difference in the lock
opening or not.
Thus, the order is very important.
Permutations and CombinationsPermutations and Combinations
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 Jeffall applied for a job. How many possible ways are there for the manager to placethe applicants?
Permutations and CombinationsPermutations and Combinations
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 Jeffall applied for a job. How many possible ways are there for the manager to placethe applicants?
Counter Drive-Through Outcomes
Sara
Megen
Tricia
Jeff
Permutations and CombinationsPermutations and Combinations
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 Jeffall applied for a job. How many possible ways are there for the manager to placethe applicants?
Counter Drive-Through Outcomes
Sara
Megen
Tricia
MegenTriciaJeff
TriciaJeffSara
SaraMegenJeff
SaraMegenTricia
Jeff
Permutations and CombinationsPermutations and Combinations
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 Jeffall applied for a job. How many possible ways are there for the manager to placethe applicants?
Counter Drive-Through Outcomes
Sara
Megen
Tricia
MegenTriciaJeff
TriciaJeffSara
SaraMegenJeff
SaraMegenTricia
Jeff
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Permutations and CombinationsPermutations and Combinations
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 Jeffall applied for a job. How many possible ways are there for the manager to placethe applicants?
Counter Drive-Through Outcomes
Sara
Megen
Tricia
MegenTriciaJeff
TriciaJeffSara
SaraMegenJeff
SaraMegenTricia
Jeff
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
There are 12 different ways for the 4 applicants to hold the 2 positions.
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
OutcomesIn the previous example, the positions are in specific order,so each arrangement is unique.
The symbol 4P2 denotes the number of permutations when
arranging 4 applicants in two positions.
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
OutcomesIn the previous example, the positions are in specific order,so each arrangement is unique.
The symbol 4P2 denotes the number of permutations when
arranging 4 applicants in two positions.
You can also use the Fundamental Counting Principleto determine the number of permutations.
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Outcomes
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Outcomes
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
1*2
1*2
1
3*424 P 1
1*2
1*2Note:
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Outcomes
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
1*2
1*2
1
3*424 P 1
1*2
1*2Note:
1*2
1*2*3*424 P
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Outcomes
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
1*2
1*2
1
3*424 P 1
1*2
1*2Note:
1*2
1*2*3*424 P
!2
!424 P
Permutations and CombinationsPermutations and Combinations
SMSTSJ
MTMJMS
TSTMTJ
JSJMJT
Outcomes
24 P
ways to choosefirst employee
ways to choosesecond employeeX
4 X 3
1*2
1*2
1
3*424 P 1
1*2
1*2Note:
1*2
1*2*3*424 P
!2
!424 P
In general, nPr is used to denote the number of permutations of n objects taken rat a time.
Permutations and CombinationsPermutations and Combinations
Permutation
The number of permutations of n objects taken r at a time is the quotient of
n! and (n – r)!
! !
rn
nPrn
Permutations and CombinationsPermutations and Combinations
Permutation: (Order is important!)
610 Find P
Permutations and CombinationsPermutations and Combinations
Permutation: (Order is important!)
610 Find P
! 610
!10610 P
Permutations and CombinationsPermutations and Combinations
Permutation: (Order is important!)
610 Find P
! 610
!10610 P
1*2*3*4
1*2*3*4*5*6*7*8*9*10
!4
!10610 P
Permutations and CombinationsPermutations and Combinations
Permutation: (Order is important!)
610 Find P
! 610
!10610 P
1*2*3*4
1*2*3*4*5*6*7*8*9*10
!4
!10610 P
200,151or 5*6*7*8*9*10610 P
There are 151,200 permutations of 10 objects taken 6 at a time.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q1) How many different registration codes are possible?
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q1) How many different registration codes are possible?
Since the order of numbers in the code is important, this situation is a permutation of 7 digits taken 7 at a time.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q1) How many different registration codes are possible?
Since the order of numbers in the code is important, this situation is a permutation of 7 digits taken 7 at a time.
77 PPrn n = 7, r = 7; recall that 0! = 1.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q1) How many different registration codes are possible?
Since the order of numbers in the code is important, this situation is a permutation of 7 digits taken 7 at a time.
77 PPrn n = 7, r = 7; recall that 0! = 1.
1
1*2*3*4*5*6*7 77 P or 5040
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q1) How many different registration codes are possible?
Since the order of numbers in the code is important, this situation is a permutation of 7 digits taken 7 at a time.
77 PPrn n = 7, r = 7; recall that 0! = 1.
1
1*2*3*4*5*6*7 77 P or 5040
There are 5040 possible codes with the digits 1, 2, 4, 5, 6, 7, and 9.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
outcomes totalof #
outcomes favorable of # y Probabilit
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3
There are three even numbers to choose from.So, there are three ways that the first digit could be even.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3
Now there are only two even numbers to choose from.So, there are two ways that the second digit could be even.
2
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3 2 1
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3 2 1
Now we come to the fourth digit, and there are four odd numbers to choose from.So, there are four ways that the fourth digit could be odd.
4
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3 2 1
Using this same logic, we can determine the different possibilitiesfor the remaining digits.
4 3 2 1
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
Q2) What is the probability that the first three digits of the code are even numbers?
Use the Fundamental Counting Principle to determine the number of waysfor the first three digits to be even.
3 2 1 4 3 2 1
So, the number of favorable outcomes is 3 * 2 * 1 * 4 * 3 * 2 * 1 or 144.
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
There are 144 ways for this event to occur out of the 5040 possible permutations.
Q2) What is the probability that the first three digits of the code are even numbers?
Q1) How many different registration codes are possible?
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
There are 144 ways for this event to occur out of the 5040 possible permutations.
Q2) What is the probability that the first three digits of the code are even numbers?
Q1) How many different registration codes are possible?
5040
144even digits 3first P favorable outcomes
possible outcomes
Permutations and CombinationsPermutations and Combinations
Permutation and Probability:
A computer program requires the user to enter a 7-digit registration code made up ofthe digits 1, 2, 4, 5, 6, 7, and 9.Each number has to be used, and no number can be used more than once.
There are 144 ways for this event to occur out of the 5040 possible permutations.
Q2) What is the probability that the first three digits of the code are even numbers?
Q1) How many different registration codes are possible?
5040
144even digits 3first P favorable outcomes
possible outcomes
The probability that the first three digits of the code are even isor about 3%. 35
1
Permutations and CombinationsPermutations and 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.
Permutations and CombinationsPermutations and Combinations
Combination
The number of combinations of n objects taken r at a time is the quotient
of n! and (n – r)! * r!
! !
!
rrn
nCrn
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.
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere nominated to serve on the Student Council.How many different groups of students could be selected?
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere 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 situationrepresents a combination of 7 people taken 4 at a time.
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere 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 situationrepresents a combination of 7 people taken 4 at a time.
47 CCrn
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere 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 situationrepresents a combination of 7 people taken 4 at a time.
! 4 )!47(
!7 47
C
47 CCrn
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere 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 situationrepresents a combination of 7 people taken 4 at a time.
47 CCrn
1*2*3*4*1*2*3
1*2*3*4*5*6*7
! 4 )!47(
!7 47
C
Permutations and CombinationsPermutations and Combinations
The students of Mr. Fant’s Seminar class had to choose 4 out of the 7 people whowere 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 situationrepresents a combination of 7 people taken 4 at a time.
47 CCrn
1*2*3*4*1*2*3
1*2*3*4*5*6*7
! 4 )!47(
!7 47
C
35or 1*2*3
5*6*7
There are 35 different groups of students that could be selected.
Permutations and CombinationsPermutations and Combinations
When working with permutations and combinations, it is vital that youare able to distinguish when the counting order is important, or not.
This is only recognizable after a considerable amount of practice.
Permutations and CombinationsPermutations and Combinations
When working with permutations and combinations, it is vital that youare 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 whowere nominated to serve on the Student Council.How many different groups of students could be selected?
Permutations and CombinationsPermutations and Combinations
When working with permutations and combinations, it is vital that youare 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 whowere 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 bemembers of the student council, with the same duties. (Combination)
Permutations and CombinationsPermutations and Combinations
When working with permutations and combinations, it is vital that youare 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 whowere 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 bemembers 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 inwhich they are chosen would matter. (Permutation)
Permutations and CombinationsPermutations and Combinations