Study guide

6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events

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

6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events

Key Takeaways Explain This Topic AI

Probability quantifies the likelihood of an event as the ratio of favorable outcomes to total equally likely outcomes in a sample space: P(E) = n(E) / n(S), bounded strictly between 0 and 1 inclusive.

The Addition Rule calculates compound 'OR' probability: P(A ∪ B) = P(A) + P(B) - P(A ∩ B), which simplifies to P(A) + P(B) when events are mutually exclusive.

The Multiplication Rule calculates joint 'AND' probability: P(A ∩ B) = P(A) × P(B|A), which reduces to P(A) × P(B) when events are strictly independent.

Sampling without replacement alters the sample space on every subsequent draw, converting independent trials into dependent trials by decrementing both the numerator and the denominator.

The 'At Least One' complementary shortcut (P(at least one) = 1 - P(none)) dramatically simplifies multi-trial probability calculations by bypassing laborious case-by-case summation.

Last updated: September 2026

6.2 Probability Rules: Independent, Dependent, Mutually Exclusive, and Complementary Events

Quick Summary: GMAT probability questions require identifying whether events are mutually exclusive (Addition Rule) or independent/dependent (Multiplication Rule). When a problem involves draws without replacement, always update both the numerator and denominator. When facing an 'at least one' question, immediately deploy the complementary shortcut: P ( at least one ) = 1 − P ( none ) P(\text{at least one}) = 1 - P(\text{none}) P ( at least one ) = 1 − P ( none ) .

Probability on the GMAT Focus Edition is an extension of counting. Every probability problem can be framed as the ratio of two combinatorial values: the size of the restricted event set divided by the size of the total sample space.

The Core Probability Framework and Bounds

For any experiment with a finite sample space S S S consisting of equally likely outcomes, the probability of an event E E E is defined as: P ( E ) = Number of Favorable Outcomes n ( E ) Total Number of Equally Likely Outcomes n ( S ) P(E) = \frac{\text{Number of Favorable Outcomes } n(E)}{\text{Total Number of Equally Likely Outcomes } n(S)} P ( E ) = Total Number of Equally Likely Outcomes n ( S ) Number of Favorable Outcomes n ( E ) ​

Axiomatic Properties to Memorize

Strict Bounds: For any event E E E , 0 ≤ P ( E ) ≤ 1 0 \le P(E) \le 1 0 ≤ P ( E ) ≤ 1 .

If P ( E ) = 0 P(E) = 0 P ( E ) = 0 , the event is mathematically impossible .

If P ( E ) = 1 P(E) = 1 P ( E ) = 1 , the event is certain to occur.

The Complement Rule: The complement of event A A A (denoted A ′ A' A ′ or A c A^c A c ) represents the event that A A A does not occur. Since an event must either occur or not occur: P ( A ) + P ( A ′ ) = 1 ⟹ P ( A ′ ) = 1 − P ( A ) P(A) + P(A') = 1 \implies P(A') = 1 - P(A) P ( A ) + P ( A ′ ) = 1 ⟹ P ( A ′ ) = 1 − P ( A )

The Addition Rule: Compound "OR" Events

The probability that event A A A or event B B B occurs (the union, denoted A ∪ B A \cup B A ∪ B ) depends on whether the events can happen at the same time.

General Addition Rule (Overlapping Events)

If events A A A and B B B can occur simultaneously, adding P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) double-counts their joint occurrence. We must subtract the intersection P ( A ∩ B ) P(A \cap B) P ( A ∩ B ) : 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 )

Mutually Exclusive (Disjoint) Events

Two events are mutually exclusive if they cannot occur at the same time ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ). In this case, P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 , and the addition rule simplifies to: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )

Example: When rolling a fair 6-sided die, rolling a 2 and rolling a 5 are mutually exclusive: P ( 2 ∪ 5 ) = P ( 2 ) + P ( 5 ) = 1 6 + 1 6 = 2 6 = 1 3 P(2 \cup 5) = P(2) + P(5) = \frac{1}{6} + \frac{1}{6} = \frac{2}{6} = \frac{1}{3} P ( 2 ∪ 5 ) = P ( 2 ) + P ( 5 ) = 6 1 ​ + 6 1 ​ = 6 2 ​ = 3 1 ​

