Chapter 6: Problem 34
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?
/*! 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 34
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?
All the tools & learning materials you need for study success - in one app.
Get started for free
Evaluate each number. $$ C(100,97) $$
How many three-letter (unordered) sets are possible that use the letters \(\mathrm{q}, \mathrm{u}, \mathrm{a}, \mathrm{k}, \mathrm{e}, \mathrm{s}\) at most once each?
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 } $$
Ice Cream At the beginning of 2002, Baskin-Robbins claimed to have "nearly 1,000 different ice cream flavors." \(^{\prime \prime}\) Assuming that you could choose from 1,000 different flavors, that you could have your ice cream in a cone, a cup, or a sundae, and that you could choose from a dozen different toppings, how many different desserts could you have?
Use Venn diagrams to illustrate the following identities for subsets \(A, B\), and \(\operatorname{Cof} S .\) $$ \begin{aligned} &(A \cap B) \cap C=A \cap(B \cap C)\\\ &\text { Associative Law } \end{aligned} $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.