Hello all =)
i am strugling (?) here with some old homework...
lets see...
A=P({a,c,d,e,g}) , B=P({c,d,e,f,g}) . ( P(X) is the power set of X) .
Calculate |A U B| .
My thoughts are:
A= 2^5= 32
B= 2^5= 32
|A U B| i believe that, it should be for example a new set that contains {a,c,d,e,f,g}
so thats 2^6=64
Right?
If its right, is this a good way to type as an answer?
Thanks for your time, and assistance =)
Well in case you didn't understand my first post and would like to: A U B contains precisely those elements of P({a,c,d,e,f,g}) that do not contain {a,f}, since no element of A contains {a,f} and no element of B contains {a,f}. (The first "contains" means set membership and the other "contain(s)" mean subset.)