copyright 2013, 2010, 2007, pearson, education, inc. section 12.8 the counting principle and...

15
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Upload: magdalene-french

Post on 17-Jan-2016

218 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section 12.8

The Counting Principle

and Permutations

Page 2: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

What You Will Learn

The Counting PrinciplePermutations

12.8-2

Page 3: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Counting Principle

If a first experiment can be performed in M distinct ways and a second experiment can be performed in N distinct ways, then the two experiments in that specific order can be performed in M • N distinct ways.

12.8-3

Page 4: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 1: Counting Principle: PasswordsA password used to gain access to a computer account is to consist of two lower case letters followed by four digits. Determine how many different passwords are possible if a) repetition of letters and digits is permitted.Solution26•26•10•10•10•10 = 6,760,000 different possible passwords

12.8-4

Page 5: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 1: Counting Principle: Passwordsb) repetition of letters and digits is not permitted.

Solution

26•25•10•9•8•7 = 3,276,000 different possible passwords

12.8-5

Page 6: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 1: Counting Principle: Passwordsc) the first letter must be a vowel (a, e, i, o, u) and the first digit cannot be a 0, and repetition of letters and digits is not permitted.

Solution5•25•9•9•8•7 = 567,000 different possible passwords

12.8-6

Page 7: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Permutations

A permutation is any ordered arrangement of a given set of objects.

12.8-7

Page 8: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Number of Permutations

The number of permutations of n distinct items is n factorial, symbolized n!, where

n! = n(n – 1)(n – 2) • • • (3)(2)(1)

12.8-8

Page 9: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 3: Cell Phones

In how many different ways can six different cell phones be arranged on top of one another?Solution

6! = 6 • 5 • 4 • 3 • 2 • 1 = 720The 6 cell phones can be arranged in 720 different ways.

12.8-9

Page 10: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 4: Permutation of Three Out of Five LettersConsider the five letters a, b, c, d, e. In how many distinct ways can three letters be selected and arranged if repetition is not allowed?Solution

5 • 4 • 3 = 60Thus, there are 60 different possible ordered arrangements, or permutations.

12.8-10

Page 11: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Permutation Formula

The number of permutations possible when r objects are selected from n objects is found by the permutation formula

nP

r

n!

n r !12.8-11

Page 12: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 5: Using the Permutation FormulaYou are among eight people forming a skiing club. Collectively, you decide to put each person’s name in a hat and to randomly select a president, a vice president, and a secretary. How many different arrangements or permutations of officers are possible?

12.8-12

Page 13: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 5: Using the Permutation FormulaSolutionn = 8, r = 3

8P

3

8!

8 3 ! 8!

5!

8 7 6 5 4 32 1

5 4 32 1 336

12.8-13

Page 14: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Permutations of Duplicate ObjectsThe number of distinct permutations of n objects where

n1 of the objects are identical,

n2 of the objects are identical,

…, nr of the objects are

identical is found by the formula

n!

n1!n

2!n

r!

12.8-14

Page 15: Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 12.8 The Counting Principle and Permutations

Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Example 7: Duplicate LettersIn how many different ways can the letters of the word “TALLAHASSEE” be arranged?SolutionOf the 11 letters, 3 are A’s, 2 are S’s, 2 are L’s, and 2 are E’s.

11!

3!2!2!2!

1110 9 8 7 6 5 42

32 1

32 1 32 12 1

831,60012.8-15