26
© The McGraw-Hill Companies, Inc., 2000 4-1 4-1 Chapter 4 Chapter 4 Counting Counting Techniques Techniques

© The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

Embed Size (px)

Citation preview

Page 1: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-14-1

Chapter 4Chapter 4

Counting TechniquesCounting Techniques

Page 2: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-24-2 OutlineOutline

4-1 Introduction 4-2 Tree Diagrams and the

Multiplication Rule for Counting

4-3 Permutations and Combinations

Page 3: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-44-4 ObjectivesObjectives

Determine the number of outcomes to a sequence of events using a tree diagram.

Find the total number of outcomes in a sequence of events using the multiplication rule.

Page 4: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-54-5 Objectives Objectives

Find the number of ways rr objects can be selected from nn objects using the permutation rule.

Find the number of ways rr objects can be selected from nn objects without regard to order using the combination rule.

Page 5: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-64-6 4-2 Tree Diagrams 4-2 Tree Diagrams

A tree diagramtree diagram is a device used to list all possibilities of a sequence of events in a systematic way.

Page 6: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-74-7 4-2 Tree Diagrams -4-2 Tree Diagrams - Example

Suppose a sales person can travel from New York to Pittsburgh by plane, train, or bus, and from Pittsburgh to Cincinnati by bus, boat, or automobile. Display the information using a tree diagram.

Page 7: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-84-84-2 Tree Diagrams -4-2 Tree Diagrams - Example

Cincinnati

Bus

New York

Pittsburgh

Plane

Train

Bus

Boat

Auto

Bus

Boat

Boat

Bus

Auto

Auto

Plane, Bus

Plane, boat

Plane, autoTrain, bus

Train, boat

Train, autoBus, busBus, boat

Bus, auto

Page 8: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-94-94-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting Counting

Multiplication Rule :Multiplication Rule : In a sequence of nn events in which the first one has kk11 possibilities and the second event has kk22 and the third has kk33, and so forth, the total possibilities of the sequence will be kk11kk22kk33kknn.

Page 9: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-104-104-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting - Counting - Example

A nurse has three patients to visit. How many different ways can she make her rounds if she visits each patient only once?

Page 10: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-114-114-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting - Example Counting - Example

She can choose from three patients for the first visit and choose from two patients for the second visit, since there are two left. On the third visit, she will see the one patient who is left. Hence, the total number of different possible outcomes is 3 2 1= 6.

Page 11: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-124-124-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting - Counting - Example

Employees of a large corporation are to be issued special coded identification cards. The card consists of 4 letters of the alphabet. Each letter can be used up to 4 times in the code. How many different ID cards can be issued?

Page 12: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-134-134-2 The Multiplication Rules for 4-2 The Multiplication Rules for Counting - Counting - Example

Since 4 letters are to be used, there are 4 spaces to fill ( _ _ _ _ ). Since there are 26 different letters to select from and each letter can be used up to 4 times, then the total number of identification cards that can be made is 26 2626 26= 456,976.

Page 13: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-144-144-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting - Counting - Example

The digits 0, 1, 2, 3, and 4 are to be used in a 4-digit ID card. How many different cards are possible if repetitions are permitted?

Solution:Solution: Since there are four spaces to fill and five choices for each space, the solution is 5 5 5 5 = 54 = 625.

Page 14: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-154-154-2 The Multiplication Rule for 4-2 The Multiplication Rule for Counting - Counting - Example

What if the repetitions were not permitted in the previous example?

Solution:Solution: The first digit can be chosen in five ways. But the second digit can be chosen in only four ways, since there are only four digits left; etc. Thus the solution is 5 4 3 2 = 120.

Page 15: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-164-16 4-3 Permutations4-3 Permutations

Consider the possible arrangements of the letters aa, bb, and cc.

The possible arrangements are: abc, acb, abc, acb, bac, bca, cab, cba.bac, bca, cab, cba.

If the order of the arrangement is order of the arrangement is importantimportant then we say that each arrangement is a permutation of the three letters. Thus there are six permutations of the three letters.

