Study guide

12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability

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

12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability

Key Takeaways Explain This Topic AI

In overlapping set problems with two binary characteristics, organizing data into a 2x2 double-set matrix reveals that out of 9 total cells, exactly 4 independent cell values are required to completely determine the entire matrix.

To solve for a single target cell or marginal total in a double-set matrix, determining all individual cells is unnecessary if a given statement directly constrains the target cell via a linear aggregate.

In three-set Venn diagrams, the master equation Total = A + B + C - (sum of 2-set overlaps) + (all three) + Neither connects the aggregate groups; distinguish carefully between 'both A and B' (which includes the center) and 'only A and B' (which excludes the center).

Two events A and B are statistically independent if and only if P(A ∩ B) = P(A) × P(B); in Data Sufficiency, an assertion of independence provides an independent non-linear equation that eliminates one degree of freedom.

Without an explicit statement of independence or mutual exclusivity, knowing individual probabilities P(A) and P(B) is strictly insufficient to determine joint probability P(A ∩ B) or union probability P(A ∪ B).

Last updated: September 2026

12.3 DS Applied to Overlapping Sets, Venn Diagrams, and Probability

Quick Summary: Overlapping sets and probability questions on GMAT Focus Data Sufficiency evaluate your mastery of mathematical systems and constraint satisfaction. For two overlapping categories, the 2x2 Double-Set Matrix is the ultimate operational tool: four mutually exclusive internal cells sum to four marginal totals and one grand total. While the complete matrix has 4 degrees of freedom, targeted questions often require only 1 or 2 specific constraints. For three-set problems, distinguish between pairwise overlaps ( A B + B C + A C AB + BC + AC A B + BC + A C ) and exact two-set regions (which strip out the triple intersection). In probability, sufficiency hinges on structural event definitions: knowing P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) can never determine P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) or P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) unless the prompt or statements explicitly confirm that the events are independent ( P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B ) ) or mutually exclusive ( P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 ).

The Double-Set Matrix Framework in Data Sufficiency

When a problem classifies a population across two binary characteristics (e.g., Male vs. Female, Enrolled vs. Not Enrolled, Product A vs. Not Product A), drawing Venn circles is prone to spatial confusion. The Double-Set Matrix organizes the sample space into a 9-cell system of linear equations:

Characteristic B B B Not Characteristic B B B ( ∼ B \sim B ∼ B ) Total

Characteristic A A A A ∩ B A \cap B A ∩ B A ∩ ∼ B A \cap \sim B A ∩ ∼ B T o t a l ( A ) \mathbf{Total}(A) Total ( A )

Not Characteristic A A A ( ∼ A \sim A ∼ A ) ∼ A ∩ B \sim A \cap B ∼ A ∩ B ∼ A ∩ ∼ B \sim A \cap \sim B ∼ A ∩ ∼ B T o t a l ( ∼ A ) \mathbf{Total}(\sim A) Total ( ∼ A )

Total T o t a l ( B ) \mathbf{Total}(B) Total ( B ) T o t a l ( ∼ B ) \mathbf{Total}(\sim B) Total ( ∼ B ) G r a n d T o t a l N \mathbf{Grand~Total}~N Grand Total N

Degrees of Freedom and Sufficiency Mechanics

The 9-cell matrix contains:

4 mutually exclusive interior cells: ( A ∩ B ) (A \cap B) ( A ∩ B ) , ( A ∩ ∼ B ) (A \cap \sim B) ( A ∩ ∼ B ) , ( ∼ A ∩ B ) (\sim A \cap B) ( ∼ A ∩ B ) , and ( ∼ A ∩ ∼ B ) (\sim A \cap \sim B) ( ∼ A ∩ ∼ B ) .

4 marginal totals: Total ( A ) \text{Total}(A) Total ( A ) , Total ( ∼ A ) \text{Total}(\sim A) Total ( ∼ A ) , Total ( B ) \text{Total}(B) Total ( B ) , and Total ( ∼ B ) \text{Total}(\sim B) Total ( ∼ B ) .

1 grand total: N N N .

