Transcript
Page 1: Counting Principals, Permutations, and Combinations

COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS

Page 2: Counting Principals, Permutations, and Combinations

A COUNTING PROBLEM ASKS “HOW MANY WAYS” SOME EVENT CAN OCCUR.

Ex. 1: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated?

One way to solve is to list all possibilities.

Page 3: Counting Principals, Permutations, and Combinations

Ex. 2: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence?

Next slide

Page 4: Counting Principals, Permutations, and Combinations

a

b

c

c

c

b

b

a

a

•Another way to solve is a factor tree where the number of end branches is your answer.

Count the number of branches to determine the number of ways.

There are six different ways to give the rewards.

Page 5: Counting Principals, Permutations, and Combinations

FUNDAMENTAL COUNTING PRINCIPLE

Suppose that a certain procedure P can be broken into n successive ordered stages, S1, S2, . . . Sn, and suppose that

S1 can occur in r1 ways. S2 can occur in r2 ways. Sn can occur in rn ways.

Then the number of ways P can occur is nrrr 21

Page 6: Counting Principals, Permutations, and Combinations

Ex. 2 Revisited: An experimental psychologist uses a sequence of two food rewards in an experiment regarding animal behavior. These two rewards are of three different varieties. How many different sequences of rewards are there if each variety can be used only once in each sequence?Using the fundamental counting principle:

3 2X1st reward 2nd reward

Page 7: Counting Principals, Permutations, and Combinations

PERMUTATIONS

An r-permutation of a set of n elements is an ordered selection of r elements from the set of n elements

!!rn

nPrn

! means factorial

Ex. 3! = 3∙2∙1

0! = 1

Page 8: Counting Principals, Permutations, and Combinations

Ex. 1 Revisited: How many three-letter codes are there using letters A, B, C, and D if no letter can be repeated?

Note: The order does matter

24!1!4

34 P

Page 9: Counting Principals, Permutations, and Combinations

COMBINATIONS

The number of combinations of n elements taken r at a time is

!!!

rnrnCrn

Where n & r are nonnegative integers & r < n

Order does NOT matter!

Page 10: Counting Principals, Permutations, and Combinations

Ex. 3: How many committees of three can be selected from four people? Use A, B, C, and D to represent the peopleNote: Does the order matter?

4!1!3!4

34 C

Page 11: Counting Principals, Permutations, and Combinations

Ex. 4: How many ways can the 4 call letters of a radio station be arranged if the first letter must be W or K and no letters repeat?

600,272324252

Page 12: Counting Principals, Permutations, and Combinations

Ex. 5: In how many ways can a class of 25 students elect a president, vice-president, and secretary if no student can hold more than one office?

800,13325 P

Page 13: Counting Principals, Permutations, and Combinations

Ex. 6: How many five-card hands are possible from a standard deck of cards?

960,598,2552 C

Page 14: Counting Principals, Permutations, and Combinations

Ex. 7: In how many ways can 9 horses place 1st, 2nd, or 3rd in a race?

50439 P

Page 15: Counting Principals, Permutations, and Combinations

Ex. 8: Suppose there are 15 girls and 18 boys in a class. In how many ways can 2 girls and 2 boys be selected for a group project?

15C2 × 18C2 = 16,065