The Multiplication Rule: Joint "AND" Events

The probability that event A A A and event B B B both occur (the intersection, denoted A ∩ B A \cap B A ∩ B ) depends on whether the occurrence of A A A affects the likelihood of B B B .

General Multiplication Rule (Dependent Events)

If the occurrence of event A A A alters the probability of event B B B , the events are dependent : P ( A ∩ B ) = P ( A ) × P ( B ∣ A ) P(A \cap B) = P(A) \times P(B|A) P ( A ∩ B ) = P ( A ) × P ( B ∣ A )

where P ( B ∣ A ) P(B|A) P ( B ∣ A ) represents the conditional probability of B B B given that A A A has already occurred.

Independent Events

Two events are independent if the occurrence of one does not affect the probability of the other: P ( B ∣ A ) = P ( B ) P(B|A) = P(B) P ( B ∣ A ) = P ( B ) . When independence holds, the multiplication rule simplifies to: P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )

Example: Tossing a coin and rolling a die are independent. The probability of getting Heads and rolling a 4 is: P ( Heads ∩ 4 ) = P ( Heads ) × P ( 4 ) = 1 2 × 1 6 = 1 12 P(\text{Heads} \cap 4) = P(\text{Heads}) \times P(4) = \frac{1}{2} \times \frac{1}{6} = \frac{1}{12} P ( Heads ∩ 4 ) = P ( Heads ) × P ( 4 ) = 2 1 ​ × 6 1 ​ = 12 1 ​

The Independence vs. Mutual Exclusivity Conceptual Trap

Candidates frequently confuse independent events with mutually exclusive events. They are fundamentally different concepts:

Mutually exclusive means events cannot happen together ( P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 ).

Independent means the occurrence of one does not change the probability of the other ( P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) ).

Mathematical Consequence: If two events A A A and B B B both have non-zero probabilities ( P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 ), they cannot be both independent and mutually exclusive . If they were mutually exclusive, P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . But if they were independent, P ( A ∩ B ) = P ( A ) × P ( B ) > 0 P(A \cap B) = P(A) \times P(B) > 0 P ( A ∩ B ) = P ( A ) × P ( B ) > 0 . Zero cannot equal a positive number!

Sampling: Replacement vs. Non-Replacement

A substantial proportion of GMAT probability questions involve drawing items (marbles, cards, chips, or people) from a set.

1. Sampling With Replacement (Independent)

When an item is drawn, recorded, and returned to the pool before the next draw:

The total number of items in the denominator remains constant.

The number of favorable items in the numerator remains constant.

Each draw is completely independent .

2. Sampling Without Replacement (Dependent)

When an item is drawn and set aside:

The total number of available items decreases by 1 on each subsequent draw.

If a favorable item was selected, the number of remaining favorable items decreases by 1.

Each draw is dependent on previous draws.

Comparative Walkthrough

A bag contains 4 red chips and 6 blue chips (10 chips total). Two chips are drawn sequentially.

With Replacement: Probability of drawing two red chips: P ( R 1 ∩ R 2 ) = 4 10 × 4 10 = 2 5 × 2 5 = 4 25 = 0.16 P(R_1 \cap R_2) = \frac{4}{10} \times \frac{4}{10} = \frac{2}{5} \times \frac{2}{5} = \frac{4}{25} = 0.16 P ( R 1 ​ ∩ R 2 ​ ) = 10 4 ​ × 10 4 ​ = 5 2 ​ × 5 2 ​ = 25 4 ​ = 0.16

Without Replacement: Probability of drawing two red chips: P ( R 1 ∩ R 2 ) = 4 10 × 3 9 = 2 5 × 1 3 = 2 15 ≈ 0.133 P(R_1 \cap R_2) = \frac{4}{10} \times \frac{3}{9} = \frac{2}{5} \times \frac{1}{3} = \frac{2}{15} \approx 0.133 P ( R 1 ​ ∩ R 2 ​ ) = 10 4 ​ × 9 3 ​ = 5 2 ​ × 3 1 ​ = 15 2 ​ ≈ 0.133

