Which of the following sequence of set operations counts the number of elements that are in exactly one of A , B or C ?"
Options:
∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ − 3 ( ∣ A ∩ B ∩ C ∣ )
∣ A ∣ + ∣ B ∣ + ∣ C ∣ − 2 ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ ) + 3 ∣ A ∩ B ∩ C ∣
∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ − 2 ∣ A ∩ B ∩ C ∣
∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ B ∩ C ∣ − ∣ C ∩ A ∣ + ∣ A ∩ B ∩ C ∣
∣ ( A ∩ B ∩ C ) ∪ ( A ∩ B C ∩ C C ) ∪ ( A C ∩ B ∩ C C ) ∪ ( A C ∩ B C ∩ C ) ∣
| A ∪ B ∪ C |
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Wording of the problem is confusing. Better phrasing would be "...elements that are only in A, only in B and only in C.
What David said
Wording is not exact so agree with David, Brilliant should remove this question
Problem Loading...
Note Loading...
Set Loading...
Imagine painting a color chart by overlapping the 3 circles primary colors of pigment: magenta (A), yellow (B), and cyan (C). The very center gets covered 3 times and the three regions bordering the center each get covered twice. Therefore, if we want to count only the three outermost areas (aka, the things in exactly one of A, B, or C but not shared between both or all 3 sets), if we start by counting ∣ A ∣ + ∣ B ∣ + ∣ C ∣ , we then need to remove 2 ( ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ ) . But in doing so, we "over-remove" ∣ A ∩ B ∩ C ∣ (the very center) by three extra times, so we need to add that back in ( + 3 ∣ A ∩ B ∩ C ∣ ). In other words, the answer is option 2 .