28
Permutations and Combinations AII.12 2009

Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Embed Size (px)

Citation preview

Page 1: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations and

Combinations

AII.12 2009

Page 2: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Objectives:

apply fundamental counting principle

compute permutations

compute combinations

distinguish permutations vs combinations

Page 3: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Fundamental Counting Principle

Fundamental Counting Principle can be used determine the number of possible outcomes when there are two or more characteristics .

Fundamental Counting Principle states that if an event has m possible outcomes and another independent event has n possible outcomes, then

there are m* n possible outcomes for the

two events together.

Page 4: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

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 3H 4H 5H 6H1T 2T 3T 4T 5T 6T

12 outcomes

6*2 = 12 outcomes

Page 5: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Fundamental Counting Principle

For a college interview, Robert has to choose what to wear from the following: 4 slacks, 3 shirts, 2 shoes and 5 ties. How many possible outfits does he have to choose from?

4*3*2*5 = 120 outfits

Page 6: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

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.

Page 7: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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

Number of choices for first blank? 3 ____ ____

3 2 ___Number of choices for second blank?

Number of choices for third blank? 3 2 1

3*2*1 = 6 3! = 3*2*1 = 6

ABC ACB BAC BCA CAB CBA

Page 8: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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

. 0 where nrrn

nrpn

)!(

!

603*4*5)!35(

!535

2!

5! p

Page 9: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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?

Practice:

Answer Now

Page 10: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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?

Practice:

2436028*29*30)!330(

!30330

27!

30! p

Page 11: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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?

Practice:

Answer Now

Page 12: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations

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?

Practice:

480,100,520*21*22*23*24

)!524(

!24524

19!

24! p

Page 13: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations with Repetitions

Page 14: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations with Repetitions

The number of permutations of “n” objects,

“r” of which are alike, “s” of which are

alike, ‘t” of which are alike, and so on, is

given by the expression!

! ! ! ...

n

r s t

Page 15: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations with Repetitions

Example 1: In how many ways can all of theletters in the word SASKATOON be arranged?

Solution: If all 9 letters were different, we could

arrange then in 9! Ways, but because there are 2

identical S’s, 2 identical A’s, and 2 identical O’s,

we can arrange the letters in:

Therefore, there are 45 360 different ways the letters can be arranged.

! 9!45360

! ! ! ... 2! 2! 2!

n

r s t

Page 16: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Permutations with Repetitions

Example 2: Along how many different routes canone walk a total of 9 blocks by going 4 blocksnorth and 5 blocks east?

Solution: If you record the letter of the direction in

which you walk, then one possible path would berepresented by the arrangement NNEEENENE.

Thequestion then becomes one to determine the

number ofarrangements of 9 letters, 4 are N’s and 5 are

E’s. Therefore, there are 126

different routes.

9!126

5! 4!

Page 17: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Circular and Ring Permutations

Circular Permutations Principle“n” different objects can be arranged

in circle in (n – 1)! ways.

Ring Permutations Principle

“n” different objects can arranged on a

circular ring in ways.

( 1)!

2

n

Page 18: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Circular and Ring Permutations

Example 1: In how many different ways can12 football players be arranged in a circularhuddle?

Solution: Using the circular permutations principle there are:

(12 – 1)! = 11! = 39 916 800 arrangements

If the quarterback is used as a point of reference, then the other 11 players can be arranged in 11! ways.

Page 19: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Circular and Ring Permutations

Example 2: In how many ways can 8 different charms be arranged on a circular bracelet?

Solution: Using the ring permutation principle there are:

( 1)! (8 1)! 7!2520

2 2 2

nways

Page 20: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

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.

Page 21: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Combinations

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

. 0 where nrrnr

nr

Cn

)!(!

!

Page 22: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Combinations

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

. 0 where nrrnr

nr

Cn

)!(!

!

102

20

1*2

4*5

1*2*1*2*3

1*2*3*4*5

)!35(!3

!535

3!2!

5! C

Page 23: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Combinations

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?

Practice:

Answer Now

Page 24: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

CombinationsTo play a particular card game, each player is dealt five cards from a standard deck of 52 cards. How many different hands are possible?

Practice:

960,598,21*2*3*4*5

48*49*50*51*52

)!552(!5

!52552

5!47!

52! C

Page 25: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Combinations

A student must answer 3 out of 5 essay questions on a test. In how many different ways can the student select the questions?

Practice:

Answer Now

Page 26: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

CombinationsA student must answer 3 out of 5 essay questions on a test. In how many different ways can the student select the questions?

Practice:

101*2

4*5

)!35(!3

!535

3!2!

5! C

Page 27: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

Combinations

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?

Practice:

Answer Now

Page 28: Permutations and Combinations AII.12 2009. Objectives: apply fundamental counting principle compute permutations compute combinations distinguish permutations

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

Practice:

2!1!1

!212 C

Center:

101*2

4*5

!3!2

!525 C

Forwards:

61*2

3*4

!2!2

!424 C

Guards:

Thus, the number of ways to select the starting line up is 2*10*6 = 120.

22512 * CCC 4*