The "At Least One" Complementary Shortcut

When a GMAT question asks for the probability that an event occurs "at least once" in n n n trials, direct computation is often inefficient. Direct calculation requires computing the probabilities of 1 success, 2 successes, 3 successes, ..., up to n n n successes, and summing them.

Because the complement of "at least one" is "none at all" (zero occurrences) , use the complement shortcut: P ( At least one success ) = 1 − P ( Zero successes ) P(\text{At least one success}) = 1 - P(\text{Zero successes}) P ( At least one success ) = 1 − P ( Zero successes )

Step-by-Step Execution:

Identify the condition for "complete failure" in a single trial.

Calculate the probability that this failure occurs in every trial.

Subtract that joint failure probability from 1.

Classic Coin Example

If a fair coin is flipped 5 times, what is the probability of obtaining at least one Head?

Direct method: Sum probabilities of 1, 2, 3, 4, and 5 Heads.

Complement shortcut: The complement of "at least one Head" is "zero Heads" (all 5 flips are Tails): P ( Zero Heads ) = ( 1 2 ) 5 = 1 32 P(\text{Zero Heads}) = \left(\frac{1}{2}\right)^5 = \frac{1}{32} P ( Zero Heads ) = ( 2 1 ​ ) 5 = 32 1 ​ P ( At least one Head ) = 1 − 1 32 = 31 32 P(\text{At least one Head}) = 1 - \frac{1}{32} = \frac{31}{32} P ( At least one Head ) = 1 − 32 1 ​ = 32 31 ​

Conditional Probability in Problem Solving

Conditional probability evaluates the chance of an event happening given that another event has already occurred. Mathematically: P ( B ∣ A ) = P ( A ∩ B ) P ( A ) P(B|A) = \frac{P(A \cap B)}{P(A)} P ( B ∣ A ) = P ( A ) P ( A ∩ B ) ​

On GMAT Problem Solving questions, conditional probability is best solved by restricting the sample space : identify the specific subset of outcomes where condition A A A is true, and count how many of those outcomes satisfy condition B B B .

Example: Two fair 6-sided dice are rolled, and the sum of the dice is 8. What is the probability that at least one of the dice shows a 3?

Restrict the sample space to Sum = 8: The pairs that sum to 8 are: ( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 ) (2, 6), (3, 5), (4, 4), (5, 3), (6, 2) ( 2 , 6 ) , ( 3 , 5 ) , ( 4 , 4 ) , ( 5 , 3 ) , ( 6 , 2 ) . There are exactly 5 equally likely outcomes .

Count favorable outcomes within this restricted set: Pairs showing at least one 3 are ( 3 , 5 ) (3, 5) ( 3 , 5 ) and ( 5 , 3 ) (5, 3) ( 5 , 3 ) . There are 2 favorable outcomes .

Calculate conditional probability: P ( ≥ 1 three ∣ Sum = 8 ) = 2 5 P(\ge 1 \text{ three} \mid \text{Sum} = 8) = \frac{2}{5} P ( ≥ 1 three ∣ Sum = 8 ) = 5 2 ​

  • Worked Problem Solving Examples
  • Example 1: Multi-Stage Draw Without Replacement

Problem: A jar contains 5 red marbles, 4 green marbles, and 3 blue marbles. If 3 marbles are drawn at random one after another without replacement, what is the probability that at least one of the marbles drawn is red?

Solution:

Total marbles in jar = 5 + 4 + 3 = 12 5 + 4 + 3 = 12 5 + 4 + 3 = 12 .

Non-red marbles = 4 + 3 = 7 4 + 3 = 7 4 + 3 = 7 .

Apply the complement rule: P ( at least one red ) = 1 − P ( no red marbles in 3 draws ) P(\text{at least one red}) = 1 - P(\text{no red marbles in 3 draws}) P ( at least one red ) = 1 − P ( no red marbles in 3 draws ) .

For "no red marbles," all 3 draws must be chosen from the 7 non-red marbles:

  • 1st draw non-red: 7 12 \frac{7}{12} 12 7 ​
  • 2nd draw non-red: 6 11 \frac{6}{11} 11 6 ​
  • 3rd draw non-red: 5 10 = 1 2 \frac{5}{10} = \frac{1}{2} 10 5 ​ = 2 1 ​

