1. (1 point) 3. (1 point) (Note: This problem is similar to problem 6 in section 1.1 of your textbook.) (Note: This problem is similar to problems 1-3 in section 1.1 of your text.) Let U = {3, 4, 6, 7, 8}, A = {4, 7}, and B = {6, 8}. In each of the following questions, find the indicated set; give your answer in list form, i.e., the way that U, A, and B are given (remember to use braces). To indicate that a set is empty, write down braces with nothing inside them, i.e., {}. Let R = {v, q}, S = {s, y, r}, and T = {r, q, v, x, y}, For each of the following questions, enter T if the assertion is true, and enter F if the assertion is false. 1. R S ? (1) Find A0 . A0 = 2. R T ? (2) Find A0 B0 . A0 B0 = 3. S T ? 4. R S T ? (3) Find A B. AB = 5. v S T ? (4) Find (A B)0 . (A B)0 = 6. y S T ? (5) Find (A B)0 . (A B)0 = 2. (1 point) Rework problem 5 from section 1.1 of your text, involving subsets of a set A. Assume that the set A = {1, 2, 6, 8, 9}. (1) Let B = {8}. Note that B A. Find a subset C of A such / that B C = A and B C = 0. C= 4. (1 point) (Note: This problem is similar to problem 9 in section 1.1 of your textbook.) (2) Let D = {1, 6}. Note that D A. Find a subset E of A / such that D E = A and D E = 0. E= Let U = {5, 4, 3, 1, 0, 1, 3, 4, 6}, E = {5, 3, 0, 1}, F = {4, 3, 1, 1, 3}. and G = {4, 3, 1, 3, 4}. In each of the following questions, find the indicated set. To indicate that a set is empty, enter braces with nothing inside them, i.e., {}. (3) How many distinct pairs of disjoint non-empty subsets of A are there, the union of which is all of A? (1) Find E 0 . E0 = (2) Find F G0 . F G0 = 1 (3) Find (E F) G0 . (E F) G0 = (2) Find B C B C = (4) Find E (F G0 ) E (F G0 ) = (3) Find A0 A0 = 5. (1 point) Rework problem 10 from section 1.1 of your text. Use the following sets to answer the questions below. To indicate that a given set is empty, enter braces with nothing inside, e.g., {}. (4) Find (A B) (B C) (A B) (B C) = U = {4, 3, 1, 1, 3, 4} A = {3, 1, 3} B = {1, 3, 4} C = {3, 3} (5) Find A B0 A B0 = (6) Find A C0 A C0 = (1) Find A B AB = 7. (1 point) Work the following problem, similar to number 15 from sec-tion 1.1 of your text. Assume that A and Y are nonempty sub-sets of a universal set U. Assume further that their intersection is not empty, and that the intersection of their complements is not empty. Indicate whether each of the following set relations is always true, sometimes true, or never true. (2) Find B C B C = (3) Find A0 A0 = (4) Find (A B) (B C) (A B) (B C) = (1) A Y 0 A A. Always True B. Never True C. Sometimes True (5) Find (B A0 ) C0 (B A0 ) C0 = (2) Y A A A. Sometimes True B. Always True C. Never True 6. (1 point) Rework problem 11 from section 1.1 of your text. Use the following sets to answer the questions below. To indicate that a given set is empty, enter braces with nothing inside, e.g., {}. U = {7, 4, 1, 4, 7, 8} A = {7, 4, 1} B = {1, 4, 8} C = {4, 7, 8} (3) Y 0 A0 (Y A)0 A. Never True B. Sometimes True C. Always True (1) Find A B AB = (4) A0 Y 0 (A Y )0 A. Never True B. Always True 2 C. Sometimes True 10. (1 point) Rework problem 23 from section 1.1 of your text. Assume that you have a universal set U = {4, 3, 2, 2, 4, 6}, with subsets X, Y , and Z. Assume further that X Y = {3, 2, 2, 4, 6}, X Y = {2}, Y Z = {6}, Y 0 Z 0 = {2}, and Z 0 = {3, 2, 2}. 8. (1 point) Work the following problem, similar to number 19 from section 1.1 of your text. Let U = {3, 4, a, b, x, y, z} be a universal set with subsets A = {3, b, x, y}, Y = {3, 4, y}, and B = {3, 4, a, x}. Another subset of U is given by S = {3, 4, b, x, y}. Find X, Y , and Z. To indicate that a set is empty, enter braces with nothing between them, i.e., {}. (1) X = Which of the following sets are needed to express the set S? (2) Y = A. A' B. B C. Y' D. B' E. Y F. A (3) Z = 11. (1 point) Rework problem 25 from section 1.1 of your text, involving Cartesian products. Let A = {a, c, d, b, e}, and B = {b, e, f }. Answer the following questions instead of those posed in your book. (1) How many distinct elements are in A B? (2) How many distinct elements are in (A B) (B A) 9. (1 point) Rework problem 21 from section 1.1 of your text, involving subsets. (1) How many distinct subsets of { j} are there? (2) How many distinct subsets of {k, d, b} are there? 12. (1 point) Rework problem 27 from section 1.1 of your text, involving Cartesian products. Assume that AB = {(c, 5), (c, 7), (c, 6), (c, 4), (d 3 (1) How many distinct elements are in A? (2) How many distinct elements are in B? 4 1.2 1. (1 point) Use the Venn Diagram below to answer questions like those in problem 3 of section 1.2 of your textbook. In the Venn diagram, there are three sets - A, B, and C - and eight points - p, q, r, s, t, u, v, and w. To get an enlarged copy of the Venn diagram, click your mouse (left button) on (i.e., inside) the Venn diagram. (1) Which points are in C (A B)? (2) Which points are in (C A) B? (3) Which points are in A C0? (4) Which points are in A C0? (5) Which points are in (A B)0? (1) Which points are in A B? (6) Which points are in (A B)0? (2) Which points are in A C? (7) Which points are in A0 B0? (3) Which points are in B0? (8) Which points are in A0 B0? 3. (1 point) Rework problem 11 from section 1.2 of your text, about the disjoint subsets A and B of a universal set U, except assume that n(U) = 115, n(A) = 50, and n(B) = 40. Then n ((A B)0 ) = 2. (1 point) Use the Venn Diagram below to answer questions like those in problem 3 of section 1.2 of your textbook. In the Venn diagram, there are three sets - A, B, and C - and eight points - p, q, r, s, t, u, v, and w. To get an enlarged copy of the Venn diagram, click your mouse (left button) on (i.e., inside) the Venn diagram. 1 8. (1 point) Look back to problem 24 from section 1.2 of your text. Suppose that n(A) = 6, n(B) = 14, and n(C) = 21. 4. (1 point) Rework problem 12 from section 1.2 of your text, about disjoint subsets A and B of a universal set U, except assume that n(U) = 80, n(A) = 15, and n(B) = 35. . Then n (A0 B) = 5. (1 point) (Note: This problem is similar to problem 13 in section 1.2 of your text.) (a) n(A B C) = . (b) n(B B B) = . 9. (1 point) Rework problem 27 from section 1.2 of your textbook, about the three subsets X1 , X2 , and X3 that partition a set X, except assume that the number of elements in X1 is 3 times the number of elements in X2 , the number of elements in X3 is 6 times the number of elements in X2 , and n(X) = 90. Let U be a universal set with disjoint subsets A and B such that n(A) = 41, n(A0 ) = 45, and n(B0 ) = 66. Find the number of elements in A B. (1) n(X1 ) = (2) n(X2 ) = n(A B) = (3) n(X3 ) = 6. (1 point) Rework problem 19 from section 1.2 of your text, except assume that A = {2, 0, e, c} and B = {2, 5, b}. (a) n(A B) = (b) n(B B B) = . . 7. (1 point) Rework problem 23 from section 1.2 of your textbook, about the subsets A B C of a universal set U, except assume that n(A) = 5 and n(C) = 11. 10. (1 point) Rework problem 29 from section 1.2 of your textbook, about the six subsets X1 , X2 , X3 , X4 , X5 , and X6 that partition a set X such that n(X1 ) = n(X2 ) = n(X3 ) and n(X4 ) = n(X5 ) = n(X6 ), except assume that n(X1 ) = 8n(X4 ) and n(X) = 189. (a) In how many different ways could you select B if n(B) = 6? Then n(X1 ) = (b) In how many different ways could you select B if n(B) = 7? 2 . 3 1.3 1. (1 point) (Note: This problem is similar to problem 1 in section 1.3 of your text.) 4. (1 point) Rework problem 5 from section 1.3 of your text, involving the sizes of subsets of a universal set. Assume that n(U) = 100, n(B0 ) = 59, n(A B0 ) = 33, and n(A B) = 21. Find n(A B): Let U be a universal set with subsets A and B such that n(U) = 77, n(A) = 38, n(B) = 23, and n(A B) = 6. Find the following: (1) n(A0 ) = (2) n(A B) = (3) n((A B)0 ) = 2. (1 point) (Note: This problem is similar to problem 2 in section 1.3 of your text.) 5. (1 point) Let U be a universal set with subsets A and B such that n(U) = 118, n(A0 ) = 43, n(B0 ) = 58, and n(A B) = 27. Find n(A B). Let U be a universal set with subsets A and B such that n(U) = 120, n(A) = 60, n(B0 ) = 63, and n(A B) = 19. Find the following: n(A B) = (1) n(B) = (2) n(A B) = 6. (1 point) Rework problem 6 from section 1.3 of your text, involving the sizes of disjoint subsets of a universal set. Assume that A and B are disjoint subsets of U, and that n(U) = 60, n(A) = 22, and n(B0 ) = 39. Find n(A B0 ): (3) n((A B)0 ) = 3. (1 point) Rework problem 3 from section 1.3 of your text, involving the sizes of subsets of a universal set. Assume that n(U) = 80, n(A) = 42, n(B0 ) = 44, and n(A B) = 61. Find n(A B): 7. (1 point) Rework problem 7 from section 1.3 of your text, involving increasing a gas tax and highway spending. Assume that 115 likely voters are asked their views: 57 favor raising 1 the gas tax, 57 favor additional highway spending, and 29 favor both. How many of these voters favor neither the gas tax increase nor additional highway spending? 11. (1 point) Work (or rework) problem 14 in section 1.3 of your textbook about the automobile that was tested for production defects, but assume that the number of production defects is 28 and that 12 of these are classified as major defects, 17 are classified as design defects, and 7 were neither major defects nor design defects. How many of the design defects were major? 12. (1 point) Rework problem 17 from section 1.3 of your text, involving the sizes of subsets of a universal set. Assume that n(U) = 80, n(A) = 32, and n(B0 ) = 47. Assume further that there are 21 elements of U in A which are not in B. Find the number of elements in B which are not in A. 8. (1 point) Rework problem 8 from section 1.3 of your text, involving defective items. Assume that in a batch of 38 defective items there are 28 with major defects and 21 with minor defects. How many items in this batch have both major and minor defects? 9. (1 point) Rework problem 11 from section 1.3 of your text, involving high school students. Assume that 35 take mathematics, 25 take psychology, and 13 take mathematics and psychology. How many students take exactly one of these two courses? 13. (1 point) Rework problem 23 from section 1.3 of your text, involving specializations of partners in an accounting firm. Assume that each partner has at least one specialization, and use the table below instead of the one in your text. 10. (1 point) Rework problem 13 from section 1.3 of your text, involving quality control of cell phones. Assume that an analyst inspects 13 different types of phones. She finds that in comparison with the previous year, 8 have improved reliability and 8 have improved durability, while only 1 has improved neither reliability nor durability. How many types of phones have improved both reliability and durability? Specialization Auditing Consulting Tax Auditing and consulting Auditing and tax Consulting and tax All three How many partners are there? 2 Number 18 15 18 8 11 9 5 (3) n(A0 B) = 14. (1 point) Rework problem 25 from section 1.3 of your text, involving a drug marketing survey. Assume that 150 surveys are completed. Of those surveyed, 73 responded positively to effectiveness, 64 responded positively to side effects, and 97 responded positively to cost. Also, 33 responded positively to both effectiveness and side effects, 47 to effectiveness and cost, 47 to side effects and cost, and 19 to none of the items. How many responded positively to all three? 16. (1 point) Rework problem 31 from section 1.3 of your text, involving graduates of Gigantic State University. Assume that 200 students are surveyed with the following results: 99 live in the west. 97 live in a large city. 97 are married. 46 live in the west in a large city. 55 are married and live in a large city. 43 are married and live in the west. 24 are married and live in a large city in the west. How many are unmarried, do not live in a large city, and do not live in the west? 15. (1 point) Rework problem 27 from section 1.3 of your text, involving the sizes of subsets of a universal set. Use the following numbers instead of those listed in your text: n(U) = 85, n(A) = 33, n(A B) = 17, n(C) = 17, n((A B)0 ) = 33, and / Find the following. (A B) C = 0. (1) n(C0 ) = (2) n(B C) = 3 1.4 1. (1 point) Rework problem 2 from section 1.4 of your text, involving a multiple-choice test. Assume that the test has 19 questions, each with 4 choices for the answer. An answer sheet has one answer for each question. How many different answer sheets are possible? 4. (1 point) Rework problem 8 from section 1.4 of your text, involving a product code. Assume that X = {C, D, B} and Y = {1, 3, 2}. A code consists of 2 different symbols selected from X followed by 2 not necessarily different symbols from Y . How many different codes are possible? 5. (1 point) Rework problem 11 from section 1.4 of your text, involving shipping routes. Assume that there are 3 routes from Denver to Seattle, 6 routes from Seattle to Orlando, and 2 from Orlando to Dallas. In how many ways can merchandise be shipped from Denver to Dallas using these routes? 2. (1 point) (Note: This problem is similar to problem 5 in section 1.4 of your text.) An experiment consists of flipping a coin 5 times and noting the number of times that a heads is flipped. Find the sample space S of this experiment. S= . 3. (1 point) Rework problem 7 from section 1.4 of your text, involving the possible outcomes when rolling a die. Assume that the die is rolled 3 times. If the result is odd, a 0 is recorded. Otherwise, the number is recorded. (1) Which of the following is not a valid outcome for this experiment? A. 044 B. 660 C. 602 D. 303 6. (1 point) Rework problem 13 from section 1.4 of your text, involving sales calls. Assume the sales representative calls 5 customers, and each call has 3 possible results: reaches the customer in person, gets an answering machine, and gets a busy signal. A phone record is a list of the results of each call. How many different phone records are possible? (2) How many possible outcomes are there in the sample space? 1 7. (1 point) Rework problem 15 from section 1.4 of your text, involving the selection of rats from a cage. Assume that there are 8 rats in the cage: 6 trained and 2 untrained. A rat is removed from the cage and it is noted whether or not it is trained. It is then placed in a different cage. 4 more rats are removed and treated the same way. (1) Which of the following is not a valid outcome for this experiment? A. UTUUT B. TUTUT C. TTTUT D. TTTTU (2) An experiment consists of selecting a time and then a flight route. How many outcomes are there to this experiment? 10. (1 point) A twenty-something single person is planning a ski vacation. Assume that he has 4 possible destinations: Colorado, Oregon, New England, and Utah. There are 2 ski areas in Colorado with 2 available times for 1 of the areas, and 4 times for the other area. There are 5 ski areas in Oregon with 3 available times for 4 of the areas, and 2 times for the other area. There are 4 ski areas in New England with 2 available times for 3 of the areas, and 3 times for the other area. There are 5 ski areas in Utah with 1 available times for 4 of the areas, and 4 times for the other area. (A \"time\" refers to a weekend for which there are vacancies at the ski lodge.) A trip plan involves the selection of a location, ski area, and a time. How many possible plans are there? (2) How many outcomes are possible for this experiment? 11. (1 point) Rework problem 26 from section 1.4 of your text, involving drawing balls from a box. Assume that the box contains 6 balls: 4 blue, 1 yellow, and 1 red. Balls are drawn in succession without replacement, and their colors are noted until a blue ball is drawn. (1) Which of the following is not a valid outcome for this experiment? 8. (1 point) Rework problem 17 from section 1.4 of your text, involving a product code. Assume that product codes are formed from the letters S, V, Q, U, and R, and consist of 6 not necessarily distinct letters arranged one after the other. For example, SSVQVS is a product code. (1) How many different product codes are there? (2) How many different product codes do not contain S? A. YBR B. B C. YB D. YRB (2) How many outcomes are there in the sample space? (3) How many different product codes contain exactly one R? 9. (1 point) Rework problem 18 from section 1.4 of your text, involving direct and indirect flights. Assume that there are direct flights from Orlando to Seattle, flights with a stop at Indianapolis, flights with a stop at Denver, and flights with a stop at Minneapolis. Each of these types of routes has 2 different flights every day. (1) An experiment consists of selecting a type of flight and then a time. How many outcomes to this experiment are there? 2 12. (1 point) Rework problem 27 from section 1.4 of your text, involving a telephone sales representative. Assume that the representative will continue to make telephone calls until he makes 2 sales, gets 5 tentative commitments, or fails to make a sale. Her log for the day consists of a list of calls, with sale, tentative commitment, or no sale noted for each. How many possible logs are there? 14. (1 point) Rework problem 29 from section 1.4 of your text, involving the flipping of a coin. A coin is flipped. If a heads is flipped, then the coin is flipped 2 more times and the number of heads flipped is noted; otherwise (i.e., a tails is flipped on the initial flip), then the coin is flipped 3 more times and the result of each flip (i.e., heads or tails) is noted successively. How many possible outcomes are in the sample space of this experiment? 13. (1 point) A coin is flipped once. If the result is a heads, the coin is flipped 3 more times, and the result (heads or tails) of each successive flip is noted. If the result is a tails, the coin is flipped 1 more time and the result is noted. How many possible outcomes are in the sample space of this experiment? 3 1.1 1. (1 point) 3. (1 point) (Note: This problem is similar to problem 6 in section 1.1 of your textbook.) (Note: This problem is similar to problems 1-3 in section 1.1 of your text.) Let U = {3, 4, 6, 7, 8}, A = {4, 7}, and B = {6, 8}. In each of the following questions, find the indicated set; give your answer in list form, i.e., the way that U, A, and B are given (remember to use braces). To indicate that a set is empty, write down braces with nothing inside them, i.e., {}. Let R = {v, q}, S = {s, y, r}, and T = {r, q, v, x, y}, For each of the following questions, enter T if the assertion is true, and enter F if the assertion is false. 1. R S ? (1) Find A0 . A0 = 2. R T ? (2) Find A0 B0 . A0 B0 = 3. S T ? 4. R S T ? (3) Find A B. AB = 5. v S T ? (4) Find (A B)0 . (A B)0 = 6. y S T ? (5) Find (A B)0 . (A B)0 = 2. (1 point) Rework problem 5 from section 1.1 of your text, involving subsets of a set A. Assume that the set A = {1, 2, 6, 8, 9}. (1) Let B = {8}. Note that B A. Find a subset C of A such / that B C = A and B C = 0. C= 4. (1 point) (Note: This problem is similar to problem 9 in section 1.1 of your textbook.) (2) Let D = {1, 6}. Note that D A. Find a subset E of A / such that D E = A and D E = 0. E= Let U = {5, 4, 3, 1, 0, 1, 3, 4, 6}, E = {5, 3, 0, 1}, F = {4, 3, 1, 1, 3}. and G = {4, 3, 1, 3, 4}. In each of the following questions, find the indicated set. To indicate that a set is empty, enter braces with nothing inside them, i.e., {}. (3) How many distinct pairs of disjoint non-empty subsets of A are there, the union of which is all of A? (1) Find E 0 . E0 = (2) Find F G0 . F G0 = 1 (3) Find (E F) G0 . (E F) G0 = (2) Find B C B C = (4) Find E (F G0 ) E (F G0 ) = (3) Find A0 A0 = 5. (1 point) Rework problem 10 from section 1.1 of your text. Use the following sets to answer the questions below. To indicate that a given set is empty, enter braces with nothing inside, e.g., {}. (4) Find (A B) (B C) (A B) (B C) = U = {4, 3, 1, 1, 3, 4} A = {3, 1, 3} B = {1, 3, 4} C = {3, 3} (5) Find A B0 A B0 = (6) Find A C0 A C0 = (1) Find A B AB = 7. (1 point) Work the following problem, similar to number 15 from sec-tion 1.1 of your text. Assume that A and Y are nonempty sub-sets of a universal set U. Assume further that their intersection is not empty, and that the intersection of their complements is not empty. Indicate whether each of the following set relations is always true, sometimes true, or never true. (2) Find B C B C = (3) Find A0 A0 = (4) Find (A B) (B C) (A B) (B C) = (1) A Y 0 A A. Always True B. Never True C. Sometimes True (5) Find (B A0 ) C0 (B A0 ) C0 = (2) Y A A A. Sometimes True B. Always True C. Never True 6. (1 point) Rework problem 11 from section 1.1 of your text. Use the following sets to answer the questions below. To indicate that a given set is empty, enter braces with nothing inside, e.g., {}. U = {7, 4, 1, 4, 7, 8} A = {7, 4, 1} B = {1, 4, 8} C = {4, 7, 8} (3) Y 0 A0 (Y A)0 A. Never True B. Sometimes True C. Always True (1) Find A B AB = (4) A0 Y 0 (A Y )0 A. Never True B. Always True 2 C. Sometimes True 10. (1 point) Rework problem 23 from section 1.1 of your text. Assume that you have a universal set U = {4, 3, 2, 2, 4, 6}, with subsets X, Y , and Z. Assume further that X Y = {3, 2, 2, 4, 6}, X Y = {2}, Y Z = {6}, Y 0 Z 0 = {2}, and Z 0 = {3, 2, 2}. 8. (1 point) Work the following problem, similar to number 19 from section 1.1 of your text. Let U = {3, 4, a, b, x, y, z} be a universal set with subsets A = {3, b, x, y}, Y = {3, 4, y}, and B = {3, 4, a, x}. Another subset of U is given by S = {3, 4, b, x, y}. Find X, Y , and Z. To indicate that a set is empty, enter braces with nothing between them, i.e., {}. (1) X = Which of the following sets are needed to express the set S? (2) Y = A. A' B. B C. Y' D. B' E. Y F. A (3) Z = 11. (1 point) Rework problem 25 from section 1.1 of your text, involving Cartesian products. Let A = {a, c, d, b, e}, and B = {b, e, f }. Answer the following questions instead of those posed in your book. (1) How many distinct elements are in A B? (2) How many distinct elements are in (A B) (B A) 9. (1 point) Rework problem 21 from section 1.1 of your text, involving subsets. (1) How many distinct subsets of { j} are there? (2) How many distinct subsets of {k, d, b} are there? 12. (1 point) Rework problem 27 from section 1.1 of your text, involving Cartesian products. Assume that AB = {(c, 5), (c, 7), (c, 6), (c, 4), (d,4) } 3 (1) How many distinct elements are in A? (2) How many distinct elements are in B? 4 1.4 1. (1 point) Rework problem 2 from section 1.4 of your text, involving a multiple-choice test. Assume that the test has 19 questions, each with 4 choices for the answer. An answer sheet has one answer for each question. How many different answer sheets are possible? 4. (1 point) Rework problem 8 from section 1.4 of your text, involving a product code. Assume that X = {C, D, B} and Y = {1, 3, 2}. A code consists of 2 different symbols selected from X followed by 2 not necessarily different symbols from Y . How many different codes are possible? 5. (1 point) Rework problem 11 from section 1.4 of your text, involving shipping routes. Assume that there are 3 routes from Denver to Seattle, 6 routes from Seattle to Orlando, and 2 from Orlando to Dallas. In how many ways can merchandise be shipped from Denver to Dallas using these routes? 2. (1 point) (Note: This problem is similar to problem 5 in section 1.4 of your text.) An experiment consists of flipping a coin 5 times and noting the number of times that a heads is flipped. Find the sample space S of this experiment. S= . 3. (1 point) Rework problem 7 from section 1.4 of your text, involving the possible outcomes when rolling a die. Assume that the die is rolled 3 times. If the result is odd, a 0 is recorded. Otherwise, the number is recorded. (1) Which of the following is not a valid outcome for this experiment? A. 044 B. 660 C. 602 D. 303 6. (1 point) Rework problem 13 from section 1.4 of your text, involving sales calls. Assume the sales representative calls 5 customers, and each call has 3 possible results: reaches the customer in person, gets an answering machine, and gets a busy signal. A phone record is a list of the results of each call. How many different phone records are possible? (2) How many possible outcomes are there in the sample space? 1 7. (1 point) Rework problem 15 from section 1.4 of your text, involving the selection of rats from a cage. Assume that there are 8 rats in the cage: 6 trained and 2 untrained. A rat is removed from the cage and it is noted whether or not it is trained. It is then placed in a different cage. 4 more rats are removed and treated the same way. (1) Which of the following is not a valid outcome for this experiment? A. UTUUT B. TUTUT C. TTTUT D. TTTTU (2) An experiment consists of selecting a time and then a flight route. How many outcomes are there to this experiment? 10. (1 point) A twenty-something single person is planning a ski vacation. Assume that he has 4 possible destinations: Colorado, Oregon, New England, and Utah. There are 2 ski areas in Colorado with 2 available times for 1 of the areas, and 4 times for the other area. There are 5 ski areas in Oregon with 3 available times for 4 of the areas, and 2 times for the other area. There are 4 ski areas in New England with 2 available times for 3 of the areas, and 3 times for the other area. There are 5 ski areas in Utah with 1 available times for 4 of the areas, and 4 times for the other area. (A \"time\" refers to a weekend for which there are vacancies at the ski lodge.) A trip plan involves the selection of a location, ski area, and a time. How many possible plans are there? (2) How many outcomes are possible for this experiment? 11. (1 point) Rework problem 26 from section 1.4 of your text, involving drawing balls from a box. Assume that the box contains 6 balls: 4 blue, 1 yellow, and 1 red. Balls are drawn in succession without replacement, and their colors are noted until a blue ball is drawn. (1) Which of the following is not a valid outcome for this experiment? 8. (1 point) Rework problem 17 from section 1.4 of your text, involving a product code. Assume that product codes are formed from the letters S, V, Q, U, and R, and consist of 6 not necessarily distinct letters arranged one after the other. For example, SSVQVS is a product code. (1) How many different product codes are there? (2) How many different product codes do not contain S? A. YBR B. B C. YB D. YRB (2) How many outcomes are there in the sample space? (3) How many different product codes contain exactly one R? 9. (1 point) Rework problem 18 from section 1.4 of your text, involving direct and indirect flights. Assume that there are direct flights from Orlando to Seattle, flights with a stop at Indianapolis, flights with a stop at Denver, and flights with a stop at Minneapolis. Each of these types of routes has 2 different flights every day. (1) An experiment consists of selecting a type of flight and then a time. How many outcomes to this experiment are there? 2 12. (1 point) Rework problem 27 from section 1.4 of your text, involving a telephone sales representative. Assume that the representative will continue to make telephone calls until he makes 2 sales, gets 5 tentative commitments, or fails to make a sale. Her log for the day consists of a list of calls, with sale, tentative commitment, or no sale noted for each. How many possible logs are there? 14. (1 point) Rework problem 29 from section 1.4 of your text, involving the flipping of a coin. A coin is flipped. If a heads is flipped, then the coin is flipped 2 more times and the number of heads flipped is noted; otherwise (i.e., a tails is flipped on the initial flip), then the coin is flipped 3 more times and the result of each flip (i.e., heads or tails) is noted successively. How many possible outcomes are in the sample space of this experiment? 13. (1 point) A coin is flipped once. If the result is a heads, the coin is flipped 3 more times, and the result (heads or tails) of each successive flip is noted. If the result is a tails, the coin is flipped 1 more time and the result is noted. How many possible outcomes are in the sample space of this experiment? 3 Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner Scanned by CamScanner