Chapter 6: Problem 10
How many three-letter code words can be constructed from the first ten letters of the Greek alphabet if no repetitions are allowed?
/*! 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 10
How many three-letter code words can be constructed from the first ten letters of the Greek alphabet if no repetitions are allowed?
All the tools & learning materials you need for study success - in one app.
Get started for free
To help plan the number of meals (breakfast, lunch, and dinner) to be prepared in a college cafcteria, a survey was conducted and the following data were obtained: 130 students ate breakfast. 180 students ate lunch. 275 students ate dinner. 68 students ate breakfast and lunch. 112 students ate breakfast and dinner. 90 students ate lunch and dinner. 58 students ate all three meals. How many of the students ate a. At least one meal in the cafeteria? b. Exactly one meal in the cafeteria? c. Only dinner in the cafeteria? d. Exactly two meals in the cafeteria?
Let \(A, B\), and \(C\) be subsets of a universal set \(U\) and suppose \(n(U)=100, n(A)=28, n(B)=30\), \(n(C)=34, n(A \cap B)=8, n(A \cap C)=10, n(B \cap C)=15\) and \(n(A \cap B \cap C)=5\). Compute: a. \(n[A \cap(B \cup C)]\) b. \(n\left[A \cap(B \cup C)^{q}\right.\)
suppose \(A \subset B\) and \(B \subset C\), where \(A\) and \(B\) are any two sets. What conclusion can be drawn regarding the sets \(A\) and \(C ?\)
List the elements of the set in roster notation. $$ \\{x+\text { is a letter in the word } H I P P O P O T A M U S\\} $$
List the elements of the set in roster notation. $$ \\{x \mid 2-x=4 \text { and } x \text { is an integer }] $$
What do you think about this solution?
We value your feedback to improve our textbook solutions.