Study guide
5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method
GMAT Exam Focus Edition
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: GMAT Exam Architecture & Strategic Foundations
1.1 GMAT Structure, Section Order, and the 205–805 Score Scale 1.2 Question Bookmarking and the Review & Edit Feature Mechanics 1.3 Test-Day Logistics, Pacing Architecture, and Score Reporting Policies
2 Chapter 2: Quantitative Reasoning — Arithmetic & Number Properties
2.1 Integers, Divisibility Rules, Prime Factorization, and LCM/GCD 2.2 Remainders, Even/Odd Parity, and Positive/Negative Sign Analysis 2.3 Exponents, Radicals, Roots, and Scientific Notation 2.4 Absolute Value, Number Line Properties, and Estimation Techniques
3 Chapter 3: Quantitative Reasoning — Fractions, Decimals, Ratios & Percentages
3.1 Fractions, Decimals, and Real-Number Operations 3.2 Ratios, Proportions, and Scaling Relationships 3.3 Percent Change, Successive Percent Changes, and Multipliers 3.4 Commercial Math: Profit/Loss, Markups, Discounts, and Simple/Compound Interest
4 Chapter 4: Quantitative Reasoning — Algebra, Equations & Inequalities
4.1 Linear Equations and Systems of Simultaneous Equations 4.2 Quadratic Equations, Factoring Patterns, and Roots 4.3 Linear Inequalities, Compound Inequalities, and Absolute Value Inequalities 4.4 Functions, Defined Operational Symbols, and Sequences
5 Chapter 5: Quantitative Reasoning — Word Problems & Modeling
5.1 Rate, Time, and Distance: Uniform Motion, Relative Speed, and Average Speed 5.2 Work Rates: Combined Rates, Sequential Tasks, and Opposing Rates 5.3 Mixture Problems and Weighted Averages 5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method
6 Chapter 6: Quantitative Reasoning — Counting, Probability & Statistics
6.1 Fundamental Counting Principle, Permutations, and Combinations 6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events 6.3 Descriptive Statistics: Mean, Median, Mode, Range, and Weighted Mean 6.4 Standard Deviation, Variance, and Data Dispersion
7 Chapter 7: Verbal Reasoning — Critical Reasoning: Argument Structure & Assumptions
7.1 Anatomy of an Argument: Conclusions, Premises, Assumptions, and Background Context 7.2 Assumption Questions: Necessary vs. Sufficient Assumptions and the Negation Test 7.3 Strengthen Questions: Supporting Premises, Causality, and New Evidence 7.4 Weaken Questions: Identifying Flaws, Alternate Causes, and Counter-Evidence
8 Chapter 8: Verbal Reasoning — Critical Reasoning: Advanced Arguments
8.1 Evaluate the Argument: The Variance Test and Decisive Information 8.2 Resolve the Paradox: Reconciling Conflicting Facts and Surprising Outcomes 8.3 Boldface and Method of Reasoning: Identifying the Role of Statements 8.4 Flaw in the Reasoning: Spotting Formal and Informal Logical Fallacies
9 Chapter 9: Verbal Reasoning — Reading Comprehension: Core Analysis
9.1 Passage Structures, Main Idea, and Author's Primary Purpose 9.2 Supporting Ideas, Explicit Details, and Targeted Information Retrieval 9.3 Inference Questions: Deriving Unstated Claims and Valid Deductions
10 Chapter 10: Verbal Reasoning — Reading Comprehension: Advanced Strategies
10.1 Author's Tone, Attitude, and Epistemic Stance 10.2 Logical Structure, Paragraph Function, and Rhetorical Organization 10.3 Application, Contextual Analogy, and Cross-Disciplinary Synthesis
11 Chapter 11: Data Insights — Data Sufficiency Foundations & Algebra
11.1 Data Sufficiency Architecture: The 5 Answer Choices (AD/BCE) and Yes/No vs. Value Logic 11.2 Golden Rules of DS: Preventing Statement 2 Contamination and Sufficiency Verification 11.3 DS Applied to Arithmetic, Number Properties, and Signs 11.4 DS Applied to Algebraic Equations, Systems, and Inequalities
12 Chapter 12: Data Insights — Data Sufficiency Applied Modeling
12.1 DS Applied to Rates, Ratios, and Work Problems 12.2 DS Applied to Statistics, Averages, and Data Sets 12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability
13 Chapter 13: Data Insights — Multi-Source Reasoning & Table Analysis
13.1 Multi-Source Reasoning: Tab Navigation, Synthesizing Text, Data, and Emails 13.2 MSR Question Formats: Multiple Choice and Three-Part Dichotomous Questions 13.3 Table Analysis: Interactive Sorting, Filtering, and Trend Identification 13.4 Table Analysis: Evaluating Binary Statements (True/False, Yes/No)
14 Chapter 14: Data Insights — Graphics Interpretation & Two-Part Analysis
14.1 Graphics Interpretation: Bar Charts, Line Graphs, and Scatterplots 14.2 Graphics Interpretation: Bubble Charts, Dual-Axis Graphs, and Pie Charts 14.3 Two-Part Analysis: Quantitative and Mathematical Word Problems 14.4 Two-Part Analysis: Verbal, Logic-Based, and Strategic Decision Problems
5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method
Key Takeaways Explain This Topic AI
For two overlapping categorical groups, the Double-Set Matrix (2×2 grid) is vastly superior to Venn diagrams, providing linear horizontal and vertical row/column equations that track mutually exclusive subgroups and the 'Neither' category.
The fundamental two-set union formula is Total = Group A + Group B - (Both A and B) + Neither; omitting 'Neither' or failing to subtract the overlapping intersection results in classic double-counting errors.
Three-group overlapping sets are governed by Total = A + B + C - (pairwise intersections) + (all three) + Neither; when problems define 'exactly two' subsets, use Total = Exactly 1 + Exactly 2 + Exactly 3 + Neither alongside the identity A + B + C = Exactly 1 + 2(Exactly 2) + 3(Exactly 3).
Minimum overlap between two groups A and B is achieved when Neither equals zero: min(A ∩ B) = max(0, A + B - Total); maximum overlap occurs when the smaller set is a complete subset of the larger set: max(A ∩ B) = min(A, B).
Precision in translating English statements to algebraic sets is paramount: 'Either A or B' is inclusive on the GMAT (meaning A, B, or both), whereas 'Only A' requires subtracting all intersections from Group A.
Last updated: September 2026
5.4 Overlapping Sets, Venn Diagrams, and the Double-Set Matrix Method
Quick Summary: Overlapping set problems on the GMAT Focus Quantitative Reasoning measure evaluate your ability to organize categorical populations into mutually exclusive subgroups without double-counting. For scenarios involving two intersecting characteristics (e.g., Spanish speakers vs. non-speakers, finance majors vs. non-majors), the Double-Set Matrix (2×2 grid) is overwhelmingly superior to Venn diagrams. For three intersecting sets, algebraic formulas that distinguish between pairwise overlaps and 'exactly two' subsets allow you to resolve both precise counts and optimization (min/max) questions rapidly without manual sketching.
On the GMAT, overlapping set questions are designed to exploit cognitive carelessness regarding boundaries. Test-takers routinely confuse "members of Group A" with "members of ONLY Group A" , or forget that a population may include individuals belonging to neither category. By formalizing every problem into either a 2×2 matrix or a 3-set algebraic system, you can solve these problems with 100% accuracy in under two minutes.
The Double-Set Matrix: The Definitive 2×2 Tool
Whenever a problem describes a universe of items characterized by two binary variables (e.g., Male/Female and Employed/Unemployed, or Owns Stock / Does Not Own Stock and Owns Bonds / Does Not Own Bonds), do not draw intersecting circles . Instead, immediately draw a 2×2 grid with total rows and columns.
Matrix Anatomy and Cell Definitions Category B Not B ( ∼ B ) Total Category A A ∩ B (Both) A ∩ ∼ B (Only A ) Total A Not A ( ∼ A ) ∼ A ∩ B (Only B ) ∼ A ∩ ∼ B (Neither) Total Not A Total Total B Total Not B Grand Total \begin{array}{|c|c|c|c|}
- \hline
- & \textbf{Category } B & \textbf{Not } B \text{ (} \sim B \text{)} & \textbf{Total} \\
- \hline
- \textbf{Category } A & A \cap B \text{ (Both)} & A \cap \sim B \text{ (Only } A \text{)} & \text{Total } A \\
- \hline
\textbf{Not } A \text{ (} \sim A \text{)} & \sim A \cap B \text{ (Only } B \text{)} & \sim A \cap \sim B \text{ (Neither)} & \text{Total Not } A \\
- \hline
- \textbf{Total} & \text{Total } B & \text{Total Not } B & \textbf{Grand Total} \\
- \hline
\end{array} Category A Not A ( ∼ A ) Total Category B A ∩ B (Both) ∼ A ∩ B (Only B ) Total B Not B ( ∼ B ) A ∩ ∼ B (Only A ) ∼ A ∩ ∼ B (Neither) Total Not B Total Total A Total Not A Grand Total
The Four Invariant Properties of the Double-Set Matrix
Horizontal Sums: Each row sums linearly across: Cell 1 , 1 + Cell 1 , 2 = Row Total ( Both + Only A = Total A ) \text{Cell}_{1,1} + \text{Cell}_{1,2} = \text{Row Total} \quad (\text{Both} + \text{Only } A = \text{Total } A) Cell 1 , 1 + Cell 1 , 2 = Row Total ( Both + Only A = Total A )
Vertical Sums: Each column sums linearly down: Cell 1 , 1 + Cell 2 , 1 = Column Total ( Both + Only B = Total B ) \text{Cell}_{1,1} + \text{Cell}_{2,1} = \text{Column Total} \quad (\text{Both} + \text{Only } B = \text{Total } B) Cell 1 , 1 + Cell 2 , 1 = Column Total ( Both + Only B = Total B )
Grand Total Alignment: Both row totals and column totals sum to the Grand Total: Total A + Total Not A = Grand Total = Total B + Total Not B \text{Total } A + \text{Total Not } A = \text{Grand Total} = \text{Total } B + \text{Total Not } B Total A + Total Not A = Grand Total = Total B + Total Not B
Mutual Exclusivity: The four interior cells are completely disjoint and encompass the entire population without any overlap.
Why the Matrix Outperforms Venn Diagrams
Seamless "Neither" Handling: In a Venn diagram, test-takers routinely forget to draw a surrounding rectangle for "neither." In a matrix, "Neither" is an explicit, mandatory cell ( ( ∼ A ) ∩ ( ∼ B ) (\sim A) \cap (\sim B) ( ∼ A ) ∩ ( ∼ B ) ).
Negative Constraints: If a prompt states "30% of those who do not have A have B" , this translates directly to a conditional relationship within a single row: Cell 2 , 1 = 0.30 × Row 2 Total \text{Cell}_{2,1} = 0.30 \times \text{Row 2 Total} Cell 2 , 1 = 0.30 × Row 2 Total . Venn diagrams cannot visually convey conditional row ratios.
Simple Subtraction: Given any partial set of information, you can fill in remaining cells via rapid one-step addition or subtraction.
The Two-Set Algebraic Formula
If you prefer algebraic formulas, the union of two sets is governed by: Total = Group A + Group B − ( A ∩ B ) + Neither \text{Total} = \text{Group } A + \text{Group } B - (A \cap B) + \text{Neither} Total = Group A + Group B − ( A ∩ B ) + Neither
Why subtract ( A ∩ B ) (A \cap B) ( A ∩ B ) ? Adding Group A \text{Group } A Group A and Group B \text{Group } B Group B counts individuals in the overlapping intersection twice. Subtracting ( A ∩ B ) (A \cap B) ( A ∩ B ) once restores the count to single attribution.
Three Overlapping Sets: 3-Group Venn Anatomy & Formulations
When a problem introduces three categorical groups ( A A A , B B B , and C C C ), the 2×2 matrix cannot accommodate the three-way intersections. You must utilize algebraic formulations derived from 3-circle Venn diagrams.
A system of three overlapping sets partitions the universe into 8 mutually exclusive regions :
Only A \text{Only } A Only A , Only B \text{Only } B Only B , Only C \text{Only } C Only C (3 single-set regions)
Exactly ( A and B ) \text{Exactly } (A \text{ and } B) Exactly ( A and B ) , Exactly ( B and C ) \text{Exactly } (B \text{ and } C) Exactly ( B and C ) , Exactly ( A and C ) \text{Exactly } (A \text{ and } C) Exactly ( A and C ) (3 double-set regions)
All Three ( A ∩ B ∩ C ) \text{All Three } (A \cap B \cap C) All Three ( A ∩ B ∩ C ) (1 central triple-overlap region)
- Neither \text{Neither} Neither (1 exterior region)
- Formula 1: The Standard Inclusion-Exclusion Formula
Use this formula when the problem provides the full pairwise intersections (i.e., people in A A A and B B B , which includes those in all three): Total = A + B + C − ( A ∩ B + B ∩ C + A ∩ C ) + ( A ∩ B ∩ C ) + Neither \text{Total} = A + B + C - (A \cap B + B \cap C + A \cap C) + (A \cap B \cap C) + \text{Neither} Total = A + B + C − ( A ∩ B + B ∩ C + A ∩ C ) + ( A ∩ B ∩ C ) + Neither
Why Add Back ( A ∩ B ∩ C ) (A \cap B \cap C) ( A ∩ B ∩ C ) ?
In the sum A + B + C A + B + C A + B + C , an individual in all three sets is counted 3 times .
In the pairwise sum ( A ∩ B + B ∩ C + A ∩ C ) (A \cap B + B \cap C + A \cap C) ( A ∩ B + B ∩ C + A ∩ C ) , that individual is subtracted 3 times ( 3 − 3 = 0 3 - 3 = 0 3 − 3 = 0 ).
To include them in the total population count, they must be added back once ( + A ∩ B ∩ C + A \cap B \cap C + A ∩ B ∩ C ).
Formula 2: The "Exactly" Formulation
Use this pair of equations when the problem provides data in terms of individuals belonging to "exactly two groups" or "only two courses" : Total = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + Neither \text{Total} = (\text{Exactly 1}) + (\text{Exactly 2}) + (\text{Exactly 3}) + \text{Neither} Total = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + Neither Sum of Groups ( A + B + C ) = ( Exactly 1 ) + 2 ( Exactly 2 ) + 3 ( Exactly 3 ) \text{Sum of Groups } (A + B + C) = (\text{Exactly 1}) + 2(\text{Exactly 2}) + 3(\text{Exactly 3}) Sum of Groups ( A + B + C ) = ( Exactly 1 ) + 2 ( Exactly 2 ) + 3 ( Exactly 3 )
Subtracting the first equation from the second yields a powerful shortcut identity: ( A + B + C ) − Total = ( Exactly 2 ) + 2 ( Exactly 3 ) − Neither (A + B + C) - \text{Total} = (\text{Exactly 2}) + 2(\text{Exactly 3}) - \text{Neither} ( A + B + C ) − Total = ( Exactly 2 ) + 2 ( Exactly 3 ) − Neither
Critical GMAT Wording Distinction:
"15 people study French and German": This is a full pairwise intersection ( A ∩ B A \cap B A ∩ B ). It includes those who also study Spanish.
"15 people study French and German ONLY": This is a disjoint subset of exactly two ( { A ∩ B } ∖ C \{A \cap B\} \setminus C { A ∩ B } ∖ C ). It excludes those who study Spanish.
Optimization and Extremes: Minimizing and Maximizing Overlaps
High-difficulty GMAT questions frequently ask for the minimum or maximum possible number of people belonging to an intersection.
Two-Set Min/Max Rules
Consider a universe of size T T T , with ∣ A ∣ |A| ∣ A ∣ members in Group A and ∣ B ∣ |B| ∣ B ∣ members in Group B (assume ∣ A ∣ ≤ ∣ B ∣ |A| \le |B| ∣ A ∣ ≤ ∣ B ∣ ):
Maximum Overlap ( max ( A ∩ B ) \max(A \cap B) max ( A ∩ B ) ):
Occurs when the smaller group is completely contained inside the larger group ( A ⊆ B A \subseteq B A ⊆ B ). max ( A ∩ B ) = min ( ∣ A ∣ , ∣ B ∣ ) = ∣ A ∣ \max(A \cap B) = \min(|A|, |B|) = |A| max ( A ∩ B ) = min ( ∣ A ∣ , ∣ B ∣ ) = ∣ A ∣
Minimum Overlap ( min ( A ∩ B ) \min(A \cap B) min ( A ∩ B ) ):
Occurs when the "Neither" group is pushed to zero ( Neither = 0 \text{Neither} = 0 Neither = 0 ), forcing the sets to overlap as much as necessary to fit within the total population T T T . min ( A ∩ B ) = max ( 0 , ∣ A ∣ + ∣ B ∣ − T ) \min(A \cap B) = \max(0, |A| + |B| - T) min ( A ∩ B ) = max ( 0 , ∣ A ∣ + ∣ B ∣ − T )
Three-Set Minimum Overlap Shortcut (Complement Method)
To find the minimum possible number of individuals who belong to all three groups A A A , B B B , and C C C in a population of size T T T , maximize the number of individuals who are missing from at least one group:
Calculate the complement size for each group:
- Not in A A A : T − ∣ A ∣ T - |A| T − ∣ A ∣
- Not in B B B : T − ∣ B ∣ T - |B| T − ∣ B ∣
- Not in C C C : T − ∣ C ∣ T - |C| T − ∣ C ∣
The maximum number of individuals missing from at least one group occurs if these non-membership sets are completely disjoint: Max Missing at Least One = ( T − ∣ A ∣ ) + ( T − ∣ B ∣ ) + ( T − ∣ C ∣ ) \text{Max Missing at Least One} = (T - |A|) + (T - |B|) + (T - |C|) Max Missing at Least One = ( T − ∣ A ∣ ) + ( T − ∣ B ∣ ) + ( T − ∣ C ∣ )
The minimum overlap of all three is whatever is left over: min ( A ∩ B ∩ C ) = T − [ ( T − ∣ A ∣ ) + ( T − ∣ B ∣ ) + ( T − ∣ C ∣ ) ] \min(A \cap B \cap C) = T - \left[(T - |A|) + (T - |B|) + (T - |C|)\right] min ( A ∩ B ∩ C ) = T − [ ( T − ∣ A ∣ ) + ( T − ∣ B ∣ ) + ( T − ∣ C ∣ ) ] (If this result is negative or zero, the minimum overlap is 0).
Decoding GMAT Set Terminology
English Phrasing in GMAT Prompt Formal Set-Theoretic Meaning Algebraic Formulation
"Either A or B" Inclusive union ( A ∪ B A \cup B A ∪ B ) A + B − ( A ∩ B ) A + B - (A \cap B) A + B − ( A ∩ B )
"Either A or B, but NOT both" Symmetric difference Only A + Only B = ( A ∪ B ) − ( A ∩ B ) \text{Only } A + \text{Only } B = (A \cup B) - (A \cap B) Only A + Only B = ( A ∪ B ) − ( A ∩ B )
"A but not B" Difference ( A ∖ B A \setminus B A ∖ B ) A − ( A ∩ B ) A - (A \cap B) A − ( A ∩ B )
"At least one of the three" Union of three sets ( A ∪ B ∪ C A \cup B \cup C A ∪ B ∪ C ) Total − Neither \text{Total} - \text{Neither} Total − Neither
"At most two of the three" Universe excluding all-three Total − ( A ∩ B ∩ C ) \text{Total} - (A \cap B \cap C) Total − ( A ∩ B ∩ C )
"Exactly one" Disjoint singletons Only A + Only B + Only C \text{Only } A + \text{Only } B + \text{Only } C Only A + Only B + Only C
"Neither A nor B" Complement of union ( A ∪ B ) c A \cup B)^c A ∪ B ) c Total − [ A + B − ( A ∩ B ) ] \text{Total} - [A + B - (A \cap B)] Total − [ A + B − ( A ∩ B )]
Alert on "Either / Or": In standard conversational English, "either A or B" is sometimes used exclusively. On the GMAT, "either A or B" is strictly inclusive (meaning A, B, or both) unless the prompt explicitly adds the clause "but not both" .
- Worked Problem Solving Examples
- Example 1: Double-Set Matrix with Survey Data
Problem: In a survey of 200 corporate executives, 120 speak Spanish, 90 speak French, and 40 speak neither Spanish nor French. How many of the surveyed executives speak both Spanish and French, and how many speak Spanish but not French?
Step-by-Step Solution:
Construct the 2×2 Matrix:
Columns: French ( F F F ), Not French ( ∼ F \sim F ∼ F ), Total.
Rows: Spanish ( S S S ), Not Spanish ( ∼ S \sim S ∼ S ), Total.
Insert Known Values:
Grand Total = 200 = 200 = 200 .
Total Spanish (Row 1 Total) = 120 = 120 = 120 .
Total French (Col 1 Total) = 90 = 90 = 90 .
Neither (Row 2, Col 2) = 40 = 40 = 40 .
Compute Row and Column Totals:
Total Not Spanish (Row 2 Total) = 200 − 120 = 80 = 200 - 120 = 80 = 200 − 120 = 80 .
Total Not French (Col 2 Total) = 200 − 90 = 110 = 200 - 90 = 110 = 200 − 90 = 110 .
Solve Interior Cells:
Look at Row 2 (Not Spanish): Only F + Neither = Row 2 Total ⟹ Only F + 40 = 80 ⟹ Only F = 40 \text{Only } F + \text{Neither} = \text{Row 2 Total} \implies \text{Only } F + 40 = 80 \implies \text{Only } F = 40 Only F + Neither = Row 2 Total ⟹ Only F + 40 = 80 ⟹ Only F = 40
Look at Column 1 (Total French = 90): Both ( S ∩ F ) + Only F = 90 ⟹ Both + 40 = 90 ⟹ Both = 50 \text{Both } (S \cap F) + \text{Only } F = 90 \implies \text{Both} + 40 = 90 \implies \textbf{Both} = 50 Both ( S ∩ F ) + Only F = 90 ⟹ Both + 40 = 90 ⟹ Both = 50
Look at Row 1 (Total Spanish = 120): Both + Only S = 120 ⟹ 50 + Only S = 120 ⟹ Only S = 70 \text{Both} + \text{Only } S = 120 \implies 50 + \text{Only } S = 120 \implies \textbf{Only } S = 70 Both + Only S = 120 ⟹ 50 + Only S = 120 ⟹ Only S = 70
Verify Matrix Consistency:
Row 1: 50 + 70 = 120 50 + 70 = 120 50 + 70 = 120 .
Row 2: 40 + 40 = 80 40 + 40 = 80 40 + 40 = 80 .
Col 1: 50 + 40 = 90 50 + 40 = 90 50 + 40 = 90 .
Col 2: 70 + 40 = 110 70 + 40 = 110 70 + 40 = 110 .
Grand Total: 120 + 80 = 200 120 + 80 = 200 120 + 80 = 200 and 90 + 110 = 200 90 + 110 = 200 90 + 110 = 200 .
Answers: 50 executives speak both languages; 70 speak Spanish but not French.
Example 2: Three-Group Enrollment with "Exactly" Categories
Problem: In an executive cohort of 120 MBA students, 65 are enrolled in Corporate Strategy, 55 are enrolled in Financial Modeling, and 40 are enrolled in Global Supply Chain. Exactly 25 students are enrolled in exactly two of these courses, and 10 students are enrolled in all three courses. How many students in the cohort are enrolled in none of the three courses?
Step-by-Step Solution:
Define the Variables:
Total cohort = 120 = 120 = 120 .
Course totals: Strategy S = 65 S = 65 S = 65 , Finance F = 55 F = 55 F = 55 , Supply Chain C = 40 C = 40 C = 40 .
Enrolled in exactly two courses: E 2 = 25 E_2 = 25 E 2 = 25 .
Enrolled in all three courses: E 3 = 10 E_3 = 10 E 3 = 10 .
Let E 1 = enrolled in exactly one course E_1 = \text{enrolled in exactly one course} E 1 = enrolled in exactly one course , and N = enrolled in none N = \text{enrolled in none} N = enrolled in none .
Set Up the Sum of Groups Identity: S + F + C = E 1 + 2 ( E 2 ) + 3 ( E 3 ) S + F + C = E_1 + 2(E_2) + 3(E_3) S + F + C = E 1 + 2 ( E 2 ) + 3 ( E 3 ) 65 + 55 + 40 = E 1 + 2 ( 25 ) + 3 ( 10 ) 65 + 55 + 40 = E_1 + 2(25) + 3(10) 65 + 55 + 40 = E 1 + 2 ( 25 ) + 3 ( 10 ) 160 = E 1 + 50 + 30 160 = E_1 + 50 + 30 160 = E 1 + 50 + 30 160 = E 1 + 80 ⟹ E 1 = 80 160 = E_1 + 80 \implies E_1 = 80 160 = E 1 + 80 ⟹ E 1 = 80
Calculate Total Enrolled in At Least One Course: Enrolled in ≥ 1 course = E 1 + E 2 + E 3 = 80 + 25 + 10 = 115 \text{Enrolled in } \ge 1 \text{ course} = E_1 + E_2 + E_3 = 80 + 25 + 10 = 115 Enrolled in ≥ 1 course = E 1 + E 2 + E 3 = 80 + 25 + 10 = 115
Determine the Number Enrolled in None: N = Total − Enrolled in ≥ 1 = 120 − 115 = 5 N = \text{Total} - \text{Enrolled in } \ge 1 = 120 - 115 = 5 N = Total − Enrolled in ≥ 1 = 120 − 115 = 5 Exactly 5 students are enrolled in none of the three courses.
Example 3: Three-Group Minimum Overlap Optimization
Problem: At a technology enterprise with 100 employees, 82 employees own a company laptop, 75 own a company smartphone, and 68 own a company tablet. What is the minimum possible number of employees who own all three devices?
Step-by-Step Solution:
Identify the Complements (Non-Ownership Counts):
Employees without a laptop: 100 − 82 = 18 100 - 82 = 18 100 − 82 = 18 .
Employees without a smartphone: 100 − 75 = 25 100 - 75 = 25 100 − 75 = 25 .
Employees without a tablet: 100 − 68 = 32 100 - 68 = 32 100 − 68 = 32 .
Maximize the Group Missing At Least One Device:
To minimize the triple intersection (those who own all three), we must maximize the number of employees who are missing at least one device.
The maximum missing count occurs if there is zero overlap among non-owners: Max Missing ≥ 1 = 18 + 25 + 32 = 75 \text{Max Missing } \ge 1 = 18 + 25 + 32 = 75 Max Missing ≥ 1 = 18 + 25 + 32 = 75
Compute the Minimum All-Three Ownership Count: min ( All 3 ) = Total Employees − Max Missing ≥ 1 = 100 − 75 = 25 \min(\text{All 3}) = \text{Total Employees} - \text{Max Missing } \ge 1 = 100 - 75 = 25 min ( All 3 ) = Total Employees − Max Missing ≥ 1 = 100 − 75 = 25
Verify via Pairwise Bounds:
Minimum owning both laptop and smartphone: 82 + 75 − 100 = 57 82 + 75 - 100 = 57 82 + 75 − 100 = 57 .
Minimum owning both and also a tablet: 57 + 68 − 100 = 25 57 + 68 - 100 = 25 57 + 68 − 100 = 25 .
The minimum possible number of employees owning all three devices is exactly 25 .
High-Frequency GMAT Traps & Pacing Strategies
Trap 1: Confusing "Group A" with "Only Group A": When a question states that "50 people like tea," that 50 includes people who like tea AND coffee. If you place 50 in the "Only Tea" cell of your matrix, every subsequent calculation will be incorrect.
Trap 2: Double-Counting Overlaps in Three-Set Problems: If a problem states that "15 people take both Math and Physics," this is a full pairwise intersection. If you treat 15 as "Math and Physics only" when applying A + B + C − ( intersections ) A + B + C - (\text{intersections}) A + B + C − ( intersections ) , you will distort the count.
Trap 3: Overlooking the "Neither" Population: Many test-takers assume that the sum of groups equals the total population ( A ∪ B = Total A \cup B = \text{Total} A ∪ B = Total ). On the GMAT, questions frequently feature a non-zero "neither" category ( ( ∼ A ) ∩ ( ∼ B ) > 0 (\sim A) \cap (\sim B) > 0 ( ∼ A ) ∩ ( ∼ B ) > 0 ). Always allocate an explicit slot for "Neither".
Trap 4: Misapplying "Either / Or": On GMAT Problem Solving, "either A or B" is inclusive. If a problem states "find the probability that an employee owns either a car or a house," you must calculate P ( C ∪ H ) = P ( C ) + P ( H ) − P ( C ∩ H ) P(C \cup H) = P(C) + P(H) - P(C \cap H) P ( C ∪ H ) = P ( C ) + P ( H ) − P ( C ∩ H ) .