3.4 Counting Principles

1. 3.4 Counting Principles

2. Objectives/Assignment • How to use the Fundamental Counting Principle to find the number of ways two or more events can occur. • How to find the number of ways a group of objects can be arranged in order. • How to find the number of ways to choose several objects from a group without regard to order. • How to use counting principles to find probabilities

3. The Fundamental Counting Principle • If one event can occur in m ways and a second event can occur in n ways, the number of ways the two events can occur in sequence is m ● n. This rule can be extended for any number of events occurring in sequence.

4. Example 1 • You are purchasing a new car. Using the following manufacturers, car sizes and colors, how many different ways can you select one manufacturer, one car size and one color? Manufacturer: Ford, GM, Chrysler Car size: small, medium Color: white(W), red(R), black(B), green(G)

5. Solution • There are three choices of manufacturer, two choices of car sizes, and four colors. So, the number of ways to select one manufacturer, one car size and one color is: 3 ●2●4 = 24 ways. A tree diagram can help you see why there are 24 options.

6. w w w w w w R R R R R R B B B B B B G G G G G G Tree diagram for Car Selections Chrysler Ford GM Small Medium Small Medium Small Medium Do you see now?

7. Ex. 2 Using the Fundamental Counting Principle • The access code for a car’s security system consists of four digits. Each digit can be 0 through 9. How many access codes are possible if: 1. each digit can be used only once and not repeated? 2. each digit can be repeated?

8. Solution to 1 1. each digit can be used only once and not repeated? Because each digit can only be used once, there are 10 choices for the first digit, 9 digits for the second, 8 choices left for the 3rd digit, and 7 for the fourth digit. Using the fundamental counting principle, you could conclude there are: 10●9●8●7 = 5040 possible access codes.

9. Solution to 2 2. Each digit can be repeated. Because each digit can be repeated, there are 10 choices for each of the four digits, So there are: 10●10●10●10 = 10,000 possible access codes.

10. Permutations • An important application of the Fundamental Counting Principle is determining the number of ways that n objects can be arranged in order or in a permutation. • Definition of permutation: An ordered arrangement of objects. The number of different permutations of n distinct objects is n!.

11. Permutations • The expression n! is read as n factorial and is defined as follows: n! = n ●(n -1)●(n -2)●(n-3) ● ● ● 3 ● 2 ● 1 As a special case, 0! = 1

12. Study Tip Here are several values of n!. 1! = 1 2! = 2 ● 1 = 2 3! = 3 ● 2 ● 1 = 6 4! = 4 ● 3 ● 2 ● 1 = 24 5! = 5 ● 4 ● 3 ● 2 ● 1 = 120 Notice that as n increases, n! becomes very large. Take some time now to learn how to use the factorial key on your calculator. On a TI-84, go to math|prb|4

13. Example 3: Finding the number of permutations of n objects • The starting lineup for a baseball team consists of nine players. How many different batting orders are possible using the starting lineup? Solution: the number of permutations is 9! 9! = 9 ● 8 ● 7 ● 6 ●5 ● 4 ● 3 ● 2 ● 1 = 362,880

14. Permutations of n objects taken r at a time • Suppose you want to choose some of the objects in a group and put them in order. Such an ordering is called a permutation of n objects taken r at a time. n P r Where r  n

15. Example 4: Finding n P r Find the number of ways of forming three-digit codes in which no digit is repeated. n P r = 10 P 3 There are 720 possible three-digit codes that do not have repeating digits.

16. Example 5: Finding n P r Forty-three race cars started the 2007 Daytona 500. How many ways can the cars finish first, second, and third? Because there are 43 race cars and order is important, the number of ways the cars can finish first, second, and third is: n P r = 43 P 3

17. Ordering same objects Suppose you want to order a group of n objects where some of the objects are the same. For instance, consider a group of letters consisting of four A’s, 2 B’s, and one C. How many ways can you order such a group? Using the previous formula, you might conclude the following: n P r = 7 P 7 = 7! However, because some of the objects are the same, not all of these permutations are distinguishable. How many distinguishable permutations are possible. The answer can be found using the formula on the next slide.

18. Distinguishable Permutations

19. Example 6: Distinguishable Permutations • A building contractor is planning to develop a subdivision. The subdivision consists of six one-story houses, four two-story houses, and two split-level houses. In how many distinguishable ways can the houses be arranged? Solution: There are to be twelve houses in the subdivision (6+4+2)

20. Example 6: Distinguishable Permutations

21. Combinations Suppose you want to buy three CD’s from a selection of five CD’s. There are 10 ways to make your selections ABC,ABD, ABE, ACD, ACE, ADE, BCD, BCE, BDE, CDE. In each selection, order does NOT matter. (ABC is the same set as BAC). The number of ways to choose r objects from n objects without regard to order is called the number of combinations of n objects taken r at a time.

22. Combination of Objects taken r at a time • A combination is a selection of r objects from a group of n objects without regard to order and is denoted by n C r. The number of combinations of r objects selected from a group of n objects is:

23. A state’s department of transportation plans to develop a new section of interstate highway and receives 16 bids for the project. The state plans to hire four of the bidding companies. How many different combinations of four companies can be selected from the 16 bidding companies? Because order is NOT important, there are: Example 7: Finding the number of combinations

24. Applications – Example 8 Finding Probabilities A word consists of one M, four I’s, four S’s, and two P’s. If the letters are randomly arranged in order, what is the probability that the arrangement spells the word Mississippi? Solution. There is one favorable outcome and there are There are 34,650 distinguishable permutations of the word Mississippi. So the probability that the arrangement spells the word Mississippi is:

25. Applications – Example 8 Finding Probabilities There are 34,650 distinguishable permutations of the word Mississippi. So the probability that the arrangement spells the word Mississippi is:

26. Applications – Example 9 Finding Probabilities Find the probability of being dealt five diamonds from a standard deck of playing cards. (In poker, this is a diamond flush.) SOLUTION: The possible number of way of choosing 5 diamonds out of 13 is 13C5. The number of possible 5 card hands is 52C5. So the probability of being dealt 5 diamonds is: