Determine the following. let U = {1, 2, 3, 4,..., 10} A = {1, 3, 5, 7} B = {5, 7, 9, 10} C = {1, 7, 10} 36. The number of proper subsets of set A,
can someone explain how to do this?
what are you asking for?
its asking the number of proper subsets of set A im not sure how to do this problem
so proper would be the ones that are included in the other ones?
Well if a set has x elements, it has 2^x subsets. if you want proper subsets you have to take off one subset. so for A it would be 2^4-1 = 15 proper subsets
so it would be the elements that are in the other sets?
what does that 36 mean?
it would be like {1}, {1,3} {1,3,5} {3}...... any combination of elements in A
and also in the A subset so it would be A={1,3,5,7,10} for answer
a subset of A is a set containing some or all of the elements of A as well as the empty set. To enumerate the subsets of A is a bit tedious.
this is what the question is . polpak..
name the proper subsets of set A
For a short example: Q = { 1,5,9 } All the subsets of Q are: {1,5,9} {1,5} {1,9} {5,9} {1} {5} {9} {}
The proper ones would just not include the set itself, so in the above example {1,5,9} would not be on the list.
so its whats in the other sets thats part of A
{empty set},{1},{3},{5},{7},{1,3},{1,5},{1,7},{3,5},{3,7},{5,7},{1,3,5},{3,5,7},{1,5,7},{1,3,7},
so its everything that is in EACH set thats a subset?
{1,3,5} {1,3,7} {1,5,7} {3,5,7} {1,3} {1,5} {1,7} {3,5} {3.7} {5,7} {1} {3} {5} {7} empty set
If they want the subsets of A you have to list them.
{empty set} does not equal empty set
all combinations of the elements in A
\[\{\} = \emptyset \]
oh you called me a bad word thats not nice
{1,3,5,7} {3,5,7} like this?
Yes, but there's more than that.
yes all the ones we already listed
jhmann, i was trying to help sandi and you didn't have to be mean to me
yea just put all elements in a subset and then down to {}
nice apology
Join our real-time social learning platform and learn together with your friends!