Exam (elaborations) TEST BANK FOR A First Course In Probability 7th Edition By Sheldon Ross (Solution Manual)

Exam (elaborations) TEST BANK FOR A First Course In Probability 7th Edition By Sheldon Ross (Solution Manual) Solutions Manual A First Course in PROBABILITY Seventh Edition Sheldon Ross Prentice Hall, Upper Saddle River NJ 07458 Table of Contents Chapter 1 ..............................................................................1 Chapter 2 ..............................................................................10 Chapter 3 ..............................................................................20 Chapter 4 ..............................................................................46 Chapter 5 ..............................................................................64 Chapter 6 ..............................................................................77 Chapter 7 ..............................................................................98 Chapter 8 ..............................................................................133 Chapter 9 ..............................................................................139 Chapter 10 ............................................................................141 Chapter 1 1 Chapter 1 Problems 1. (a) By the generalized basic principle of counting there are 26 ⋅ 26 ⋅ 10 ⋅ 10 ⋅ 10 ⋅ 10 ⋅ 10 = 67,600,000 (b) 26 ⋅ 25 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6 = 19,656,000 2. 64 = 1296 3. An assignment is a sequence i1, …, i20 where ij is the job to which person j is assigned. Since only one person can be assigned to a job, it follows that the sequence is a permutation of the numbers 1, …, 20 and so there are 20! different possible assignments. 4. There are 4! possible arrangements. By assigning instruments to Jay, Jack, John and Jim, in that order, we see by the generalized basic principle that there are 2 ⋅ 1 ⋅ 2 ⋅ 1 = 4 possibilities. 5. There were 8 ⋅ 2 ⋅ 9 = 144 possible codes. There were 1 ⋅ 2 ⋅ 9 = 18 that started with a 4. 6. Each kitten can be identified by a code number i, j, k, l where each of i, j, k, l is any of the numbers from 1 to 7. The number i represents which wife is carrying the kitten, j then represents which of that wife’s 7 sacks contain the kitten; k represents which of the 7 cats in sack j of wife i is the mother of the kitten; and l represents the number of the kitten of cat k in sack j of wife i. By the generalized principle there are thus 7 ⋅ 7 ⋅ 7 ⋅ 7 = 2401 kittens 7. (a) 6! = 720 (b) 2 ⋅ 3! ⋅ 3! = 72 (c) 4!3! = 144 (d) 6 ⋅ 3 ⋅ 2 ⋅ 2 ⋅ 1 ⋅ 1 = 72 8. (a) 5! = 120 (b) 2!2! 7! = 1260 (c) 4!4!2! 11! = 34,650 (d) 2!2! 7! = 1260 9. 6!4! (12)! = 27,720 10. (a) 8! = 40,320 (b) 2 ⋅ 7! = 10,080 (c) 5!4! = 2,880 (d) 4!24 = 384 2 Chapter 1 11. (a) 6! (b) 3!2!3! (c) 3!4! 12. (a) 305 (b) 30 ⋅ 29 ⋅ 28 ⋅ 27 ⋅ 26 13.      2 20 14.      5 52 15. There are          5 12 5 10 possible choices of the 5 men and 5 women. They can then be paired up in 5! ways, since if we arbitrarily order the men then the first man can be paired with any of the 5 women, the next with any of the remaining 4, and so on. Hence, there are        5 12 5 5! 10 possible results. 16. (a)     +      +       2 4 2 7 2 6 = 42 possibilities. (b) There are 6 ⋅ 7 choices of a math and a science book, 6 ⋅ 4 choices of a math and an economics book, and 7 ⋅ 4 choices of a science and an economics book. Hence, there are 94 possible choices. 17. The first gift can go to any of the 10 children, the second to any of the remaining 9 children, and so on. Hence, there are 10 ⋅ 9 ⋅ 8 ⋅ ⋅ ⋅ 5 ⋅ 4 = 604,800 possibilities. 18.              3 4 2 6 2 5 = 600 19. (a) There are             +           2 4 1 2 3 8 3 4 3 8 = 896 possible committees. There are          3 4 3 8 that do not contain either of the 2 men, and there are              2 4 1 2 3 8 that contain exactly 1 of them. (b) There are             +          3 6 2 6 1 2 3 6 3 6 = 1000 possible committees. Chapter 1 3 (c) There are         +          +           2 5 3 7 3 5 2 7 3 5 3 7 = 910 possible committees. There are          3 5 3 7 in which neither feuding party serves;          3 5 2 7 in which the feuding women serves; and         2 5 3 7 in which the feuding man serves. 20.     +              +       3 6 5 , 6 4 6 1 2 5 6 21. 3!4! 7! = 35. Each path is a linear arrangement of 4 r’s and 3 u’s (r for right and u for up). For instance the arrangement r, r, u, u, r, r, u specifies the path whose first 2 steps are to the right, next 2 steps are up, next 2 are to the right, and final step is up. 22. There are 2!2! 4! paths from A to the circled point; and 2!1! 3! paths from the circled point to B. Thus, by the basic principle, there are 18 different paths from A to B that go through the circled piont. 23. 3!23 25.      13, 13, 13, 13 52 27. 3!4!5! 12! 3, 4, 5 12 =      28. Assuming teachers are distinct. (a) 48 (b) (2)4 8! 2,2,2,2 8 =      = 2520. 29. (a) (10)!/3!4!2! (b) 4!2! 7! 2 3 3     30. 2 ⋅ 9! − 228! since 2 ⋅ 9! is the number in which the French and English are next to each other and 228! the number in which the French and English are next to each other and the U.S. and Russian are next to each other. 4 Chapter 1 31. (a) number of nonnegative integer solutions of x1 + x2 + x3 + x4 = 8. Hence, answer is      3 11 = 165 (b) here it is the number of positive solutions—hence answer is      3 7 = 35 32. (a) number of nonnegative solutions of x1 + … + x6 = 8 answer =      5 13 (b) (number of solutions of x1 + … + x6 = 5) × (number of solutions of x1 + … + x6 = 3) =         5 8 5 10 33. (a) x1 + x2 + x3 + x4 = 20, x1 ≥ 2, x2 ≥ 2, x3 ≥ 3, x4 ≥ 4 Let y1 = x1 − 1, y2 = x2 − 1, y3 = x3 − 2, y4 = x4 − 3 y1 + y2 + y3 + y4 = 13, yi > 0 Hence, there are      3 12 = 220 possible strategies. (b) there are      2 15 investments only in 1, 2, 3 there are      2 14 investments only in 1, 2, 4 there are      2 13 investments only in 1, 3, 4 there are      2 13 investments only in 2, 3, 4     2 15 +      2 14 +     +       3 12 2 2 13 = 552 possibilities Chapter 1 5 Theoretical Exercises 2. Σ = i m i 1n 3. n(n − 1) ⋅ ⋅ ⋅ (n − r + 1) = n!/(n − r)! 4. Each arrangement is determined by the choice of the r positions where the black balls are situated. 5. There are      j n different 0 − 1 vectors whose sum is j, since any such vector can be characterized by a selection of j of the n indices whose values are then set equal to 1. Hence there are     Σ  = j n n j k vectors that meet the criterion. 6.      k n 7.      − − +      − 1 1 1 r n r n = ( )!( 1)! ( 1)! !( 1 )! ( 1)! − − − + − − − n r r n r n r n =     =      + − − r n n r n n r r n r n !( )! ! 8. There are      + r n m gropus of size r. As there are      −      r i m i n groups of size r that consist of i men and r − i women, we see that Σ=     −     =       + r i r i m i n r n m 0 . 9.      −     =       Σ= n i n i n n n n i 0 2 = 2 0 Σ=   n  i i n 10. Parts (a), (b), (c), and (d) are immediate. For part (e), we have the following:    k k n = ( )!( 1)! ! ( )! ! ! ! − − = − n k k n n k k k n     − − + 1 ( 1) k n k n = ( )!( 1)! ! ( 1)!( 1)! ( 1) ! − − = − + − − + n k k n n k k n k n     − − 1 1 k n n = ( )!( 1)! ! ( )!( 1)! ( 1)! − − = − − − n k k n n k k n n 6 Chapter 1 11. The number of subsets of size k that have i as their highest numbered member is equal to     − − 1 1 k i , the number of ways of choosing k − 1 of the numbers 1, …, i − 1. Summing over i yields the number of subsets of size k. 12. Number of possible selections of a committee of size k and a chairperson is      k k n and so Σ=    n  k k k n 1 represents the desired number. On the other hand, the chairperson can be anyone of the n persons and then each of the other n − 1 can either be on or off the committee. Hence, n2n − 1 also represents the desired quantity. (i) k k 2 n     (ii) n2n − 1 since there are n possible choices for the combined chairperson and secretary and then each of the other n − 1 can either be on or off the committee. (iii) n(n − 1)2n − 2 (c) From a set of n we want to choose a committee, its chairperson its secretary and its treasurer (possibly the same). The result follows since (a) there are n2n − 1 selections in which the chair, secretary and treasurer are the same person. (b) there are 3n(n − 1)2n − 2 selection in which the chair, secretary and treasurer jobs are held by 2 people. (c) there are n(n − 1)(n − 2)2n − 3 selections in which the chair, secretary and treasurer are all different. (d) there are k k3 n     selections in which the committee is of size k. 13. (1 − 1)n = Σ= − −     n  i n i n 0 ( 1) 1 14. (a)      − −    =           j i n i i n i j j n (b) From (a),        Σ=i j j n n j i = n i n j i i n j n i i n − =    =       − −     Σ 2 1 (c) n j n j i i j j n− = −       Σ  ( 1) = n j n j i j n i i n − = −      − −     Σ ( 1) 1 = n i k n i k k n i i n − − − = −      −     Σ ( 1) 0 = 0 Chapter 1 7 15. (a) The number of vectors that have xk = j is equal to the number of vectors x1 ≤ x2 ≤ … ≤ xk−1 satisfying 1 ≤ xi ≤ j. That is, the number of vectors is equal to Hk−1(j), and the result follows. (b) H2(1) = H1(1) = 1 H2(2) = H1(1) + H1(2) = 3 H2(3) = H1(1) + H1(2) + H1(3) = 6 H2(4) = H1(1) + H1(2) + H1(3) + H1(4) = 10 H2(5) = H1(1) + H1(2) + H1(3) + H1(4) + H1(5) = 15 H3(5) = H2(1) + H2(2) + H2(3) + H2(4) + H2(5) = 35 16. (a) 1 < 2 < 3, 1 < 3 < 2, 2 < 1 < 3, 2 < 3 < 1, 3 < 1 < 2, 3 < 2 < 1, 1 = 2 < 3, 1 = 3 < 2, 2 = 3 < 1, 1 < 2 = 3, 2 < 1 = 3, 3 < 1 = 2, 1 = 2 = 3 (b) The number of outcomes in which i players tie for last place is equal to      i n , the number of ways to choose these i players, multiplied by the number of outcomes of the remaining n − i players, which is clearly equal to N(n − i). (c) Σ= −     n  i n N i n 1 ) 1 ( = Σ= −      − n i n i N n i n 1 ( ) = Σ− =    1  0 ( ) n j j N j n where the final equality followed by letting j = n − i. (d) N(3) = 1 + 3N(1) + 3N(2) = 1 + 3 + 9 = 13 N(4) = 1 + 4N(1) + 6N(2) + 4N(3) = 75 17. A choice of r elements from a set of n elements is equivalent to breaking these elements into two subsets, one of size r (equal to the elements selected) and the other of size n − r (equal to the elements not selected). 18. Suppose that r labelled subsets of respective sizes n1, n2, …, nr are to be made up from elements 1, 2, …, n where n = Σ= r i ni 1 . As         − i − nr n n n ,... 1 1,..., 1 represents the number of possibilities when person n is put in subset i, the result follows. 8 Chapter 1 19. By induction: (x1 + x2 + … + xr)n = 1 1 1 1 ( 2 ... ) 0 1 n i r i n i i x x x n − = + +     Σ by the Binomial theorem = 1 1 1 0 1 i n i i x n Σ=     i2 ,...,ir Σ...Σ 2 ... 2 ,..., 1 2 1 ir i r x x i i n i     − i2 +...+ir =n−i1 = i1,...,ir ΣΣ...Σ rir i r i i x x n ... ,..., 1 1 1     i1+i2 +...+ir =n where the second equality follows from the induction hypothesis and the last from the identity     =       −     n i ir n i i n i i n 2 ,..., 1,..., 1 1 . 20. The number of integer solutions of x1 + … + xr = n, xi ≥ mi is the same as the number of nonnegative solutions of y1 + … + yr = n − Σr mi 1 , yi ≥ 0. Proposition 6.2 gives the result           − −Σ + − 1 1 1 r n m r r i . 21. There are      k r choices of the k of the x’s to equal 0. Given this choice the other r − k of the x’s must be positive and sum to n. By Proposition 6.1, there are      − + − =      − − − n r k n r k n 1 1 1 such solutions. Hence the result follows. 22.      − + − 1 1 n n r by Proposition 6.2. Chapter 1 9 23. There are      + − j n j 1 nonnegative integer solutions of Σ= = n i xi j 1 Hence, there are      + − Σ = j n k j j 1 0 such vectors. 10 Chapter 2 Chapter 2 Problems 1. (a) S = {(r, r), (r, g), (r, b), (g, r), (g, g), (g, b), (b, r), b, g), (b, b)} (b) S = {(r, g), (r, b), (g, r), (g, b), (b, r), (b, g)} 2. S = {(n, x1, …, xn−1), n ≥ 1, xi ≠ 6, i = 1, …, n − 1}, with the interpretation that the outcome is (n, x1, …, xn−1) if the first 6 appears on roll n, and xi appears on roll, i, i = 1, …, n − 1. The event c ( n 1En ) ∞ = ∪ is the event that 6 never appears. 3. EF = {(1, 2), (1, 4), (1, 6), (2, 1), (4, 1), (6, 1)}. E ∪ F occurs if the sum is odd or if at least one of the dice lands on 1. FG = {(1, 4), (4, 1)}. EFc is the event that neither of the dice lands on 1 and the sum is odd. EFG = FG. 4. A = {1,0001,, …} B = {01, 00001, , …} (A ∪ B)c = {00000 …, 001, , …} 5. (a) 25 = 32 (b) W = {(1, 1, 1, 1, 1), (1, 1, 1, 1, 0), (1, 1, 1, 0, 1), (1, 1, 0, 1, 1), (1, 1, 1, 0, 0), (1, 1, 0, 1, 0) (1, 1, 0, 0, 1), (1, 1, 0, 0, 0), (1, 0, 1, 1, 1), (0, 1, 1, 1, 1), (1, 0, 1, 1, 0), (0, 1, 1, 1, 0), (0, 0, 1, 1, 1) (0, 0, 1, 1, 0), (1, 0, 1, 0, 1)} (c) 8 (d) AW = {(1, 1, 1, 0, 0), (1, 1, 0, 0, 0)} 6. (a) S = {(1, g), (0, g), (1, f), (0, f), (1, s), (0, s)} (b) A = {(1, s), (0, s)} (c) B = {(0, g), (0, f), (0, s)} (d) {(1, s), (0, s), (1, g), (1, f)} 7. (a) 615 (b) 615 − 315 (c) 415 8. (a) .8 (b) .3 (c) 0 9. Choose a customer at random. Let A denote the event that this customer carries an American Express card and V the event that he or she carries a VISA card. P(A ∪ V) = P(A) + P(V) − P(AV) = .24 + .61 − .11 = .74. Therefore, 74 percent of the establishment’s customers carry at least one of the two types of credit cards that it accepts. Chapter 2 11 10. Let R and N denote the events, respectively, that the student wears a ring and wears a necklace. (a) P(R ∪ N) = 1 − .6 = .4 (b) .4 = P(R ∪ N) = P(R) + P(N) − P(RN) = .2 + .3 − P(RN) Thus, P(RN) = .1 11. Let A be the event that a randomly chosen person is a cigarette smoker and let B be the event that she or he is a cigar smoker. (a) 1 − P(A ∪ B) = 1 − (.07 + .28 − .05) = .7. Hence, 70 percent smoke neither. (b) P(AcB) = P(B) − P(AB) = .07 − .05 = .02. Hence, 2 percent smoke cigars but not cigarettes. 12. (a) P(S ∪ F ∪ G) = (28 + 26 + 16 − 12 − 4 − 6 + 2)/100 = 1/2 The desired probability is 1 − 1/2 = 1/2. (b) Use the Venn diagram below to obtain the answer 32/100. 14 10 10 S F 8 G 2 4 2 (c) since 50 students are not taking any of the courses, the probability that neither one is taking a course is          2 100 2 50 = 49/198 and so the probability that at least one is taking a course is 149/198. 13. (a) 20,000 (b) 12,000 (c) 11,000 (d) 68,000 (e) 10,000 I II 0 III 1000 12 Chapter 2 14. P(M) + P(W) + P(G) − P(MW) − P(MG) − P(WG) + P(MWG) = .312 + .470 + .525 − .086 − .042 − .147 + .025 = 1.057 15. (a)          5 52 5 4 13 (b)                          5 52 1 4 1 4 1 4 3 12 2 4 13 (c)                      5 52 1 44 2 4 2 4 2 13 (d)                      5 52 1 4 1 4 2 12 3 13 4 (e)              5 52 1 48 4 4 13 16. (a) 65 6 ⋅5⋅ 4 ⋅3⋅ 2 (b) 65 5 4 3 2 6 5 ⋅ ⋅      (c) 65 2 3 2 4 5 2 6             (d) 21 3 6 5 4 5    ⋅ ⋅  (e) 65 3 5 5 6     ⋅  (f) 65 4 6 5 5    ⋅  (g) 65 6 17. 64 63 58 8 1 2 ⋅ ⋅ ⋅ ⋅ Π i=i 18. 52 51 2 4 16 ⋅ ⋅ ⋅ 19. 4/36 + 4/36 +1/36 + 1/36 = 5/18 20. Let A be the event that you are dealt blackjack and let B be the event that the dealer is dealt blackjack. Then, P(A ∪ B) = P(A) + P(B) − P(AB) = 4 4 16 3 15 52 51 4 4 16 ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ + ⋅ ⋅ ⋅ = .0983 where the preceding used that P(A) = P(B) = 2 × 52 51 4 16 ⋅ ⋅ . Hence, the probability that neither is dealt blackjack is .9017. Chapter 2 13 21. (a) p1 = 4/20, p2 = 8/20, p3 = 5/20, p4 = 2/20, p5 = 1/20 (b) There are a total of 4 ⋅ 1 + 8 ⋅ 2 + 5 ⋅ 3 + 2 ⋅ 4 + 1 ⋅ 5 = 48 children. Hence, q1 = 4/48, q2 = 16/48, q3 = 15/48, q4 = 8/48, q5 = 5/48 22. The ordering will be unchanged if for some k, 0 ≤ k ≤ n, the first k coin tosses land heads and the last n − k land tails. Hence, the desired probability is (n + 1/2n 23. The answer is 5/12, which can be seen as follows: 1 = P{first higher} + P{second higher} + p{same} = 2P{second higher} + p{same} = 2P{second higher} + 1/6 Another way of solving is to list all the outcomes for which the second is higher. There is 1 outcome when the second die lands on two, 2 when it lands on three, 3 when it lands on four, 4 when it lands on five, and 5 when it lands on six. Hence, the probability is (1 + 2 + 3 + 4 + 5)/36 = 5/12. 25. P(En) = 5 , ( ) 2 36 6 36 26 1 1 =      Σ∞ = − n n n P E 27. Imagine that all 10 balls are withdrawn P(A) = 10! 3⋅9!+7 ⋅ 6 ⋅3⋅ 7!+7 ⋅ 6 ⋅5⋅ 4 ⋅3⋅5!+7 ⋅ 6 ⋅ 5⋅ 4 ⋅3⋅ 2 ⋅3⋅3! 28. P{same} =        +      +       3 19 3 8 3 6 3 5 P{different} =                  3 19 1 8 1 6 1 5 If sampling is with replacement P{same} = 3 3 3 3 (19) 5 + 6 + 8 P{different} = P(RBG) + P{BRG) + P(RGB) + … + P(GBR) = (19)3 6 ⋅5⋅ 6 ⋅8 14 Chapter 2 29. (a) ( )( 1) ( 1) ( 1) + + − − + − n m n m n n m m (b) Putting all terms over the common denominator (n + m)2(n + m − 1) shows