Three-set Venn word problems are a staple of JEE Main and board exams. The question gives you |A|, |B|, |C|, the three pair-intersection counts |A \cap B|, |A \cap C|, |B \cap C|, and usually the triple |A \cap B \cap C|. It then asks for things like "how many are in exactly one of A, B, C" or "how many are in at least two."

The trap: students try to fill the diagram in the order the question gave the numbers — |A| first, then |B|, then |C|. That order looks natural, but it leads straight to double-counting. The safe, mechanical order is the opposite: start from the centre and work outward.

The three-set Venn has eight regions

Three circles divide the universal rectangle into eight disjoint regions. Naming them in a helpful order, centre-out:

  1. A \cap B \cap C — in all three (the centre).
  2. Three pair-only regions — in exactly two of the sets: A \cap B \cap C', A \cap B' \cap C, A' \cap B \cap C.
  3. Three single-only regions — in exactly one: A \cap B' \cap C', A' \cap B \cap C', A' \cap B' \cap C.
  4. The outside region — in none of the three: A' \cap B' \cap C'.
Three set Venn diagram with eight regions labelled from centre outwardA rectangle labelled U contains three overlapping circles A B and C. The central region where all three overlap is labelled 1. The three lens-shaped regions where exactly two circles overlap are labelled 2. The three crescent-shaped regions inside a single circle only are labelled 3. The region outside all three circles is labelled 4. A B C 1 2 2 2 3 3 3 4
The eight disjoint regions of a three-set Venn. Filling order: (1) centre first, then (2) the three pair-only lenses, then (3) the three single-only crescents, then (4) the outside. This order never double-counts.

Every element of the universe lives in exactly one of the eight regions. The word-problem numbers — |A|, |A \cap B|, etc. — are sums of several regions, not the regions themselves. To answer the question you need region-by-region counts. The filling order gets you there without mistakes.

Why centre-first works

Here is the key insight. The numbers the problem gives you — |A \cap B|, |A \cap B \cap C|, and so on — are each a sum of one or more regions. The centre is the smallest: it is literally one region, A \cap B \cap C. Every larger quantity includes the centre plus some extras.

If you know the centre, you can subtract it off to find the pair-only counts. Once you know those, you can subtract everything down to the single-only counts. And so on. The subtraction chain works only in this direction — from the most-overlapping region outward. Start anywhere else and you introduce double-counts.

The filling algorithm

Let t = |A \cap B \cap C| (the triple intersection — the centre).

Step 1. Place t in the centre.

Step 2. For each pair-only lens, compute (pair) − (triple).

Why: |A \cap B| includes both the pair-only lens and the centre. Subtract the centre to get the lens alone.

Step 3. For each single-only crescent, compute (set total) − (its two pair-lenses) − (triple).

Why: |A| covers everything inside the A circle — four regions in total (the A-only crescent, the two lenses A \cap B-only and A \cap C-only, and the centre). Subtract those three to isolate A-only.

Step 4. The outside. If the universe size |U| is given, compute |A' \cap B' \cap C'| = |U| - |A \cup B \cup C|, where |A \cup B \cup C| is the sum of the seven regions inside the circles.

After these four steps, every region of the Venn has a count, and any derived quantity — "exactly one," "at least two," "none" — is a sum of the right regions.

A worked example

In a survey of 100 students, 45 play cricket (A), 38 play football (B), and 40 play hockey (C). 15 play cricket and football, 12 play cricket and hockey, 14 play football and hockey, and 5 play all three. How many play exactly one sport?

Step 1. Centre: t = 5.

Step 2. Pair-only regions.

Step 3. Single-only regions.

Why: using the second form of the formula, |A \text{ only}| = |A| - |A \cap B| - |A \cap C| + t. The +t compensates because subtracting the two pair-counts removed the centre twice — once through each pair — so you add it back once.

Answer. Exactly one sport = 23 + 14 + 19 = 56 students.

Sanity check: total inside the three circles = 56 + (10 + 7 + 9) + 5 = 56 + 26 + 5 = 87. That means 100 - 87 = 13 students play none — which is plausible.

The wrong-order failure

What if you had tried to fill |A|-first by writing 45 in the A circle without subtracting overlaps? You would have miscounted the pair-lens and the centre as part of "cricket only," and the final "exactly one" would be too high.

The ordinary mistake goes like this: student writes 45 in the A circle, then realises 15 of them also play football, and tries to subtract. But subtract from which region? Without the centre-first layout, there is no clean way to untangle the overlaps. You end up either double-subtracting (getting negative numbers) or under-subtracting (getting inflated "only" counts).

Centre-first avoids this entire category of error because at every step you are subtracting from known quantities, not from the original unsubtracted totals.

Why this works: inclusion-exclusion as a book-keeping ritual

The formula |A \text{ only}| = |A| - |A \cap B| - |A \cap C| + |A \cap B \cap C| is a tiny instance of the inclusion-exclusion principle. The centre-first procedure is what inclusion-exclusion looks like when you apply it regionally. You are not so much proving anything as book-keeping — making sure each student is counted exactly once in the right region.

Once you internalise centre-first, three-set Venn problems become a five-minute computation. No trial and error.

Checklist for exam conditions

Related: Set Operations · Three-Set Venn Where to Start Filling Numbers · Three-Set Venn Eight Zones · Recognise Exactly Two of Three Sets Formula