Вы находитесь на странице: 1из 46

Permutations

and

Combinations
Key Vocabulary:
Permutation
Combination
Fundamental Counting Principle
Factorial

Objectives:

apply fundamental counting principle

compute permutations

compute combinations

distinguish permutations vs combinations

Fundamental Counting
Principle
Lets start with a simple example.
A student is to roll a die and flip a coin.
How many possible outcomes will there be?
1H 2H
1T 2T

3H
3T

4H
4T

5H 6H
5T 6T

12 outcomes

6*2 = 12 outcomes

Example:

For dinner you have the following choices:


ENTREES
MAINS

soup

salad

DESSERTS

icecream

chicken

prawns

hamburger

How many different combinations


of meals could you make?
We'll build a tree diagram to
show all of the choices.

Notice the number of choices at each branch


2
choices

3
choices

2 3 2 = 12
p
u
so

2
choices
en
k
c
chi
prawns
ham
bur
ger

ice cream

ice cream

ice cream

We ended up with
12 possibilities
soup, chicken, ice cream
soup, chicken,
soup, prawns, ice cream
soup, prawns,
soup, hamburger, ice cream
soup, hamburger,

sa
la
d

ice cream
en
k
c
chi
prawns
ham
bur
ger

Now to get all


possible choices we
follow each path.

ice cream

ice cream

salad, chicken, ice


cream
salad, chicken,
salad, prawns, ice cream
salad, prawns,
salad, hamburger, ice cream
salad, hamburger,

Multiplication Principle of Counting


If a task consists of a sequence of choices in which
there are p selections for the first choice, q selections for
the second choice, r selections for the third choice, and
so on, then the task of making these selections can be
done in
pqr
different ways.
If we have 6 different shirts, 4 different pants, 5 different pairs
of socks and 3 different pairs of shoes, how many different
outfits could we wear?
6 4 5 3 = 360

Permutations
A Permutation is an arrangement
of items in a particular order.

Notice,

ORDER MATTERS!

To find the number of Permutations of


n items, we can use the Fundamental
Counting Principle or factorial notation.

Permutations
The number of ways to arrange
the letters ABC:
____ ____

____

3 ____ ____
Number of choices for second blank? 3 2 ___
3 2 1
Number of choices for third blank?

Number of choices for first blank?

3*2*1 = 6
ABC

ACB

3! = 3*2*1 = 6
BAC

BCA

CAB

CBA

A permutation is an ordered arrangement


of r objects chosen from n objects.
For combinations order does not matter but for
permutations it does.
There are three types of permutations.
The first is distinct with repetition.
This means there are n
distinct objects but in
this means different
choosing r of them you
can repeat an object.
Let's look at a 3
There are 10 choices for the first number
combination lock
There are 10 choices for the second number
with numbers 0
and you can repeat the first number
through 9
There are 10 choices for the third number
and you can repeat

By the multiplication principle there are 10 10 10 = 1000

This can be generalized as:

Permutations: Distinct Objects with Repetition


The number of ordered arrangements of r objects
chosen from n objects, in which the n objects are
distinct and repetition is allowed, is nr
What if the lock had four choices
for numbers instead of three?

104 = 10 000 choices

The second type of permutation is distinct, without


repetition.
Let's say four people have a race. Let's look at the
possibilities of how they could place. Once a person has
been listed in a place, you can't use that person again (no
repetition).
Based on the multiplication principle:
First place would be
choosing someone from
4 3 2 1 = 24 choices
among 4 people.

Now there are only 3 to


choose from for second
place.
Now there are only 2
to choose from for
third place.
Only one possibility for
fourth place.

4th

3rd

2nd

1st

Pr , means the number of ordered arrangements of r objects


chosen from n distinct objects and repetition is not allowed.
n

n!
Pr
n r!

In the last example: 4 P

4!
4 3 2 1

24
4 4 !
0!

If you have 10 people


racing and only 1st, 2nd
and 3rd place how many
possible outcomes are
there?
10

0! = 1

10!
10 9 8 7!
P3

720
10 3 !
7!

Permutations
To find the number of Permutations of
n items chosen r at a time, you can use
the formula

n!
n pr ( n r )! where 0 r n .

5!
5!
5 * 4 * 3 60
5 p3
(5 3)! 2!

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

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

30!
30!

30 * 29 * 28 24360
30 p3
( 30 3)! 27!

Permutations
Practice:
From a club of 24 members, a President,
Vice President, Secretary, Treasurer
and Historian are to be elected. In how
many ways can the offices be filled?
AnswerNow

Permutations
Practice:
From a club of 24 members, a President,
Vice President, Secretary, Treasurer
and Historian are to be elected. In how
many ways can the offices be filled?

24!
24!

24 p5
( 24 5)! 19!
24 * 23 * 22 * 21 * 20 5,100,480

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

