Set Theory
Set Theory
Two sets:
n(A union B) = n(A) + n(B) - n(A intersection B)
Three sets:
n(A union B union C)
= n(A) + n(B) + n(C)
- n(A intersection B) - n(B intersection C) - n(C intersection A)
+ n(A intersection B intersection C)
Only regions:
Only A = A - AB only - AC only - ABC
Exactly two = AB only + BC only + CA only
At least two = exactly two + all three
At least one = union
None = total - union
Fast Venn method:
- Fill the center first.
- Fill exactly-two regions by subtracting center from pairwise intersections.
- Fill only-one regions.
- Use total to get none.