Because row sums and column sums create 5 linear dependencies ( r 1 + r 2 = row sum r_1 + r_2 = \text{row sum} r 1 ​ + r 2 ​ = row sum , etc.), the entire 9-cell system has exactly 4 degrees of freedom (or 3 degrees of freedom if the Grand Total N N N is already fixed in the question stem).

The Targeted Sufficiency Shortcut:

If the question stem asks for a specific cell (e.g., "How many executives belong to both Group A and Group B?" ), you do NOT need to resolve all 4 degrees of freedom! You only need an equation that links the target cell directly to known totals via the master inclusion-exclusion identity:

N = Total ( A ) + Total ( B ) − ( A ∩ B ) + ( Neither ) N = \text{Total}(A) + \text{Total}(B) - (A \cap B) + (\text{Neither}) N = Total ( A ) + Total ( B ) − ( A ∩ B ) + ( Neither )

If the question stem provides N N N , Total ( A ) \text{Total}(A) Total ( A ) , and Total ( B ) \text{Total}(B) Total ( B ) , then finding ( A ∩ B ) (A \cap B) ( A ∩ B ) is mathematically equivalent to finding ( Neither ) (\text{Neither}) ( Neither ) . Any statement that provides ( Neither ) (\text{Neither}) ( Neither ) immediately yields sufficiency for ( A ∩ B ) (A \cap B) ( A ∩ B ) !

Three-Set Venn Diagrams: Pairwise Overlaps vs. "Exactly Two"

When three categories overlap ( A , B , C A, B, C A , B , C ), the universe decomposes into 8 distinct regions:

  • Only A A A , Only B B B , Only C C C (Exactly 1 set)
  • Only A A A and B B B , Only B B B and C C C , Only A A A and C C C (Exactly 2 sets)
  • All three sets ( A ∩ B ∩ C A \cap B \cap C A ∩ B ∩ C , Exactly 3 sets)
  • Neither set ( { 0 } \{0\} { 0 } , None) [ Three-Set Decomposition ]
  • ┌───────────────────────────┴───────────────────────────┐
  • ▼ ▼
  • [ Master Inclusion-Exclusion ] [ Partition Formula ]
  • Total = A + B + C Total = (Exactly 1)
  • (AB + BC + AC) + (Exactly 2)
  • + (A ∩ B ∩ C) + None + (Exactly 3) + None

The Two Master Equations Equation 1 (Gross Intersections): N = A + B + C − ( A B + B C + A C ) + ( A ∩ B ∩ C ) + None Equation 2 (Disjoint Partitions): N = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + None \begin{aligned}

\textbf{Equation 1 (Gross Intersections):} \quad N &= A + B + C - (AB + BC + AC) + (A \cap B \cap C) + \text{None} \\[6pt]

\textbf{Equation 2 (Disjoint Partitions):} \quad N &= (\text{Exactly 1}) + (\text{Exactly 2}) + (\text{Exactly 3}) + \text{None}

\end{aligned} Equation 1 (Gross Intersections): N Equation 2 (Disjoint Partitions): N ​ = A + B + C − ( A B + BC + A C ) + ( A ∩ B ∩ C ) + None = ( Exactly 1 ) + ( Exactly 2 ) + ( Exactly 3 ) + None ​

The Definitive GMAT Sufficiency Trap: Pairwise vs. Disjoint Overlaps

Notice the difference between the two overlap expressions: ( A B + B C + A C ) = ( Exactly 2 ) + 3 × ( Exactly 3 ) (AB + BC + AC) = (\text{Exactly 2}) + 3 \times (\text{Exactly 3}) ( A B + BC + A C ) = ( Exactly 2 ) + 3 × ( Exactly 3 )

The term ( A B ) (AB) ( A B ) represents all elements common to A A A and B B B , including those that also belong to C C C .

The term "Only A A A and B B B " excludes the triple intersection.

If a statement says "15 students study both French and Spanish" , that is a gross intersection ( A B = 15 AB = 15 A B = 15 ). If it says "15 students study French and Spanish but NOT German" , that is a disjoint component of (Exactly 2).

