Chapter 6: Problem 25
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?
/*! 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 25
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?
All the tools & learning materials you need for study success - in one app.
Get started for free
Let \(A=\\{\) June, Janet, Jill, Justin, Jeffrey, Jello\\}, \(B=\\{\) Janet, Jello, Justin\\}, and \(C=\\{\) Sally, Solly, Molly, Jolly, Jello\\}. Find each set. $$ (A \cap B) \cap C $$
Let \(S\) be the set of outcomes when two distinguishable dice are rolled, let \(E\) be the subset of outcomes in which at least one die shows an even number, and let \(F\) be the subset of outcomes in which at least one die shows an odd number. List the elements in each subset given. $$ F^{\prime} $$
How many different four-letter sequences can be formed from the letters a, a, a, b? HINT [See Example 3.]
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?
Is the set of outcomes when two indistinguishable dice are rolled (Example 1) a Cartesian product of two sets? If so, which two sets; if not, why not?
What do you think about this solution?
We value your feedback to improve our textbook solutions.