Sets, Venn Diagrams
& Overlap
Master the Inclusion-Exclusion Principle, read Venn diagrams with confidence, and solve overlap problems quickly on the GRE.
What Is a Set?
A set is a well-defined collection of distinct objects, called elements or members. On the GRE, sets usually contain people, numbers, or categories.
Key Set Operations
Anatomy of a Venn Diagram
The Inclusion-Exclusion Principle
When you simply add \( |A| + |B| \), every element in the overlap gets counted twice. Subtracting \( |A \cap B| \) corrects for that double-count.
Adding the "Neither" Region
Most GRE problems give you a total number of people in a group. Some belong to neither category. The four regions always add up to the total:
Union vs. Intersection
| Union \( A \cup B \) | Intersection \( A \cap B \) | |
|---|---|---|
| Meaning | In A or B (or both) | In A and B (both) |
| Diagram Region | Entire shaded area | Only the overlap lens |
| Size Relationship | \( \geq \max(|A|, |B|) \) | \( \leq \min(|A|, |B|) \) |
| GRE Keyword | "at least one," "either" | "both," "also" |
| Formula | \( |A|+|B|-|A\cap B| \) | Often the unknown to solve for |
How to Solve Overlap Problems
Example 1: Finding the Overlap
In a class of 60 students, 35 study French and 30 study Spanish. Every student studies at least one language. How many study both?
Example 2: With a "Neither" Group
Of 100 employees, 55 drink coffee, 40 drink tea, and 15 drink neither. How many drink both?
Example 3: Finding "At Least One"
A survey of 200 people finds 120 own a car, 80 own a bike, and 40 own both. How many own at least one? How many own neither?
Three-Set Inclusion-Exclusion
The logic is the same: add each set, subtract each pairwise overlap, then add back the triple overlap (which was subtracted too many times).
Mutually Exclusive vs. Overlapping
Subsets and Special Cases
If \( A \subseteq B \), then every element of \( A \) is also in \( B \). This means \( A \cap B = A \) and \( |A \cup B| = |B| \).
Common Mistakes to Avoid
Formula Reference Sheet
| Quantity | Formula |
|---|---|
| Union (2 sets) | \( |A| + |B| - |A \cap B| \) |
| Only A | \( |A| - |A \cap B| \) |
| Only B | \( |B| - |A \cap B| \) |
| Neither | \( \text{Total} - |A \cup B| \) |
| Union (3 sets) | \( |A|+|B|+|C|-|A\cap B|-|A\cap C|-|B\cap C|+|A\cap B\cap C| \) |
| Four-region check | \( \text{Only A} + \text{Both} + \text{Only B} + \text{Neither} = \text{Total} \) |
Question 1 of 5
In a group of 80 people, 50 like chocolate and 35 like vanilla. If everyone likes at least one flavor, how many like both?
Question 2 of 5
Of 150 students, 90 play soccer, 60 play basketball, and 30 play both. How many play neither sport?
Question 3 of 5
If \( |A| = 40 \), \( |B| = 25 \), and \( |A \cap B| = 10 \), what is the number of elements in Only \( A \) (in \( A \) but not \( B \))?
Question 4 of 5
Sets \( P \) and \( Q \) are mutually exclusive with \( |P| = 22 \) and \( |Q| = 18 \). What is \( |P \cup Q| \)?
Question 5 of 5
In a company of 200 employees, 110 speak English, 85 speak Hindi, 50 speak both, and the rest speak neither. How many speak at least one of the two languages?