8.3 Probability Applications of Counting Principles

Transcription

1 8. Probability Applications of Counting Principles In this section, we will see how we can apply the counting principles from the previous two sections in solving probability problems. Many of the probability problems involving dependent events that were solved earlier by using tree diagrams can also be solved by using permutations and combinations. Permutations and combinations are especially helpful when the numbers involved are large. To compare the method of using permutations and combinations with the method of tree diagrams used in Section 7.5, the first example repeats Example 8 from that section. (It is a good idea to review that example from section 7.5 before/after going through the following example.) Example. The Environmental Protection Agency is considering inspecting 6 plants for environmental compliance: in Chicago, in Los Angeles, and in New York. Due to a lack of inspectors, they decide to inspect two plants selected at random, one this month and one next month, with each plant equally likely to be selected, but no plant selected twice. What is the probability that Chicago plant and Los Angeles plant are selected? Solution. We note that, although the plants are selected one at a time, with one labeled as the first plant and the other as the second, the probability that Chicago plant and Los Angeles plant are selected should not depend upon the order in which the plants are selected (the outcomes, Chicago followed by Los Angeles, and Los Angeles followed by Chicago are both contained in the required event). So, we may use combinations. The number of ways to select Chicago plant out of Chicago plants and Los Angeles plant out of Los Angeles plants is ( ) ( ) = = 6. The number of ways to select any plants out of 6 is ( ) 6 = 6!!! = 6 5!! = 6 5 = 5. Thus, the probability that Chicago plant and Los Angeles plant are selected is This agrees with the answer found earlier. 6 5 = 5. Example. From a group of nurses, are to be selected to present a list of grievances to management. (a) In how many ways can this be done? Solution. nurses can be selected from a group of in combinations, since the group of is an unordered set.) ( ) =! 0 9 8! = = 8!! 8! There are 75 ways to choose nurses from. ( ) 0 9 ways. = 75. (We use Fall 00 Page Penn State University

2 (b) One of the nurses is Julie Davis. Find the probability that Davis will be among the selected. Solution. The probability that Davis will be selected is given by n(e) n(s), where E is the event that the chosen group includes Davis, and S is the sample space for the experiment of choosing a group of nurses. ( ) There is only = way to choose Davis. The number of ways that the other nurses can be chosen from the remaining nurses is ( ) =! 0 9 = = 0. 8!! Therefore, the probability that Davis will be one of the chosen is ( ) ( ) P (Davis is chosen) = P (E) = n(e) n(s) = ( ) = Notice that the two numbers in red in the numerator, and, add up to the number in red in the denominator,. This indicates that nurses have been split into two groups, one of size (Davis) and the other of size (the other nurses). Similarly, the green numbers indicate that the nurses chosen consist of two groups of size (Davis) and size (the other nurses chosen). (c) Find the probability that Davis will not be selected. Solution. The probability that Davis will not be chosen is P (E) = 0.88 = Remark. The problems in the previous two sections 8. and 8. of this chapter asked how many ways a certain operation can be done. The problems in this section ask what is the probability that a certain event occurs; the solution involves answering questions about how many ways the event and the operation can be done. If a problem asks how many ways something can be done, the answer must be a nonnegative integer. If a problem asks for a probability, the answer must be a number between 0 and. Example. When shipping diesel engines abroad, it is common to pack engines in one container that is then loaded on a rail car and sent to a port. Suppose that a company has received complaints from its customers that many of the engines arrive in nonworking condition. To help solve this problem, the company decides to make a spot check of containers after loading. The company will test engines from the container at random; if any of the are nonworking, the container will not be shipped until each engine in it is checked. Suppose that a given container has nonworking engines. Find the probability that container will not be shipped. Fall 00 Page Penn State University

3 Solution. The container will not be shipped if the sample of engines contains at least defective engine, that is, or defective engines (note that the container contains only defective engines). If P ( defective) represents that probability of exactly defective engine in the sample, then There are P (not shipping) = P ( defective) + P ( defective). ( ) ways to choose the engines for testing: ( ) ( ) =! 9!! = 0. There are ways of choosing defective engine from the in the container, and for each ( ) 0 of these ways there are ways of choosing good engines from among the 0 good engines in the container. By the multiplication principle, there are ( ) ( ) 0 =!!! 0! = 5 = 90 8!! ways to choose a sample of engines containing defective engine. Thus, ( ) There are ( ) 0 container, and P ( defective) = 90 0 = 9. ways of choosing defective engines from the defective engines in the there are ( ) ways of choosing good engine from among the 0 good engines. Thus ( ) 0 = 0 = 0 ways of choosing a sample of engines containing defective engines. So, Finally, P ( defective) = 0 0 =. P (not shipping) = P ( defective) + P ( defective) = ( ) ( ) 0 ( ) + ( ) ( ) 0 ) ( = 9 + = Fall 00 Page Penn State University

4 Remark. Observe that in Example, the complement of finding or defective engines is finding 0 defective engines. Then instead of finding the sum P ( defective) + P ( defective), the result in Example could be found as P (0 defective). P (not shipping) = P (0 defective) = = 0 0 ( ) ( ) 0 0 ( ) = 0 0 = Example. In a common form of the card game poker, a hand of 5 cards is dealt to each player from a deck of 5 cards. There are a total of ( ) 5 = 5! =, 598, ! 5! such hands possible. Find the probability of getting each of the following hands. (a) A hand containing only hearts, called a heart flush. Solution. There are hearts, and 5 = 9 other cards in a deck. Thus there are ( ) ( ) 9 =! 0 9 = = ! 5! 5 different hands containing only hearts. Hence, the probability of a heart flush is ( ) ( ) P (heart flush) = ( ) = 5, 598, (b) A flush of any suit (5 cards of the same suit). Solution. There are suits in a deck, so P (flush) = P (heart flush) = (c) A full house of aces and eights ( aces and eights). Fall 00 Page Penn State University

5 ( ) Solution. There are ways to choose aces from among the in the deck, and ( ) ways to choose eights out of the in the deck. Thus, ( ) ( ) ( ) 0 P ( aces, eights) = ( ) = 6 5, 598, (d) Any full house ( cards of one value, of another). Solution. There are values in a deck King, Queen, Jack, 0, 9, 8, 7, 6, 5,, (,, ) Ace, and cards of each value. Thus, there are choices for the first value, and ways to choose cards from among the cards that have that value. This leaves choices for the second value (order is important here, since a full house of aces, and eights is not the same as a full house of eights, ( and ) aces). From the cards that have the second value, cards can be chosen in ways. The probability of any full house is then ( ) ( ) P (full house) = 0.00., 598, 960 Example 5. A music teacher has violin pupils, Fred, Carl, and Helen. For a recital, the teacher selects a first violinist and a second violinist. The third pupil will play with the others, but not solo. If the teacher selects randomly, what is the probability that Helen is first violinist, Carl is second violinist, and Fred does not solo? Solution. We use permutations to find the number of arrangements in the sample space. P (, ) =! = 6 (We can think of this as filling the positions of the first violin, second violin, and no solo.) The 6 arrangements are equally likely, since the teacher will select randomly. Now there is only one arrangement where Helen is first violinist, Card is second violinist, and Fred does not solo. Thus, the required probability is 6. Example 6. Suppose a group of n people is in a room. Find the probability that at least of the people have the same birthday. Solution. Same birthday refers to the month and the day, not necessarily the same year. Also, we ignore leap years, and assume that each day in the year is equally likely as a birthday. To see how to proceed, we look at the case in which n = 5 and find the probability Fall 00 Page 5 Penn State University

6 that no people from among the 5 people have the same birthday. There are 65 different birthdays possible for the first of the 5 people, 6 for the second (so that the people have different birthdays), 6 for the third, and so on. The number of ways that 5 people can have different birthdays is thus the number of permutations of 65 days taken 5 at a time or P (65, 5) = The number of ways that 5 people can have the same or different birthdays is = (65) 5. Finally, the probability that none of the 5 people have the same birthday is P (65, 5) 65 5 = Thus, the probability that at least of the 5 people do have the same birthday is = Now this result can be extended to more than 5 people. Generalizing, the probability that no people among n people have the same birthday is P (65, n) 65 n. Therefore, the probability that at least of the n people do have the same birthday is P (65, n) 65 n. The following table shows this probability for various values of n. Number of People, Probability That Two n Have the Same Birthday > 65 The probability that people among have the same birthday is 0.507, a little over half. This is quite surprising! Fall 00 Page 6 Penn State University

7 Example 7. Ray and Nate are arranging a row of fruit at random on a table. They have 5 apples, 6 oranges, and 7 lemons. What is the probability that all fruit of the same kind are together? Solution. Method : Ray can t tell individual pieces of fruit of the same kind apart. All apples look the same to him, as do all oranges and all lemons. So, in the denominator of the probability, he calculates the number of distinguishable ways to arrange the = 8 pieces of fruit, given that all apples are indistinguishable, as are all oranges and all lemons. 8! 5! 6! 7! =, 70, 688 As for the numerator, the only choice is how to arrange the kinds of fruit, for which there are! = 6 ways. Thus P (all fruit of the same kind are together) = 6, 70, 688 = Method : Nate has better eyesight than Ray and can tell the individual pieces of fruit apart. So in the denominator of the probability, he calculates the number of ways to arrange the 8 pieces of fruit, which is 8! = For the numerator he must choose how to arrange the kinds of fruit, for which there are! ways. Then there are 5! ways to arrange the apples, 6! ways to arrange the oranges, and 7! ways to arrange the lemons, for a total number of possibilities of Therefore,! 5! 6! 7! =, 6, 76, 000. P (all fruit of the same kind are together) =, 6, 76, = The results for Method and Method are the same. The probability does not depend on whether a person can distinguish individual pieces of the same kind of fruit. Fall 00 Page 7 Penn State University