Study guide
8.1 Overlapping Sets & Venn Diagrams
GMAT Quantitative Reasoning Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, Adaptive Scoring & Problem Solving Fundamentals
1.1 GMAT Focus Quant Overview & Question Mechanics 1.2 Mental Math, Estimation & Non-Calculator Strategies 1.3 Problem Solving Strategies & Elimination Techniques
2 Chapter 2: Number Theory & Integer Properties
2.1 Divisibility Rules, Prime Factorization & Factors 2.2 Greatest Common Factor (GCF) & Least Common Multiple (LCM) 2.3 Division Algorithm & Remainder Arithmetic 2.4 Parity, Signs & Consecutive Integer Properties 2.5 Real Numbers, the Number Line & Properties of Operations
3 Chapter 3: Fractions, Decimals, Ratios & Percentages
3.1 Fraction Arithmetic & Operations 3.2 Decimals, Place Value & Terminating Decimals 3.3 Ratios, Proportions & Variation 3.4 Percentages, Percent Change, Markup & Profit
4 Chapter 4: Exponents, Roots & Radical Expressions
4.1 Laws of Exponents & Exponential Equations 4.2 Radicals & Operations with Roots 4.3 Exponent & Root Inequalities and Traps
5 Chapter 5: Algebraic Expressions, Equations & Inequalities
5.1 Algebraic Manipulation & Special Products 5.2 Linear Equations & Systems of Equations 5.3 Quadratic Equations, Roots & Factoring 5.4 Inequalities, Sign Charts & Absolute Value 5.5 Formulas, Units & Measurement Conversion
6 Chapter 6: Coordinate Geometry & Linear Functions
6.1 The Coordinate Plane, Distance & Midpoint 6.2 Slope, Equations of Lines & Intercepts 6.3 Functions, Notation & Transformations
7 Chapter 7: Rates, Work, Motion & Mixture Word Problems
7.1 Uniform Motion: Rate, Time & Distance 7.2 Relative Speed, Catch-Up & Current/Wind Problems 7.3 Work-Rate & Cooperative Labor 7.4 Mixture & Weighted Average Word Problems
8 Chapter 8: Applied Word Problems, Sets & Sequences
8.1 Overlapping Sets & Venn Diagrams 8.2 Arithmetic & Geometric Sequences 8.3 Simple & Compound Interest Calculations 8.4 Age Problems & Discrete Optimization
9 Chapter 9: Descriptive Statistics & Data Distributions
9.1 Mean, Median & Mode 9.2 Range, Variance & Standard Deviation 9.3 Frequency Distributions & Distribution Properties
10 Chapter 10: Permutations, Combinations & Probability
10.1 Fundamental Counting Principle & Factorials 10.2 Combinations, Permutations & Grouping 10.3 Probability Rules: Independent & Dependent Events 10.4 Complementary Probability & Multi-Stage Events
8.1 Overlapping Sets & Venn Diagrams
Key Takeaways Explain This Topic AI
Two-set populations obey |A ∪ B| = |A| + |B| − |A ∩ B|; neither equals the total minus the union, and only-A equals |A| minus the intersection.
When two attributes are each binary and exhaustive, a 2×2 double-matrix (yes/no table) is faster than a Venn sketch because every person occupies exactly one cell.
Three-set inclusion-exclusion uses pairwise totals that already include the triple: union = A + B + C − (pairwise sums) + |A ∩ B ∩ C|.
If the prompt gives exactly-two and exactly-three counts, use Total = |A| + |B| + |C| − (Exactly 2) − 2(Exactly 3) + Neither.
Extreme overlap is bounded: maximum |A ∩ B| = min(|A|, |B|), and minimum |A ∩ B| = max(0, |A| + |B| − Total).
Last updated: August 2026
GMAT Focus Quantitative Reasoning is 21 Problem Solving questions in 45 minutes with no calculator. Official Guide Math Review 3.4 lists sets among the tested tools. Overlapping-set items are not abstract set theory: they are classification word problems. A finite population is sorted by one, two, or three attributes, and you must recover a missing cell without double-counting. The algebra is elementary. The difficulty is linguistic — both , only , at least one , and neither name different regions of the same diagram.
Two-Set Formula and Four Regions
When a population of size T T T is classified by two overlapping attributes A A A and B B B , every member falls into exactly one of four mutually exclusive regions: only A A A , only B B B , both, or neither.
The union identity is ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣
The intersection is subtracted once because it was already counted inside both ∣ A ∣ |A| ∣ A ∣ and ∣ B ∣ |B| ∣ B ∣ . Everyone outside the union is the complement: Neither = T − ∣ A ∪ B ∣ = T − ∣ A ∣ − ∣ B ∣ + ∣ A ∩ B ∣ \text{Neither} = T - |A \cup B| = T - |A| - |B| + |A \cap B| Neither = T − ∣ A ∪ B ∣ = T − ∣ A ∣ − ∣ B ∣ + ∣ A ∩ B ∣
Packed as a single accounting equation: T = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ + Neither T = |A| + |B| - |A \cap B| + \text{Neither} T = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ + Neither
Compute the exclusive pieces immediately:
- Only A = ∣ A ∣ − ∣ A ∩ B ∣ A = |A| - |A \cap B| A = ∣ A ∣ − ∣ A ∩ B ∣
- Only B = ∣ B ∣ − ∣ A ∩ B ∣ B = |B| - |A \cap B| B = ∣ B ∣ − ∣ A ∩ B ∣
- Exactly one = ∣ A ∣ + ∣ B ∣ − 2 ∣ A ∩ B ∣ = |A| + |B| - 2|A \cap B| = ∣ A ∣ + ∣ B ∣ − 2∣ A ∩ B ∣
- At least one = ∣ A ∪ B ∣ = T − Neither = |A \cup B| = T - \text{Neither} = ∣ A ∪ B ∣ = T − Neither
A Venn diagram is a bookkeeping sketch, not a picture to admire. On a no-calculator exam, label each exclusive region, convert the given English into equations, and solve. The most common translation error is treating ∣ A ∣ |A| ∣ A ∣ as if it already meant only A . The total for group A A A includes the overlap.
Set-Phrasing Translation Table
- Prompt language Region named Formula
- Both A A A and B B B Intersection ∣ A ∩ B ∣ \vert A \cap B\vert ∣ A ∩ B ∣
Only A A A / A A A but not B B B A A A minus overlap ∣ A ∣ − ∣ A ∩ B ∣ \vert A\vert- \vert A \cap B\vert ∣ A ∣ − ∣ A ∩ B ∣
Neither A A A nor B B B Complement of the union T − ∣ A ∪ B ∣ T - \vert A \cup B\vert T − ∣ A ∪ B ∣
At least one of A A A or B B B Union ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ \vert A\vert+ \vert B\vert- \vert A \cap B\vert ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣
Exactly one of the two Symmetric difference ∣ A ∣ + ∣ B ∣ − 2 ∣ A ∩ B ∣ \vert A\vert+ \vert B\vert- 2\vert A \cap B\vert ∣ A ∣ + ∣ B ∣ − 2∣ A ∩ B ∣
At least two of three groups Exactly two plus all three ( Exactly 2 ) + ( All 3 ) (\text{Exactly 2}) + (\text{All 3}) ( Exactly 2 ) + ( All 3 )
At most one of three groups Neither plus exactly one Neither + ( Exactly 1 ) \text{Neither} + (\text{Exactly 1}) Neither + ( Exactly 1 )
The Double-Matrix Method
When each attribute is binary and exhaustive — every person is in A A A or not in A A A , and in B B B or not in B B B — a 2 × 2 2 \times 2 2 × 2 yes/no table is faster than circles. Rows are A A A versus not- A A A . Columns are B B B versus not- B B B . Each row sums to a marginal total, each column sums to a marginal total, and the four interior cells are mutually exclusive and complete.
- Attribute B B B Not B B B Row total
- Attribute A A A A ∩ B A \cap B A ∩ B A ∩ not B A \cap \text{not } B A ∩ not B ∣ A ∣ \vert A\vert ∣ A ∣
- Not A A A ( not A ) ∩ B (\text{not } A) \cap B ( not A ) ∩ B Neither T − ∣ A ∣ T - \vert A\vert T − ∣ A ∣
- Column total ∣ B ∣ \vert B\vert ∣ B ∣ T − ∣ B ∣ T - \vert B\vert T − ∣ B ∣ T T T
Because every person occupies exactly one cell, any three independent facts determine the fourth. If the prompt gives percents rather than headcounts, assign a convenient total of 100 100 100 or the least common multiple of the denominators, fill known cells, and subtract. Typical GMAT matrix pairs include domestic versus international crossed with full-time versus part-time, and online versus in-person crossed with pass versus fail.
Three-Set Overlap
Three attributes A A A , B B B , and C C C partition the universe into eight exclusive regions: only A A A , only B B B , only C C C , only A & B A\&B A & B , only B & C B\&C B & C , only C & A C\&A C & A , all three, and neither.
Standard inclusion-exclusion uses pairwise totals that already include the triple : ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ B ∩ C ∣ − ∣ C ∩ A ∣ + ∣ A ∩ B ∩ C ∣ |A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |B \cap C| - |C \cap A| + |A \cap B \cap C| ∣ A ∪ B ∪ C ∣ = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ B ∩ C ∣ − ∣ C ∩ A ∣ + ∣ A ∩ B ∩ C ∣ Neither = T − ∣ A ∪ B ∪ C ∣ \text{Neither} = T - |A \cup B \cup C| Neither = T − ∣ A ∪ B ∪ C ∣
When the prompt instead gives exactly two and exactly three counts, switch identities. In the raw sum ∣ A ∣ + ∣ B ∣ + ∣ C ∣ |A| + |B| + |C| ∣ A ∣ + ∣ B ∣ + ∣ C ∣ , a person in exactly one set is counted once, a person in exactly two sets is counted twice, and a person in all three is counted three times: ∣ A ∣ + ∣ B ∣ + ∣ C ∣ = ( Exactly 1 ) + 2 ( Exactly 2 ) + 3 ( Exactly 3 ) |A| + |B| + |C| = (\text{Exactly 1}) + 2(\text{Exactly 2}) + 3(\text{Exactly 3}) ∣ A ∣ + ∣ B ∣ + ∣ C ∣ = ( Exactly 1 ) + 2 ( Exactly 2 ) + 3 ( Exactly 3 )
Combined with T = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + Neither T = (\text{Exactly 1}) + (\text{Exactly 2}) + (\text{Exactly 3}) + \text{Neither} T = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + Neither , this rearranges to T = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ( Exactly 2 ) − 2 ( Exactly 3 ) + Neither T = |A| + |B| + |C| - (\text{Exactly 2}) - 2(\text{Exactly 3}) + \text{Neither} T = ∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ( Exactly 2 ) − 2 ( Exactly 3 ) + Neither
The factor of 2 2 2 on the triple is the correction that reduces a triple-counted person from three down to one. Subtracting the triple a third time would erase the person from the total.
Pairwise totals and exclusive pairwise regions are not interchangeable:
Only A & B A\&B A & B (exactly those two) = ∣ A ∩ B ∣ − ∣ A ∩ B ∩ C ∣ = |A \cap B| - |A \cap B \cap C| = ∣ A ∩ B ∣ − ∣ A ∩ B ∩ C ∣
Exactly two = ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ − 3 ∣ A ∩ B ∩ C ∣ = |A \cap B| + |B \cap C| + |C \cap A| - 3|A \cap B \cap C| = ∣ A ∩ B ∣ + ∣ B ∩ C ∣ + ∣ C ∩ A ∣ − 3∣ A ∩ B ∩ C ∣
Extreme Overlap Bounds
If the item asks for the greatest or least possible intersection rather than a unique value:
Maximum ∣ A ∩ B ∣ = min ( ∣ A ∣ , ∣ B ∣ ) |A \cap B| = \min(|A|, |B|) ∣ A ∩ B ∣ = min ( ∣ A ∣ , ∣ B ∣ ) — the smaller group sits entirely inside the larger one.
Minimum ∣ A ∩ B ∣ = max ( 0 , ∣ A ∣ + ∣ B ∣ − T ) |A \cap B| = \max(0, |A| + |B| - T) ∣ A ∩ B ∣ = max ( 0 , ∣ A ∣ + ∣ B ∣ − T ) — overlap is forced once A A A and B B B together exceed the universe.
These bounds are the set-theory version of the discrete-optimization questions in Section 8.4.
Worked Example: Two-Set Regions
A cohort of 40 40 40 candidates includes 22 22 22 who studied algebra, 18 18 18 who studied statistics, and 8 8 8 who studied both. How many studied neither, and how many studied only algebra?
Union = 22 + 18 − 8 = 32 = 22 + 18 - 8 = 32 = 22 + 18 − 8 = 32 , so neither = 40 − 32 = 8 = 40 - 32 = 8 = 40 − 32 = 8 . Only algebra = 22 − 8 = 14 = 22 - 8 = 14 = 22 − 8 = 14 . Exactly one subject = 14 + 10 = 24 = 14 + 10 = 24 = 14 + 10 = 24 .
Worked Example: Three-Set Pairwise Totals
A club of 120 120 120 members has 60 60 60 tennis players, 50 50 50 golfers, and 40 40 40 squash players. Twenty play tennis and golf, 15 15 15 play tennis and squash, 10 10 10 play golf and squash, and 5 5 5 play all three (those pairwise figures include the triple). How many play none of the three sports?
Union = 60 + 50 + 40 − 20 − 15 − 10 + 5 = 110 = 60 + 50 + 40 - 20 - 15 - 10 + 5 = 110 = 60 + 50 + 40 − 20 − 15 − 10 + 5 = 110 . None = 120 − 110 = 10 = 120 - 110 = 10 = 120 − 110 = 10 . Exclusive check: only tennis-and-golf = 15 = 15 = 15 , only tennis-and-squash = 10 = 10 = 10 , only golf-and-squash = 5 = 5 = 5 , all three = 5 = 5 = 5 , only tennis = 30 = 30 = 30 , only golf = 25 = 25 = 25 , only squash = 20 = 20 = 20 . Those seven occupied regions sum to 110 110 110 ; adding 10 10 10 neither recovers 120 120 120 .
Worked Example: Forced Minimum Overlap
Among 80 80 80 employees, 50 50 50 drink coffee and 45 45 45 drink tea. The greatest possible number who drink both is min ( 50 , 45 ) = 45 \min(50, 45) = 45 min ( 50 , 45 ) = 45 . The least possible number who drink both is max ( 0 , 50 + 45 − 80 ) = 15 \max(0, 50 + 45 - 80) = 15 max ( 0 , 50 + 45 − 80 ) = 15 .