Page 16: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-174-17 4-3 Permutations4-3 Permutations

An arrangement of n distinct objects in a specific order is called a permutationpermutation of the objects.

Note:Note: To determine the number of possibilities mathematically, one can use the multiplication rule to get: 3 2 1 = 6 permutations.

Page 17: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-184-18 4-3 Permutations4-3 Permutations

Permutation Rule :Permutation Rule : The arrangement of nn objects in a specific order using r objects at a time is called a permutation of nn objects taken rr objects at a time. It is written as nnPPrr and the formula is given by

nnPPrr = n! / (n – r)! = n! / (n – r)!.

Page 18: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-194-19 4-3 Permutations -4-3 Permutations - Example

How many different ways can a chairperson and an assistant chairperson be selected for a research project if there are seven scientists available?

Solution:Solution: Number of ways = 77PP22 = 7! / (7 – 2)! = 7! / (7 – 2)! = 7!/5! = 42= 7!/5! = 42.

Page 19: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-204-20 4-3 Permutations -4-3 Permutations - Example

How many different ways can four books be arranged on a shelf if they can be selected from nine books?

Solution:Solution: Number of ways =99PP44 = 9! / (9 – 4)! = 9! / (9 – 4)! = 9!/5! = 3024= 9!/5! = 3024.

Page 20: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-214-21 4-3 Combinations4-3 Combinations Consider the possible arrangements of the

letters aa, bb, and cc. The possible arrangements are: abc, acb, abc, acb,

bac, bca, cab, cba.bac, bca, cab, cba. If the order of the arrangement is not order of the arrangement is not

importantimportant then we say that each arrangement is the same. We say there is one combination of the three letters.

Page 21: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-224-22 4-3 Combinations4-3 Combinations

Combination Rule :Combination Rule : The number of combinations of of rr objects from nn objects is denoted by nnCCrr and the formula is given by

nnCCrr = n! / [(n – r)!r!] = n! / [(n – r)!r!] .

Page 22: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-234-23 4-3 Combinations -4-3 Combinations - Example

How many combinations of four objects are there taken two at a time?

Solution:Solution: Number of combinations: 44CC22 = 4! / [(4 – 2)! = 4! / [(4 – 2)! 2!] = 4!/[2!2!] = 6.2!] = 4!/[2!2!] = 6.

Page 23: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-244-24 4-3 Combinations -4-3 Combinations - Example

In order to survey the opinions of customers at local malls, a researcher decides to select 5 malls from a total of 12 malls in a specific geographic area. How many different ways can the selection be made?

Solution:Solution: Number of combinations: 1212CC55

= 12! / [(12 – 5)!= 12! / [(12 – 5)! 5!] = 12!/[7!5!] = 792.5!] = 12!/[7!5!] = 792.

Page 24: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-254-25 4-3 Combinations -4-3 Combinations - Example

In a club there are 7 women and 5 men. A committee of 3 women and 2 men is to be chosen. How many different possibilities are there?

Solution:Solution: Number of possibilities: (number of ways of selecting 3 women from 7) (number of ways of selecting 2 men from 5) = 77CC33 55CC22 = (35)(10) = 350. = (35)(10) = 350.

Page 25: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-264-26 4-3 Combinations -4-3 Combinations - Example

A committee of 5 people must be selected from 5 men and 8 women. How many ways can the selection be made if there are at least 3 women on the committee?

Page 26: © The McGraw-Hill Companies, Inc., 2000 4-1 Chapter 4 Counting Techniques

© The McGraw-Hill Companies, Inc., 2000

4-274-274-3 Combinations -4-3 Combinations - Example

Solution:Solution: The committee can consist of 3 women and 2 men, or 4 women and 1 man, or 5 women. To find the different possibilities, find each separately and then add them: 88CC33 55CC22 + + 88CC44 55CC11

+ + 88CC55 55CC00= (56)(10) + (70)(5) + (56)(1) = = (56)(10) + (70)(5) + (56)(1) =

966.966.