For Data Sufficiency, to determine ( A ∩ B ∩ C ) (A \cap B \cap C) ( A ∩ B ∩ C ) from Equation 1, you must know ( A + B + C ) (A + B + C) ( A + B + C ) , None \text{None} None , and the gross sum ( A B + B C + A C ) (AB + BC + AC) ( A B + BC + A C ) . Knowing only one pairwise overlap (e.g., just A B AB A B ) leaves the other two pairwise terms unconstrained, producing an indeterminate system.

Probability Sufficiency: Independence and Conditional Constraints

Probability questions on Data Sufficiency test whether you can recognize when an event space is constrained versus when it contains unconstrained correlation.

The Addition Rule in DS P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )

This equation contains 4 variables. Knowing any three allows you to solve for the fourth. If a question stem asks for P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) (the probability that at least one event occurs), knowing P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) alone is NOT sufficient because the joint probability P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) can range anywhere within the Fréchet bounds: max ⁡ ( 0 , P ( A ) + P ( B ) − 1 ) ≤ P ( A ∩ B ) ≤ min ⁡ ( P ( A ) , P ( B ) ) \max(0, P(A) + P(B) - 1) \le P(A \cap B) \le \min(P(A), P(B)) max ( 0 , P ( A ) + P ( B ) − 1 ) ≤ P ( A ∩ B ) ≤ min ( P ( A ) , P ( B ))

The Power of the Independence Assertion

If the prompt or a statement explicitly asserts that Events A A A and B B B are independent , a non-linear algebraic relationship is established: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )

This eliminates one degree of freedom entirely! When events are independent: P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ) P ( B ) = 1 − ( 1 − P ( A ) ) ( 1 − P ( B ) ) P(A \cup B) = P(A) + P(B) - P(A)P(B) = 1 - (1 - P(A))(1 - P(B)) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ) P ( B ) = 1 − ( 1 − P ( A )) ( 1 − P ( B )) And P ( ∼ A ∩ ∼ B ) = ( 1 − P ( A ) ) ( 1 − P ( B ) ) \text{And} \quad P(\sim A \cap \sim B) = (1 - P(A))(1 - P(B)) And P ( ∼ A ∩ ∼ B ) = ( 1 − P ( A )) ( 1 − P ( B ))

Sufficiency Rule: If A A A and B B B are independent, knowing P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) is ALONE sufficient to compute P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) , P ( A ∪ B ) P(A \cup B) P ( A ∪ B ) , P ( A ∣ B ) P(A \mid B) P ( A ∣ B ) , and P ( Neither ) P(\text{Neither}) P ( Neither ) !

Mutually Exclusive Events

If events A A A and B B B are mutually exclusive (disjoint), they cannot occur simultaneously: P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . In this case, P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B ) . Again, this eliminates the joint overlap variable.

Conditional Probability Sufficiency P ( A ∣ B ) = P ( A ∩ B ) P ( B ) ⟹ P ( A ∩ B ) = P ( A ∣ B ) × P ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} \implies P(A \cap B) = P(A \mid B) \times P(B) P ( A ∣ B ) = P ( B ) P ( A ∩ B ) ​ ⟹ P ( A ∩ B ) = P ( A ∣ B ) × P ( B )

If a statement provides the conditional probability P ( A ∣ B ) P(A \mid B) P ( A ∣ B ) and the marginal probability P ( B ) P(B) P ( B ) , their product immediately fixes the intersection P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) , achieving sufficiency for intersection or union questions.

  • Complete Worked DS Scenarios
  • Worked Example 1: 2x2 Matrix Sufficiency for Corporate Staffing

Question Stem:

In an international bank branch with 150 total employees, each employee is either an account manager or a compliance officer, and each employee works either primarily remotely or primarily on-site. How many compliance officers at the branch work primarily on-site?

Statement (1): At the branch, 65 employees are account managers who work primarily remotely, and 45 employees are compliance officers.

Statement (2): At the branch, 80 employees work primarily remotely.

Analytical Deconstruction

