Set-counting problems are bookkeeping problems: determine which objects belong to each region, then count every eligible object exactly once. Venn diagrams make inclusion and exclusion visible, especially when totals overlap.
Derive the two-set rule
For finite sets A and B,
The union contains members of either set, including both. The intersection contains members of both. Adding the separate totals counts intersection members twice, so subtract one copy.
If the whole population has N members, the number in neither is The number in exactly one is These formulas answer different questions; the extra subtraction in “exactly one” removes the overlap entirely.
Example: recover the diagram from totals
Among 120 subscribers, 75 read the science newsletter, 68 read the arts newsletter, and 19 read neither. Thus 101 read at least one. The overlap is
Science-only is and arts-only is Exactly one is The four regions verify the total:
When one subscriber is selected uniformly at random, the probability of exactly one newsletter is If selection is restricted to science readers, the probability of also reading arts is Always identify the population relevant to the denominator.
Science only: 33; Arts only: 26; both: 42; neither: 19.
The overlap belongs to both groups but is one region. Count each region once.
Describe this figure
Science only: 33; Arts only: 26; both: 42; neither: 19.
Science only: 33; both: 42; Arts only: 26; neither: 19.
Possible overlaps have bounds
If 75 of 120 people are in A and 68 are in B, their intersection cannot exceed 68, the smaller group. It cannot be below because otherwise the union would exceed the population.
In general, the overlap lies between and These bounds are useful for “could be” questions. They also detect impossible data before you calculate probabilities from them.
Three sets: start at the center
With three circles, put the triple intersection in first. A stated pairwise intersection normally includes those in all three, unless “only” is specified. Subtract the triple intersection to obtain each pair-only region, then find single-only regions.
The three-set union rule is
A member of all three is initially counted three times, then subtracted three times. Adding the triple intersection restores its one required count.
For totals 20, 18, and 15, pairwise intersections 7, 6, and 5, and triple intersection 3, the union is Read each pairwise count carefully: if the values describe pair-only regions, this substitution would be wrong.
Read “only” before using an intersection
Suppose a survey says 10 people belong to both A and B, including 4 who also belong to C. Then the A-and-B-only region contains 6, not 10. Conversely, if the survey explicitly says 10 belong to A and B but not C, then the full pairwise intersection contains those 10 plus the triple intersection.
A useful check is to reconstruct every stated set total from the finished diagram. Add all regions within A and compare with the given A count, then repeat for B and C. A diagram can accidentally have the correct grand total while assigning people to the wrong sets, so the grand-total check alone is not enough.
Try it yourself
In a population of 60, set A has 35 members and B has 40. What is the smallest possible overlap? If the overlap is 25, how many belong to neither?
Answer: At least must overlap. With overlap 25, the union is leaving 10 in neither.
What to remember
Translate every phrase into a region. Inclusion-exclusion corrects repeated counting, and population bounds provide a fast consistency check. For three groups, fill the most shared region first.