Chapter 6: Problem 41
A bag contains three red marbles, two green ones, one lavender one, two yellows, and two orange marbles. How many sets of five marbles include either the lavender one or exactly one yellow one but not both colors?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 6: Problem 41
A bag contains three red marbles, two green ones, one lavender one, two yellows, and two orange marbles. How many sets of five marbles include either the lavender one or exactly one yellow one but not both colors?
All the tools & learning materials you need for study success - in one app.
Get started for free
Use Venn diagrams to illustrate the following identities for subsets \(A, B\), and \(\operatorname{Cof} S .\) $$ A \cap(B \cup C)=(A \cap B) \cup(A \cap C) \quad \text { Distributive Law } $$
Explain the meaning of a universal set, and give two different universal sets that could be used in a discussion about sets of positive integers.
A bag contains three red marbles, two green ones, one lavender one, two yellows, and two orange marbles. How many sets of three marbles include none of the yellow ones?
The Honest Lock Company plans to introduce what it refers to as the "true combination lock." The lock will open if the correct set of three numbers from 0 through 39 is entered in any order. a. How many different combinations of three different numbers are possible? b. If it is allowed that a number appear twice (but not three times), how many more possibilities are created? c. If it is allowed that any or all of the numbers may be the same, what is the total number of combinations that will open the lock?
Based on the following list oftop \(D V D\) rentals (based on revenue) for the weekend ending January 4, 2009:$$\begin{array}{|l|c|}\hline \text { Name } & \text { Rental Index } \\\\\hline \text { EagleEye } & 100.00 \\\\\hline \text { Burn After Reading } & 74.62 \\\\\hline \text { Mamma Mia! } &63.30\\\\\hline \text { The Dark Knight } & 62.43 \\\\\hline \text { Death Race } & 61.50 \\\\\hline\begin{array}{l}\text { The Mummy: Tomb of the } \\\\\text { Dragon Emperor }\end{array} & 60.72 \\\\\hline \text { Traitor } & 52.57 \\\\\hline \text { Wanted } & 49.22 \\\\\hline \text { Step Brothers } & 46.81 \\\\\hline \text { Horton Hears a Who! } & 43.91 \\\\\hline\end{array}$$ Rather than study for astrophysics, you and your friends decide to get together for a marathon movie-watching gummybear-munching event on Saturday night. You decide to watch three movies selected at random from the above list. a. How many sets of three movies are possible? b. Your best friends, the Pelogrande twins, refuse to see either Mamma Mia! or The Mummy on the grounds that they are "for idiots" and also insist that no more than one of Traitor and Death Race should be among the movies selected. How many of the possible groups of three will satisfy the twins? c. Comparing the answers in parts (a) and (b), would you say the Pelogrande twins are more likely than not to be satisfied with your random selection?
What do you think about this solution?
We value your feedback to improve our textbook solutions.