course Mth 151
......!!!!!!!!...................................
19:36:29 2.2.24 U={a,b,...,g}, A={a,e}, B={a,b,e,f,g}, C={b,f,g}, D={d,e} Is C ps U?
Is the statement true or false and why?......!!!!!!!!...................................
RESPONSE --> True, because C is a subset of U, but C and U are not equal, so yes, C is a proper subset of U.
.................................................
......!!!!!!!!...................................
19:36:46 ** It's true because all elements of C are in the universal set, and because there are elements of U that aren't in C. You have to have both conditions, since a proper subset cannot be identical to other set. **
......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
19:54:33 Query 2.2.30 phi s D
......!!!!!!!!...................................
RESPONSE --> 2.2 #30. The answer is true. 0 is a subset of D, so the statement is true, because every set (except 0) contains at least 2 subsets, 0 and itself. So, even though D={d,e} it actually could be wrote, D={0,d,e}.
So 0 is a subset of D. I answered the question #30 from my book, but on this query question, I don't know what phi s D means for me to do?.................................................
......!!!!!!!!...................................
19:55:07 ** Note that You should be responding to problem 2.2.30 from the homework you worked out on paper. The shorthand notation is for my reference and won't always make sense to you. For clarification, though, the symbol for the empty set is the Greek letter phi.
One set is a subset of another if every element of that set is in the other. To show that a set isn't a subset of another you have to show something in that set that isn't in the other. There's nothing in the empty set so you can never do this--you can never show that it has something the other set doesn't. So you can never say that the empty set isn't a subset of another set. Thus the empty set is a subset of any given set, and in particular it's a subset of D. ALTERNATIVE ANSWER: As the text tells you, the empty set is a subset of every set. ANOTHER ALTERNATIVE Every element of the empty set is in D because there is no element in the empty set available to lie outside of D. ONE MORE ALTERNATIVE: The empty set is a subset of every set. Any element in an empty set is in any set, since there's nothing in the empty set to contradict that statement. **......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
19:59:34 2.2.33 D not s B
Is the statement true or false and why?......!!!!!!!!...................................
RESPONSE --> 2.2 #33. True , because D is not a subset of B. Every element of D is not an element B , so the statement is true.
.................................................
......!!!!!!!!...................................
19:59:49 ** D is a subset of B if every element of D is an element of B-i.e., if D doesn't contain anything that B doesn't also contain.
The statement says that D is not a subset of B. This will be so if D contains at least one element that B doesn't. **......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
20:05:45 2.2.36 there are exactly 31 subsets of B
......!!!!!!!!...................................
RESPONSE --> 2.2 # 36 False, because there are 32 subsets of B.
B={a,b,e,f,g} B= 5 elements 2 to the 5th power equals 32. (There are 31 proper subsets. 32-1=31).................................................
......!!!!!!!!...................................
20:06:07 ** If a set has n elements then is has 2^n subsets, all but one of which are proper subsets. B has 5 elements so it has 2^5 = 32 subsets. So the statement is false.
There are exactly 31 proper subsets of B, but there are 32 subsets of B. **......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
20:08:28 Query 2.2.40 there are exactly 127 proper subsets of U
Is the statement true or false and why?......!!!!!!!!...................................
RESPONSE --> 2.2 # 40 True.
There are 7 elements of U. 2^7=128 subsets 128-1=127 proper subsets..................................................
......!!!!!!!!...................................
20:08:36 ** The set is not a proper subset of itself, and the set itself is contained in the 2^n = 2^7 = 128 subsets of this 7-element set. This leaves 128-1 = 127 proper subsets. **
......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
20:15:37 Query 2.2.48 U={1,2,...,10}, complement of {2,5,7,9,10}
What is the complement of the given set?......!!!!!!!!...................................
RESPONSE --> 2.2 #48
This is not problem # 48 in my textbook, its problem # 50. That's the problem that I'm going to do, because it matches this query question. # 50 The complement of {2,5,7,9,10} is { 1,3,4,6,8}..................................................
......!!!!!!!!...................................
20:15:50 ** the complement is {1,3,4,6,8}, the set of all elements in U that aren't in the given set. **
......!!!!!!!!...................................
RESPONSE --> ok
.................................................
......!!!!!!!!...................................
20:21:25 query 2.2.63 in how many ways can 3 of the five people A, B, C, D, E gather in a suite?
......!!!!!!!!...................................
RESPONSE --> 2.2 # 63 They can sit 10 different ways.
{A,B,C}, {A,B,D}, {A,B,E}, {A,C,D}, {A,C,E}, {A,D,E}, {B,C,D}, {B,C,E}, {C,D,E}, { D,E,B}..................................................
......!!!!!!!!...................................
20:23:21 ** The answer here would consist of a list of all 3-element subsets: {a,b,c}, {a,b,d}, {a,b,e}, {a,c,d} etc. There are ten such subsets.
Using a,b,c,d,e to stand for the names, we can list them in alphabetical order: {a,b,c), {a,b,d}, {a,b,e}, {a,c,d}, {a,c,e}, {a,d,e|, {b,c,d}, {b,c,e}, {b,d,e}, {c, d, e}**......!!!!!!!!...................................
RESPONSE --> ok, my last set I listed was {D,E,B] and yours was {B,D,E} but I know that this is still the same thing.
.................................................