Grab a number and move it around the diagram — the membership table and the element counts are recalculated instantly.
A ∩ B · A ∪ B · A \ B
|A ∪ B| = |A| + |B| − |A ∩ B|
A ∩ B = intersection — elements belonging to A and to B
A ∪ B = union — elements belonging to A or to B
A \ B = difference — elements of A that are not in B
|A| = cardinality — the number of elements of set A
U = universe — all the elements under consideration
A set is a collection of mutually distinguishable elements. For every element we can say unambiguously whether it belongs to the set (x ∈ A) or does not belong to it (x ∉ A). A Venn diagram shows the sets as circles inside a rectangle that stands for the universe U — all the elements under consideration.
The overlap of the circles is the intersection A ∩ B, the whole area of both circles is the union A ∪ B and the part of circle A outside B is the difference A \ B. Since the common elements would be counted twice in the plain sum |A| + |B|, we subtract them once when counting the union — that is the inclusion–exclusion principle.
| Element | x ∈ A | x ∈ B | A ∩ B | A ∪ B | A \ B | B \ A |
|---|
Drag the numbers into the circles + add elementreset
Solve it step by step — the next step unlocks only after a correct answer. You can type decimals with a dot or a comma.