Multiply the sequential probabilities: P ( no red ) = 7 12 × 6 11 × 1 2 = 7 × 6 × 1 12 × 11 × 2 = 42 264 = 7 44 P(\text{no red}) = \frac{7}{12} \times \frac{6}{11} \times \frac{1}{2} = \frac{7 \times 6 \times 1}{12 \times 11 \times 2} = \frac{42}{264} = \frac{7}{44} P ( no red ) = 12 7 ​ × 11 6 ​ × 2 1 ​ = 12 × 11 × 2 7 × 6 × 1 ​ = 264 42 ​ = 44 7 ​

Subtract from 1: P ( at least one red ) = 1 − 7 44 = 37 44 P(\text{at least one red}) = 1 - \frac{7}{44} = \frac{37}{44} P ( at least one red ) = 1 − 44 7 ​ = 44 37 ​

Example 2: Overlapping Event Demographics

Problem: In an executive seminar of 60 participants, 35 speak Spanish, 25 speak French, and 12 speak both Spanish and French. If a participant is selected at random, what is the probability that the participant speaks neither Spanish nor French?

Solution:

Let S S S be the event of speaking Spanish, and F F F be the event of speaking French.

Given: n ( Total ) = 60 n(\text{Total}) = 60 n ( Total ) = 60 , n ( S ) = 35 n(S) = 35 n ( S ) = 35 , n ( F ) = 25 n(F) = 25 n ( F ) = 25 , n ( S ∩ F ) = 12 n(S \cap F) = 12 n ( S ∩ F ) = 12 .

Use the Addition Rule to find the number of participants who speak Spanish or French: n ( S ∪ F ) = n ( S ) + n ( F ) − n ( S ∩ F ) = 35 + 25 − 12 = 48 n(S \cup F) = n(S) + n(F) - n(S \cap F) = 35 + 25 - 12 = 48 n ( S ∪ F ) = n ( S ) + n ( F ) − n ( S ∩ F ) = 35 + 25 − 12 = 48

The number of participants speaking neither language is the complement of the union: n ( Neither ) = n ( Total ) − n ( S ∪ F ) = 60 − 48 = 12 n(\text{Neither}) = n(\text{Total}) - n(S \cup F) = 60 - 48 = 12 n ( Neither ) = n ( Total ) − n ( S ∪ F ) = 60 − 48 = 12

Compute the probability: P ( Neither ) = 12 60 = 1 5 = 0.20 P(\text{Neither}) = \frac{12}{60} = \frac{1}{5} = 0.20 P ( Neither ) = 60 12 ​ = 5 1 ​ = 0.20

High-Frequency GMAT Traps

Trap 1: The Order Trap in Compound Selections

If a question asks for the probability of drawing "one red and one blue marble" in two draws, candidates often compute P ( Red 1st ) × P ( Blue 2nd ) P(\text{Red 1st}) \times P(\text{Blue 2nd}) P ( Red 1st ) × P ( Blue 2nd ) . But the order could be Red-then-Blue OR Blue-then-Red! You must either multiply by 2 or use combinations: ( R 1 ) ( B 1 ) ( T o t a l 2 ) \frac{\binom{R}{1}\binom{B}{1}}{\binom{Total}{2}} ( 2 T o t a l ​ ) ( 1 R ​ ) ( 1 B ​ ) ​ .

Trap 2: Forgetting Non-Replacement Denominator Reduction

Failing to reduce the sample size denominator on successive draws without replacement converts a dependent problem into an incorrect independent calculation.

Trap 3: Exhaustive Summation on "At Least One" Items

Attempting to calculate P ( 1 ) + P ( 2 ) + P ( 3 ) + … P(1) + P(2) + P(3) + \dots P ( 1 ) + P ( 2 ) + P ( 3 ) + … on multi-trial problems consumes precious minutes and introduces compounding arithmetic error. When you see "at least one," immediately set up 1 − P ( none ) 1 - P(\text{none}) 1 − P ( none ) .

Loading diagram... Taxonomy of Probability Rules and Event Relationships