Set up the 2x2 matrix with rows representing Job Role (Account Manager A A A , Compliance Officer C C C ) and columns representing Work Location (Remote R R R , On-Site O O O ). Role / Location Remote ( R ) On-Site ( O ) Total Account Manager ( A ) A R A O A total Compliance Officer ( C ) C R C O (Target) C total Total R total O total N = 150 \begin{array}{|c|c|c|c|}

  • \hline
  • \textbf{Role / Location} & \textbf{Remote } (R) & \textbf{On-Site } (O) & \textbf{Total} \\
  • \hline
  • \textbf{Account Manager } (A) & A_R & A_O & A_{\text{total}} \\
  • \hline
  • \textbf{Compliance Officer } (C) & C_R & \mathbf{C_O \text{ (Target)}} & C_{\text{total}} \\
  • \hline
  • \textbf{Total} & R_{\text{total}} & O_{\text{total}} & N = 150 \\
  • \hline

\end{array} Role / Location Account Manager ( A ) Compliance Officer ( C ) Total ​ Remote ( R ) A R ​ C R ​ R total ​ ​ On-Site ( O ) A O ​ C O ​ (Target) O total ​ ​ Total A total ​ C total ​ N = 150 ​ ​

Evaluating Statement (1) Alone:

Statement (1) gives A R = 65 A_R = 65 A R ​ = 65 and C total = 45 C_{\text{total}} = 45 C total ​ = 45 .

Since N = 150 N = 150 N = 150 and C total = 45 C_{\text{total}} = 45 C total ​ = 45 , we can deduce A total = 150 − 45 = 105 A_{\text{total}} = 150 - 45 = 105 A total ​ = 150 − 45 = 105 .

Since A total = A R + A O A_{\text{total}} = A_R + A_O A total ​ = A R ​ + A O ​ , we have 105 = 65 + A O ⟹ A O = 40 105 = 65 + A_O \implies A_O = 40 105 = 65 + A O ​ ⟹ A O ​ = 40 .

However, for compliance officers, we only know C R + C O = 45 C_R + C_O = 45 C R ​ + C O ​ = 45 . The target C O C_O C O ​ can be any integer from 0 to 45 (for example, C O = 10 C_O = 10 C O ​ = 10 and C R = 35 C_R = 35 C R ​ = 35 , or C O = 25 C_O = 25 C O ​ = 25 and C R = 20 C_R = 20 C R ​ = 20 ). Statement (1) alone is NOT sufficient .

Evaluating Statement (2) Alone:

Statement (2) gives R total = 80 R_{\text{total}} = 80 R total ​ = 80 .

This allows us to find O total = 150 − 80 = 70 O_{\text{total}} = 150 - 80 = 70 O total ​ = 150 − 80 = 70 .

However, O total = A O + C O = 70 O_{\text{total}} = A_O + C_O = 70 O total ​ = A O ​ + C O ​ = 70 . Without information dividing the on-site employees between account managers and compliance officers, C O C_O C O ​ is undetermined. Statement (2) alone is NOT sufficient .

Evaluating Statements (1) and (2) Together:

From Statement (1), we found A O = 40 A_O = 40 A O ​ = 40 .

From Statement (2), we found O total = 70 O_{\text{total}} = 70 O total ​ = 70 .

Because the on-site column must sum to the total on-site count: A O + C O = O total ⟹ 40 + C O = 70 ⟹ C O = 30 A_O + C_O = O_{\text{total}} \implies 40 + C_O = 70 \implies C_O = 30 A O ​ + C O ​ = O total ​ ⟹ 40 + C O ​ = 70 ⟹ C O ​ = 30

The target cell C O C_O C O ​ is uniquely fixed at 30.

Conclusion: Both statements together are sufficient, but neither statement alone is sufficient.

Worked Example 2: Probability and Independent Systems

Question Stem:

A quality-control testing station evaluates microchips for two independent defects: solder bridging (Defect A) and silicon cracking (Defect B). What is the probability that a randomly selected microchip from the production line has neither defect?

Statement (1): The probability that a randomly selected microchip has Defect A is 0.08, and the probability that it has Defect B is 0.05.

Statement (2): The probability that a randomly selected microchip has both Defect A and Defect B is 0.004.