A combination is an arrangement of r
objects chosen from n objects regardless
of order.
Cr , means the number combinations of r objects chosen
from n distinct objects and repetition is not allowed.
n

n
n!
Cr
or
n r !r!
r

Order doesn't matter here so the combination 1, 2, 3 is not


different than 3, 2, 1 because they both contain the same
numbers.

You need 2 people on your committee and you have 5 to


choose from. You can see that this is without repetition
because you can only choose a person once, and order
doesnt matter. You need 2 committee members but it
doesn't matter who is chosen first. How many
combinations are there?
5

5!
5 4 3!
C2

10
5 2 ! 2! 3! 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?
AnswerNow

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?
AnswerNow

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

10
5 C3
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?
AnswerNow

Combinations
Practice:
Center:

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?
Forwards:

Guards:

2!
5! 5 * 4
4! 4 * 3
C

10
25 2

6
2 C1
4 C2
2!3! 2 * 1
2!2! 2 * 1
1!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.

Review/Summary

Permutations vs. Combinations

When is it a permutation?
When is it a combination?

Permutation

A permutation is an
arrangement in which order
matters.
A B C differs from B C A

How Many Permutations?


Consider four objects {A,B,C,D}
There are 4 choices for the first slot.
There are 3 choices for the second
slot.
There are 2 choices for the third slot.
There is 1 choice for the last slot.

4 x 3 x 2 x 1 = 24
Permutations
ABCD
ACDB
BACD
BCDA
CABD
CBDA
DABC
DBCA

ABDC
ADBC
BADC
BDAC
CADB
CDAB
DACB
DCAB

ACBD
ADCB
BCAD
BDCA
CBAD
CDBA
DBAC
DCBA

Generalization
There are 4! ways to
arrange 4 items.
There are n! ways to
arrange n items.

Permutation Example
Selecting 3 items out of a set of 5
We have 5 choices for the first
item.
We have 4 choices for the second
item.
We have 3 choices for the third
item.

Permutation Formula
n!
n Pr P ( n, r )
(n r )!

Combinations

Combinations are
arrangements in which order
does NOT matter.
A, B, C is the same as B, C,
A

Evaluatingn Cr

In how many ways may 3


items be selected from a set
of 5 without regard to order?

We already know that there 60


permutations of these items.
For each set of three, there
are
3! or 6 arrangements.
ABC
BCA

ACB
CAB

BAC
CBA

All of these are really the

Our actual answer is 10.


5 C3

60
10
3!
6

Consider the set {A,B,C,D,E}


These are the combinations.
A,B,C
A,C,D
B,C,D

A,B,D
A,C,E
B,C,E

A,B,E
A,D,E
B,D,E

Combination Formula
n!
n C r C ( n, r )
r!(n r )!

A Challenging Example. Have a go.

Pe
O r rm
de uta
r M tio
a t n:
te
rs

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?
We could have even numbers with 4, 5 or 6 digits
This Gives 4 possibilities to work with:
PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6
PART B: 4, 5 or 6 EVEN digits beginning with a 5
PART C: 5 or 6 EVEN digits beginning with a 2
PART D: 5 or 6 EVEN digits beginning with a 1 or 3

Pe
O r rm
de uta
r M tio
a t n:
te
rs

A Challenging Example. Have a go.

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?

PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6

3
4

2
3

+
2

4
1

This gives a total of 240

3
2

Pe
O r rm
de uta
r M tio
a t n:
te
rs

A Challenging Example. Have a go.

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?

PART B: 4, 5 or 6 EVEN digits beginning with a 5

3
4

3
3

+
2

4
1

This gives a total of 180

3
3

Pe
O r rm
de uta
r M tio
a t n:
te
rs

A Challenging Example. Have a go.

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?

PART C: 5 or 6 EVEN digits beginning with a 2

4
1

2
4

This gives a total of 96

Pe
O r rm
de uta
r M tio
a t n:
te
rs

A Challenging Example. Have a go.

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?

PART D: 5 or 6 EVEN digits beginning with a 1 or 3

4
2

2
4

This gives a total of 288

A Challenging Example. Have a go.

Pe
O r rm
de uta
r M tio
a t n:
te
rs

How many even numbers greater than 4000 can be


formed using some or all of the digits 1, 2, 3, 4, 5, 6 if
each digit must feature no more than once in a number?
We could have even numbers with 4, 5 or 6 digits
This Gives 4 possibilities to work with:

PART A: 4, 5 or 6 EVEN digits beginning with a 4 OR 6 = 240


PART B: 4, 5 or 6 EVEN digits beginning with a 5 = 180
PART C: 5 or 6 EVEN digits beginning with a 2 = 96
PART D: 5 or 6 EVEN digits beginning with a 1 or 3 =288
Number of possible even numbers greater than 4000 = 804

Вам также может понравиться