Ask your own question, for FREE!
Mathematics 20 Online
OpenStudy (anonymous):

Let A = {1,2,...,12}. Give an example of a partition S of A satisfying the following requirements: 1. |S| = 5 2. There is a subset T of S such that |T| = 4 and |U_(X∈T)X| = 10 3. There is no element B ∈ S such that |B| = 3 @amistre64 @ganeshie8 @phi @RadEn @thomaster @whpalmer4 @eliassaab @Preetha @wolfe8 @ZeHanz @Australopithecus @rose21 @bibby

OpenStudy (anonymous):

@satellite73

OpenStudy (anonymous):

@phi What i'm particularly struggling with is the second condition. @amistre64

OpenStudy (amistre64):

1) We need S to contain 5 elements 2) We need S to be made such that a subset of 4 elements has the property of the Union defined

OpenStudy (anonymous):

What does the union defined mean

OpenStudy (anonymous):

That's probably my main question HAHA

OpenStudy (amistre64):

i would say that T adds up to 10, but the ascii is hard to parse.

OpenStudy (anonymous):

f

OpenStudy (amistre64):

might need to get a better definition of |S|, im assuming it means cardinality but that might be a bad assumption on my part

OpenStudy (anonymous):

Why is the draw feature not working when I need it most?

OpenStudy (amistre64):

might be a browser issue, try hitting f5 to see if it kickstarts it

OpenStudy (anonymous):

|S| means cardinatlity

OpenStudy (amistre64):

|dw:1390484691116:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!