let-S-1-2-3-4-5-if-A-B-C-is-such-that-A-B-C-A-B-A-C-how-many-ways-can-be-choose-A-B-and-C-

Question Number 1132 by 123456 last updated on 24/Jun/15

let S = {1, 2, 3, 4, 5}, if A, B, C is such that

A \cap B \cap C = \emptyset

A \cap B \neq \emptyset

A \cap C \neq \emptyset

how many ways can be choose A, B and

C

Commented by Faaiz Soomro last updated on 14/Jul/15

W h e n I s e e t h i s p r o b l e m i n t h e l i s t t h e r e i s w r i t t e n

A \cap B = ϕ

A \cap C = ϕ

b u t n o w w h e n I a m c o m m e n t i n g t h e r e i s w r i t t e n u n e q u a l

i n s t e a d o f = s i g n . W h a t i s t h e p r o b l e m ? P l t r y t o w r i t e a

c o m m e n t a n d n o t e t h i s . W h a t i s c o r r e c t ?

I t h i n k t h i s p r o b l e m i s i n m y t a b l e t .