Advertisement

Venn diagram calculator

Enter inclusive set and intersection counts. A region table provides the numbers to place in a two-set or three-set Venn diagram.

Calculator

At least one set
18.000000
Outside all sets
12.000000
A only
6.000000
B only
8.000000
Symmetric difference (odd membership)
14.000000
Universe size
30.000000
Count in A
10.000000
Count in B
12.000000
Inclusive A and B intersection
4.000000
Disjoint Venn regions
RegionCount
A only6.000000
B only8.000000
A and B only4.000000
Outside all sets12.000000
Set differences and complements in U
ExpressionCount
U minus A20.000000
U minus B18.000000
A minus B6.000000
B minus A8.000000
U minus (A minus B)24.000000
U minus (B minus A)22.000000
U minus (A union B)12.000000
U minus (A intersection B)26.000000
U minus (A symmetric difference B)16.000000

Advertisement

How this calculator works

Set counts include every member of that set, including members shared with other sets. Pairwise intersections in three-set mode also include the triple intersection. Inclusion-exclusion first gives the union; subtracting shared counts then gives disjoint regions. Every region must be a non-negative whole number, and the union cannot exceed the universe. Missing-count modes solve the same identity using a supplied union. The region table identifies where each count belongs in a Venn diagram. Three-set symmetric difference counts members of an odd number of sets, including the triple region.

Formula

Two sets: union = A + B - AB. Three sets: union = A + B + C - AB - AC - BC + ABC. A only = A - AB - AC + ABC. Outside = U - union.

Worked example

With U=30, A=10, B=12, C=9, AB=4, AC=3, BC=5 and ABC=2, the union is 21. The A-only, B-only and C-only regions are 5, 5 and 3. Pair-only regions are 2, 1 and 3; the triple region is 2 and outside is 9.

Advertisement

Frequently asked questions

Do pair intersections include the triple overlap?

Yes. Enter inclusive intersections. The tool subtracts the triple count to obtain pair-only regions.

Why is my input rejected?

A negative derived region or union larger than the universe is inconsistent with finite set counts.

Can I recover one missing intersection?

Choose its missing-count mode and enter the known union along with the other inclusive counts. For three-set-only quantities, select three sets first.

Sources

Advertisement