Analytical Deconstruction

The prompt establishes a foundational physical constraint: Defect A and Defect B are INDEPENDENT .

Therefore, by definition of statistical independence: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) P ( neither ) = P ( ∼ A ∩ ∼ B ) = ( 1 − P ( A ) ) × ( 1 − P ( B ) ) = 1 − [ P ( A ) + P ( B ) − P ( A ) P ( B ) ] P(\text{neither}) = P(\sim A \cap \sim B) = (1 - P(A)) \times (1 - P(B)) = 1 - [P(A) + P(B) - P(A)P(B)] P ( neither ) = P ( ∼ A ∩ ∼ B ) = ( 1 − P ( A )) × ( 1 − P ( B )) = 1 − [ P ( A ) + P ( B ) − P ( A ) P ( B )]

Evaluating Statement (1) Alone:

Statement (1) gives P ( A ) = 0.08 P(A) = 0.08 P ( A ) = 0.08 and P ( B ) = 0.05 P(B) = 0.05 P ( B ) = 0.05 .

Substitute directly into the independent probability identity: P ( neither ) = ( 1 − 0.08 ) ( 1 − 0.05 ) = ( 0.92 ) ( 0.95 ) = 0.874 P(\text{neither}) = (1 - 0.08)(1 - 0.05) = (0.92)(0.95) = 0.874 P ( neither ) = ( 1 − 0.08 ) ( 1 − 0.05 ) = ( 0.92 ) ( 0.95 ) = 0.874

This provides a single, unique numerical value. Statement (1) alone is SUFFICIENT .

Evaluating Statement (2) Alone:

Statement (2) gives P ( A ∩ B ) = 0.004 P(A \cap B) = 0.004 P ( A ∩ B ) = 0.004 .

Since A A A and B B B are independent, P ( A ) × P ( B ) = 0.004 P(A) \times P(B) = 0.004 P ( A ) × P ( B ) = 0.004 .

Infinitely many pairs of probabilities satisfy this equation:

If P ( A ) = 0.08 P(A) = 0.08 P ( A ) = 0.08 and P ( B ) = 0.05 P(B) = 0.05 P ( B ) = 0.05 , then P ( neither ) = ( 0.92 ) ( 0.95 ) = 0.874 P(\text{neither}) = (0.92)(0.95) = 0.874 P ( neither ) = ( 0.92 ) ( 0.95 ) = 0.874 .

If P ( A ) = 0.04 P(A) = 0.04 P ( A ) = 0.04 and P ( B ) = 0.10 P(B) = 0.10 P ( B ) = 0.10 , then P ( neither ) = ( 0.96 ) ( 0.90 ) = 0.864 P(\text{neither}) = (0.96)(0.90) = 0.864 P ( neither ) = ( 0.96 ) ( 0.90 ) = 0.864 .

Because different probabilities yield different values for P ( neither ) P(\text{neither}) P ( neither ) , Statement (2) alone is NOT sufficient . Conclusion: Statement (1) alone is sufficient, but statement (2) alone is not sufficient.

High-Frequency Traps in Overlapping Sets and Probability DS

The Phantom Independence Assumption: Assuming two real-world events are independent when the prompt does not state they are independent. Unless the prompt explicitly confirms independence, you must assume P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) is an independent unknown variable.

Ignoring the "Neither" Group: In overlapping set problems, candidates often set Total = A + B − ( A ∩ B ) \text{Total} = A + B - (A \cap B) Total = A + B − ( A ∩ B ) , completely forgetting that some individuals may belong to neither category. Never omit the Neither \text{Neither} Neither cell in the 2x2 matrix.

Confusing Overlap Classifications in 3-Set Venn Diagrams: Treating the phrase "students who like both Math and Physics" as meaning students who like only Math and Physics. On the GMAT, "both A and B" includes those who like all three unless the word "only" is explicitly specified.

Over-solving the 2x2 Matrix: Spending two minutes trying to compute all 9 cells of a double-set matrix when a single column or row relationship already answers the target question.

Loading diagram... Double-Set Matrix vs. 3-Set Venn Sufficiency Protocol