Study guide
7.2 Set Theory, Operations, & Venn Diagrams
ACCUPLACER Quantitative Reasoning, Algebra, and Statistics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Rational Numbers & Operations
1.1 Rational Number Arithmetic & Signed Numbers 1.2 Fractions, Decimals, & Mixed Numbers Operations 1.3 Absolute Value, Number Line, & Estimation
2 Chapter 2: Ratios, Proportions & Rates
2.1 Ratios, Unit Rates, & Dimensional Analysis 2.2 Proportions & Direct/Inverse Variation 2.3 Percent Applications, Markup, Discount, & Simple Interest
3 Chapter 3: Exponents & Scientific Notation
3.1 Integer Exponents & Laws of Exponents 3.2 Scientific Notation & Operations
4 Chapter 4: Algebraic Expressions
4.1 Evaluating & Translating Algebraic Expressions 4.2 Simplifying, Combining Like Terms, & Factoring
5 Chapter 5: Linear Equations & Inequalities
5.1 Solving Single-Variable Linear Equations 5.2 Solving & Graphing Linear Inequalities 5.3 Systems of Linear Equations
6 Chapter 6: Linear Applications & Graphing
6.1 Slope & Rate of Change 6.2 Forms of Linear Equations & Graphing 6.3 Linear Modeling & Inequality Graphs
7 Chapter 7: Probability & Set Theory
7.1 Fundamental Probability Concepts 7.2 Set Theory, Operations, & Venn Diagrams
8 Chapter 8: Descriptive Statistics & Data Displays
8.1 Measures of Center: Mean, Median, Mode, & Weighted Average 8.2 Measures of Spread: Range, IQR, Variance, & Standard Deviation 8.3 Data Displays: Histograms, Box Plots, & Scatter Plots
9 Chapter 9: Geometry Concepts & Measurement
9.1 2D Geometry: Perimeter, Area, & Circles 9.2 3D Geometry: Surface Area & Volume of Solids 9.3 Triangles, Angles, & the Pythagorean Theorem
7.2 Set Theory, Operations, & Venn Diagrams
Key Takeaways Explain This Topic AI
A set is a well-defined collection of distinct elements denoted via roster or set-builder notation; fundamental properties include element membership (x ∈ A), subset inclusion (A ⊆ B), the empty set (∅ where |∅| = 0), and cardinality (|A| or n(A)).
The four foundational set operations are Union (A ∪ B: elements in A or B or both), Intersection (A ∩ B: elements common to both A and B), Complement (A': elements in universal set U not in A), and Difference (A \ B: elements in A but not in B).
The Principle of Inclusion-Exclusion (PIE) for two sets establishes that |A ∪ B| = |A| + |B| - |A ∩ B|, reconciling total coverage by subtracting the doubly counted intersection.
Multi-set Venn diagram word problems must be solved using an inside-out strategy: populate the innermost shared intersection first, deduct overlap from outer regions, and evaluate the exterior complement region |(A ∪ B)'| = |U| - |A ∪ B|.
Set theory provides the structural underpinning for probability: sample spaces represent universal sets, events represent subsets, and probabilities mirror relative set cardinalities via P(A ∪ B) = P(A) + P(B) - P(A ∩ B) and P(A|B) = |A ∩ B| / |B|.
Last updated: August 2026
Set Theory Foundations & Notation
Set theory is the mathematical language used to organize, classify, and analyze collections of objects. On the ACCUPLACER Quantitative Reasoning, Algebra, and Statistics (QAS) exam, set theory provides the structural framework for categorical logic, algebraic domains, and probability spaces.
1. What is a Set?
A set is a well-defined collection of distinct objects called elements (or members). "Well-defined" means that given any object, there is an unambiguous rule determining whether that object belongs to the set.
Distinctness : Elements in a set are never duplicated. The collection { 3 , 3 , 5 , 7 } \{3, 3, 5, 7\} { 3 , 3 , 5 , 7 } is written simply as { 3 , 5 , 7 } \{3, 5, 7\} { 3 , 5 , 7 } .
Order Irrelevance : The sequence in which elements are listed does not matter: { a , b , c } = { c , a , b } \{a, b, c\} = \{c, a, b\} { a , b , c } = { c , a , b } .
2. Set Specification Notations
Roster (Listing) Notation : Elements are explicitly enumerated within curly braces separated by commas. A = { 2 , 4 , 6 , 8 , 10 } A = \{2, 4, 6, 8, 10\} A = { 2 , 4 , 6 , 8 , 10 }
Set-Builder Notation : Specifies a variable, a vertical bar ∣ | ∣ (meaning "such that"), and a governing algebraic condition. B = { x ∈ Z ∣ 1 ≤ x ≤ 10 and x is even } B = \{x \in \mathbb{Z} \mid 1 \le x \le 10 \text{ and } x \text{ is even}\} B = { x ∈ Z ∣ 1 ≤ x ≤ 10 and x is even }
3. Fundamental Set Symbols & Terminology
Symbol Mathematical Name Meaning & Formal Definition Example
∈ \in ∈ Element of x ∈ A x \in A x ∈ A means x x x is a member of set A A A 3 ∈ { 1 , 3 , 5 } 3 \in \{1, 3, 5\} 3 ∈ { 1 , 3 , 5 }
∉ \notin ∈ / Not an element of x ∉ A x \notin A x ∈ / A means x x x is not a member of set A A A 4 ∉ { 1 , 3 , 5 } 4 \notin \{1, 3, 5\} 4 ∈ / { 1 , 3 , 5 }
U U U Universal Set The overarching set containing all objects under current consideration U = { 1 , 2 , 3 , … , 20 } U = \{1, 2, 3, \dots, 20\} U = { 1 , 2 , 3 , … , 20 }
∅ \emptyset ∅ or { } \{\} { } Empty (Null) Set The unique set containing exactly zero elements ( ∣ ∅ ∣ = 0 \vert\emptyset\vert = 0 ∣∅∣ = 0 ) { x ∈ R ∣ x 2 = − 4 } = ∅ \{x \in \mathbb{R} \mid x^2 = -4\} = \emptyset { x ∈ R ∣ x 2 = − 4 } = ∅
∣ A ∣ \vert A\vert ∣ A ∣ or n ( A ) n(A) n ( A ) Cardinality The total count of distinct elements contained in set A A A ∣ { 2 , 5 , 8 , 11 } ∣ = 4 \vert\{2, 5, 8, 11\}\vert = 4 ∣ { 2 , 5 , 8 , 11 } ∣ = 4
⊆ \subseteq ⊆ Subset A ⊆ B A \subseteq B A ⊆ B means every element of A A A is also in B B B { 2 , 4 } ⊆ { 1 , 2 , 3 , 4 } \{2, 4\} \subseteq \{1, 2, 3, 4\} { 2 , 4 } ⊆ { 1 , 2 , 3 , 4 }
⊂ \subset ⊂ Proper Subset A ⊂ B A \subset B A ⊂ B means A ⊆ B A \subseteq B A ⊆ B and A ≠ B A \neq B A = B ( B B B contains extra elements) { 1 , 2 } ⊂ { 1 , 2 , 3 } \{1, 2\} \subset \{1, 2, 3\} { 1 , 2 } ⊂ { 1 , 2 , 3 }
Cardinality & Subset Theorems
The Empty Set Theorem : The empty set is a subset of every set: ∅ ⊆ A \emptyset \subseteq A ∅ ⊆ A for any set A A A .
Total Subsets Formula : A finite set with cardinality n n n ( ∣ A ∣ = n |A| = n ∣ A ∣ = n ) possesses exactly 2 n 2^n 2 n distinct subsets and 2 n − 1 2^n - 1 2 n − 1 proper subsets.
Example : For set S = { x , y , z } S = \{x, y, z\} S = { x , y , z } ( n = 3 n = 3 n = 3 ), there are 2 3 = 8 2^3 = 8 2 3 = 8 subsets: ∅ , { x } , { y } , { z } , { x , y } , { x , z } , { y , z } , { x , y , z } \emptyset, \; \{x\}, \; \{y\}, \; \{z\}, \; \{x, y\}, \; \{x, z\}, \; \{y, z\}, \; \{x, y, z\} ∅ , { x } , { y } , { z } , { x , y } , { x , z } , { y , z } , { x , y , z }
The Four Core Set Operations
Set operations allow you to combine, intersect, and isolate subsets within a universal set U U U . Union: A ∪ B Intersection: A ∩ B Complement: A' (or A^c)
- ┌─────────────────────┐ ┌─────────────────────┐ ┌─────────────────────┐
- │ /█████\ /█████\ │ │ / \ /█████\ / │ │ ███████████████████ │
- │ │███████╳████████│ │ │ │ │█████│ │ │ │ ████/ \████████ │
- │ \█████/ \█████/ │ │ \ / \███/ \ │ │ │ ███│ A │███████ │
- │ A B │ │ A B │ │ │ ████\ /████████ │
- │ All shaded │ │ Only overlap │ │ ███████████████████ │
- └─────────────────────┘ └─────────────────────┘ └─────────────────────┘
- 1. Union ( A ∪ B A \cup B A ∪ B )
The union of sets A A A and B B B is the set of all elements that belong to set A A A , OR set B B B , OR both . A ∪ B = { x ∈ U ∣ x ∈ A or x ∈ B } A \cup B = \{x \in U \mid x \in A \text{ or } x \in B\} A ∪ B = { x ∈ U ∣ x ∈ A or x ∈ B }
Key Word : "OR" .
2. Intersection ( A ∩ B A \cap B A ∩ B )
The intersection of sets A A A and B B B is the set of all elements that belong to BOTH set A A A AND set B B B simultaneously. A ∩ B = { x ∈ U ∣ x ∈ A and x ∈ B } A \cap B = \{x \in U \mid x \in A \text{ and } x \in B\} A ∩ B = { x ∈ U ∣ x ∈ A and x ∈ B }
Key Word : "AND" .
Disjoint Sets : If A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , the sets are disjoint (mutually exclusive) and share no elements.
3. Complement ( A ′ A' A ′ or A c A^c A c or A ˉ \bar{A} A ˉ )
The complement of set A A A is the set of all elements in the universal set U U U that do NOT belong to A A A . A ′ = { x ∈ U ∣ x ∉ A } = U ∖ A A' = \{x \in U \mid x \notin A\} = U \setminus A A ′ = { x ∈ U ∣ x ∈ / A } = U ∖ A
Key Word : "NOT" .
Fundamental Identity : ∣ A ∣ + ∣ A ′ ∣ = ∣ U ∣ |A| + |A'| = |U| ∣ A ∣ + ∣ A ′ ∣ = ∣ U ∣ and A ∪ A ′ = U A \cup A' = U A ∪ A ′ = U .
4. Set Difference / Relative Complement ( A ∖ B A \setminus B A ∖ B or A − B A - B A − B )
The difference of sets A A A and B B B (also called the relative complement of B B B in A A A ) is the set of all elements that belong to A A A but do NOT belong to B B B . A ∖ B = { x ∈ U ∣ x ∈ A and x ∉ B } = A ∩ B ′ A \setminus B = \{x \in U \mid x \in A \text{ and } x \notin B\} = A \cap B' A ∖ B = { x ∈ U ∣ x ∈ A and x ∈ / B } = A ∩ B ′
Interpretation : "Only A A A " (stripping all shared elements of B B B out of set A A A ).
The Principle of Inclusion-Exclusion (PIE)
When combining sets, simply adding ∣ A ∣ + ∣ B ∣ |A| + |B| ∣ A ∣ + ∣ B ∣ counts elements in the overlapping intersection twice. The Principle of Inclusion-Exclusion (PIE) corrects for this overlap.
PIE for Two Sets ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ |A \cup B| = |A| + |B| - |A \cap B| ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B ) n(A \cup B) = n(A) + n(B) - n(A \cap B) n ( A ∪ B ) = n ( A ) + n ( B ) − n ( A ∩ B )
Algebraic Rearrangements of PIE
By isolating different terms, PIE can solve for any unknown component:
Solving for the Intersection : ∣ A ∩ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∪ B ∣ |A \cap B| = |A| + |B| - |A \cup B| ∣ A ∩ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∪ B ∣
Solving for "Only Set A" : ∣ A ∖ B ∣ = ∣ A ∣ − ∣ A ∩ B ∣ |A \setminus B| = |A| - |A \cap B| ∣ A ∖ B ∣ = ∣ A ∣ − ∣ A ∩ B ∣
Accounting for the Exterior ("Neither Set") : ∣ ( A ∪ B ) ′ ∣ = ∣ U ∣ − ∣ A ∪ B ∣ = ∣ U ∣ − ( ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ ) |(A \cup B)'| = |U| - |A \cup B| = |U| - (|A| + |B| - |A \cap B|) ∣ ( A ∪ B ) ′ ∣ = ∣ U ∣ − ∣ A ∪ B ∣ = ∣ U ∣ − ( ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ )
Venn Diagram Anatomy & The Inside-Out Solution Algorithm
A Venn diagram visually maps the logical relations among sets enclosed within a rectangular bounding box representing the universal set U U U .
2-Set Venn Diagram Region Anatomy
A two-set Venn diagram partitions the universal set U U U into four mutually disjoint regions: ┌────────────────────────────────────────────────────────┐
- │ Universal Set U │
- │ ┌───────────────┐ ┌───────────────┐ │
- │ │ Region I │ │ Region III │ │
- │ │ (Only A) │ Reg │ (Only B) │ │
- │ │ A \ B │ II │ B \ A │ │
- │ │ │A ∩ B│ │ │
- │ └───────────────┘ └───────────────┘ │
- │ Set A Set B │
- │ │
- │ Region IV: Neither A nor B │
- │ (A ∪ B)' = U \ (A ∪ B) │
- └────────────────────────────────────────────────────────┘
Region I (Only A A A ) : ∣ A ∖ B ∣ = ∣ A ∣ − ∣ A ∩ B ∣ |A \setminus B| = |A| - |A \cap B| ∣ A ∖ B ∣ = ∣ A ∣ − ∣ A ∩ B ∣
Region II (Both A A A and B B B ) : ∣ A ∩ B ∣ |A \cap B| ∣ A ∩ B ∣
Region III (Only B B B ) : ∣ B ∖ A ∣ = ∣ B ∣ − ∣ A ∩ B ∣ |B \setminus A| = |B| - |A \cap B| ∣ B ∖ A ∣ = ∣ B ∣ − ∣ A ∩ B ∣
Region IV (Neither A A A nor B B B ) : ∣ ( A ∪ B ) ′ ∣ = ∣ U ∣ − ( ∣ Region I ∣ + ∣ Region II ∣ + ∣ Region III ∣ ) |(A \cup B)'| = |U| - (|\text{Region I}| + |\text{Region II}| + |\text{Region III}|) ∣ ( A ∪ B ) ′ ∣ = ∣ U ∣ − ( ∣ Region I ∣ + ∣ Region II ∣ + ∣ Region III ∣ )
The Strict "Inside-Out" Solution Algorithm for Word Problems
When solving complex multi-set survey word problems on the ACCUPLACER exam, follow this systematic inside-out sequence:
Identify the Universal Set Total : Note ∣ U ∣ |U| ∣ U ∣ (the total population surveyed).
Populate the Innermost Core First : Enter the value for the full intersection ( A ∩ B A \cap B A ∩ B for two sets, or A ∩ B ∩ C A \cap B \cap C A ∩ B ∩ C for three sets).
Calculate Double-Overlap Regions (for 3 sets) : Subtract the 3-way center from each 2-way intersection.
Calculate Single-Set-Only Regions : Subtract all inner overlapping numbers from the total given for that individual set.
Sum All Interior Disjoint Regions : Compute the total union count ∣ A ∪ B ∣ |A \cup B| ∣ A ∪ B ∣ (or ∣ A ∪ B ∪ C ∣ |A \cup B \cup C| ∣ A ∪ B ∪ C ∣ ).
Determine the Exterior Region : Subtract the total union from ∣ U ∣ |U| ∣ U ∣ to find the count of individuals satisfying "none of the categories."
Connecting Set Theory Directly to Probability
Set theory and probability theory share an isomorphic (one-to-one) relationship. Every probability formula is a normalized set cardinality expression scaled by the size of the sample space ∣ S ∣ |S| ∣ S ∣ :
- Set Theory Concept Notation Probability Equivalent Probability Formula
- Universal Set U U U Sample Space S S S with P ( S ) = 1 P(S) = 1 P ( S ) = 1
Subset A ⊆ U A \subseteq U A ⊆ U Event E ⊆ S E \subseteq S E ⊆ S with P ( E ) = ∣ E ∣ ∣ S ∣ P(E) = \frac{\vert E\vert}{\vert S\vert} P ( E ) = ∣ S ∣ ∣ E ∣
Empty Set ∅ \emptyset ∅ Impossible Event P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0
Set Union A ∪ B A \cup B A ∪ B Compound Event " A A A OR B B 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 )
Set Intersection A ∩ B A \cap B A ∩ B Joint Event " A A A AND B B B " P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A ) P(A \cap B) = P(A) \cdot P(B \mid A) P ( A ∩ B ) = P ( A ) ⋅ P ( B ∣ A )
Set Complement A ′ A' A ′ Complement Event "NOT A A A " P ( A ′ ) = 1 − P ( A ) P(A') = 1 - P(A) P ( A ′ ) = 1 − P ( A )
Set Difference A ∖ B A \setminus B A ∖ B Event A A A occurs without B B B P ( A ∩ B ′ ) = P ( A ) − P ( A ∩ B ) P(A \cap B') = P(A) - P(A \cap B) P ( A ∩ B ′ ) = P ( A ) − P ( A ∩ B )
Relative Cardinality ∣ A ∩ B ∣ ∣ B ∣ \frac{\vert A \cap B\vert}{\vert B\vert} ∣ B ∣ ∣ A ∩ B ∣ Conditional Probability P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B )
- Step-by-Step Worked Examples
- Worked Example 1: Set Operations on Discrete Number Sets
Let the universal set be the first 12 12 12 positive integers: U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 } U = \{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12\} U = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 , 11 , 12 }
Define two subsets:
Set A A A (Even integers): A = { 2 , 4 , 6 , 8 , 10 , 12 } A = \{2, 4, 6, 8, 10, 12\} A = { 2 , 4 , 6 , 8 , 10 , 12 }
Set B B B (Multiples of 3 3 3 ): B = { 3 , 6 , 9 , 12 } B = \{3, 6, 9, 12\} B = { 3 , 6 , 9 , 12 }
Determine the elements and cardinality for each of the following:
Intersection ( A ∩ B A \cap B A ∩ B ) :
Elements common to both sets: A ∩ B = { 6 , 12 } ⟹ ∣ A ∩ B ∣ = 2 A \cap B = \{6, 12\} \implies |A \cap B| = 2 A ∩ B = { 6 , 12 } ⟹ ∣ A ∩ B ∣ = 2 .
Union ( A ∪ B A \cup B A ∪ B ) :
Combine all elements without duplication: A ∪ B = { 2 , 3 , 4 , 6 , 8 , 9 , 10 , 12 } ⟹ ∣ A ∪ B ∣ = 8 A \cup B = \{2, 3, 4, 6, 8, 9, 10, 12\} \implies |A \cup B| = 8 A ∪ B = { 2 , 3 , 4 , 6 , 8 , 9 , 10 , 12 } ⟹ ∣ A ∪ B ∣ = 8
Verification via PIE : ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ = 6 + 4 − 2 = 8 |A \cup B| = |A| + |B| - |A \cap B| = 6 + 4 - 2 = 8 ∣ A ∪ B ∣ = ∣ A ∣ + ∣ B ∣ − ∣ A ∩ B ∣ = 6 + 4 − 2 = 8 .
Difference ( A ∖ B A \setminus B A ∖ B ) :
Elements in A A A that are not multiples of 3 3 3 : A ∖ B = { 2 , 4 , 8 , 10 } ⟹ ∣ A ∖ B ∣ = 4 A \setminus B = \{2, 4, 8, 10\} \implies |A \setminus B| = 4 A ∖ B = { 2 , 4 , 8 , 10 } ⟹ ∣ A ∖ B ∣ = 4
Complement of Union ( ( A ∪ B ) ′ (A \cup B)' ( A ∪ B ) ′ ) :
Elements in U U U not in A ∪ B A \cup B A ∪ B : ( A ∪ B ) ′ = { 1 , 5 , 7 , 11 } ⟹ ∣ ( A ∪ B ) ′ ∣ = 12 − 8 = 4 (A \cup B)' = \{1, 5, 7, 11\} \implies |(A \cup B)'| = 12 - 8 = 4 ( A ∪ B ) ′ = { 1 , 5 , 7 , 11 } ⟹ ∣ ( A ∪ B ) ′ ∣ = 12 − 8 = 4
Worked Example 2: Two-Set College Survey Problem
A college surveyed 180 180 180 incoming freshmen regarding course registrations:
110 110 110 students registered for an English course ( E E E ).
85 85 85 students registered for a Mathematics course ( M M M ).
45 45 45 students registered for both English and Mathematics.
How many students registered for ONLY English ( E ∖ M E \setminus M E ∖ M )? ∣ E ∖ M ∣ = ∣ E ∣ − ∣ E ∩ M ∣ = 110 − 45 = 65 |E \setminus M| = |E| - |E \cap M| = 110 - 45 = 65 ∣ E ∖ M ∣ = ∣ E ∣ − ∣ E ∩ M ∣ = 110 − 45 = 65
How many students registered for ONLY Mathematics ( M ∖ E M \setminus E M ∖ E )? ∣ M ∖ E ∣ = ∣ M ∣ − ∣ E ∩ M ∣ = 85 − 45 = 40 |M \setminus E| = |M| - |E \cap M| = 85 - 45 = 40 ∣ M ∖ E ∣ = ∣ M ∣ − ∣ E ∩ M ∣ = 85 − 45 = 40
How many students registered for at least one of these courses ( E ∪ M E \cup M E ∪ M )? ∣ E ∪ M ∣ = ∣ E ∣ + ∣ M ∣ − ∣ E ∩ M ∣ = 110 + 85 − 45 = 150 |E \cup M| = |E| + |M| - |E \cap M| = 110 + 85 - 45 = 150 ∣ E ∪ M ∣ = ∣ E ∣ + ∣ M ∣ − ∣ E ∩ M ∣ = 110 + 85 − 45 = 150
(Alternative check: 65 [only E ] + 45 [both] + 40 [only M ] = 150 65 \text{ [only } E] + 45 \text{ [both]} + 40 \text{ [only } M] = 150 65 [only E ] + 45 [both] + 40 [only M ] = 150 ) .
How many students registered for NEITHER course ( ( E ∪ M ) ′ (E \cup M)' ( E ∪ M ) ′ )? ∣ ( E ∪ M ) ′ ∣ = ∣ U ∣ − ∣ E ∪ M ∣ = 180 − 150 = 30 |(E \cup M)'| = |U| - |E \cup M| = 180 - 150 = 30 ∣ ( E ∪ M ) ′ ∣ = ∣ U ∣ − ∣ E ∪ M ∣ = 180 − 150 = 30
If a student who registered for Mathematics is chosen at random, what is the probability that they also registered for English? P ( E ∣ M ) = ∣ E ∩ M ∣ ∣ M ∣ = 45 85 = 9 17 ≈ 0.5294 P(E \mid M) = \frac{|E \cap M|}{|M|} = \frac{45}{85} = \frac{9}{17} \approx 0.5294 P ( E ∣ M ) = ∣ M ∣ ∣ E ∩ M ∣ = 85 45 = 17 9 ≈ 0.5294
Worked Example 3: Three-Set Survey Problem
A technology firm surveyed 120 120 120 software engineers regarding their programming language proficiencies in Python ( P P P ), Java ( J J J ), and C++ ( C C C ):
- 65 65 65 know Python ( ∣ P ∣ = 65 |P| = 65 ∣ P ∣ = 65 )
- 55 55 55 know Java ( ∣ J ∣ = 55 |J| = 55 ∣ J ∣ = 55 )
- 50 50 50 know C++ ( ∣ C ∣ = 50 |C| = 50 ∣ C ∣ = 50 )
- 30 30 30 know both Python and Java ( ∣ P ∩ J ∣ = 30 |P \cap J| = 30 ∣ P ∩ J ∣ = 30 )
- 25 25 25 know both Python and C++ ( ∣ P ∩ C ∣ = 25 |P \cap C| = 25 ∣ P ∩ C ∣ = 25 )
- 20 20 20 know both Java and C++ ( ∣ J ∩ C ∣ = 20 |J \cap C| = 20 ∣ J ∩ C ∣ = 20 )
- 12 12 12 know all three languages ( ∣ P ∩ J ∩ C ∣ = 12 |P \cap J \cap C| = 12 ∣ P ∩ J ∩ C ∣ = 12 )
- Step 1: Calculate the two-language-only regions
Only Python & Java: ∣ ( P ∩ J ) ∖ C ∣ = 30 − 12 = 18 |(P \cap J) \setminus C| = 30 - 12 = 18 ∣ ( P ∩ J ) ∖ C ∣ = 30 − 12 = 18
Only Python & C++: ∣ ( P ∩ C ) ∖ J ∣ = 25 − 12 = 13 |(P \cap C) \setminus J| = 25 - 12 = 13 ∣ ( P ∩ C ) ∖ J ∣ = 25 − 12 = 13
Only Java & C++: ∣ ( J ∩ C ) ∖ P ∣ = 20 − 12 = 8 |(J \cap C) \setminus P| = 20 - 12 = 8 ∣ ( J ∩ C ) ∖ P ∣ = 20 − 12 = 8
Step 2: Calculate the single-language-only regions
Only Python: 65 − ( 18 + 13 + 12 ) = 65 − 43 = 22 65 - (18 + 13 + 12) = 65 - 43 = 22 65 − ( 18 + 13 + 12 ) = 65 − 43 = 22
Only Java: 55 − ( 18 + 8 + 12 ) = 55 − 38 = 17 55 - (18 + 8 + 12) = 55 - 38 = 17 55 − ( 18 + 8 + 12 ) = 55 − 38 = 17
Only C++: 50 − ( 13 + 8 + 12 ) = 50 − 33 = 17 50 - (13 + 8 + 12) = 50 - 33 = 17 50 − ( 13 + 8 + 12 ) = 50 − 33 = 17
Step 3: Calculate the total union ( ∣ P ∪ J ∪ C ∣ |P \cup J \cup C| ∣ P ∪ J ∪ C ∣ ) Sum all 7 7 7 disjoint internal regions: ∣ P ∪ J ∪ C ∣ = 22 + 17 + 17 ⏟ Exactly 1 + 18 + 13 + 8 ⏟ Exactly 2 + 12 ⏟ All 3 = 56 + 39 + 12 = 107 |P \cup J \cup C| = \underbrace{22 + 17 + 17}_{\text{Exactly 1}} + \underbrace{18 + 13 + 8}_{\text{Exactly 2}} + \underbrace{12}_{\text{All 3}} = 56 + 39 + 12 = 107 ∣ P ∪ J ∪ C ∣ = Exactly 1 22 + 17 + 17 + Exactly 2 18 + 13 + 8 + All 3 12 = 56 + 39 + 12 = 107
Step 4: Answer key analytical questions
How many engineers know NONE of these three languages? ∣ ( P ∪ J ∪ C ) ′ ∣ = ∣ U ∣ − ∣ P ∪ J ∪ C ∣ = 120 − 107 = 13 |(P \cup J \cup C)'| = |U| - |P \cup J \cup C| = 120 - 107 = 13 ∣ ( P ∪ J ∪ C ) ′ ∣ = ∣ U ∣ − ∣ P ∪ J ∪ C ∣ = 120 − 107 = 13
How many engineers know EXACTLY ONE language? Only P + Only J + Only C = 22 + 17 + 17 = 56 \text{Only } P + \text{Only } J + \text{Only } C = 22 + 17 + 17 = 56 Only P + Only J + Only C = 22 + 17 + 17 = 56
- How many engineers know EXACTLY TWO languages? 18 + 13 + 8 = 39 18 + 13 + 8 = 39 18 + 13 + 8 = 39
- Common Pitfalls & ACCUPLACER Exam Traps
Confusing "Set A A A " with "ONLY Set A A A " : In a survey, stating that " 50 50 50 people drink coffee" does not mean 50 50 50 people drink only coffee; some of those 50 50 50 also drink tea. You must subtract the intersection to find the "coffee only" group.
Adding Direct Counts in Survey Totals : Summing ∣ A ∣ + ∣ B ∣ + ∣ C ∣ |A| + |B| + |C| ∣ A ∣ + ∣ B ∣ + ∣ C ∣ directly often yields a sum exceeding the total population ∣ U ∣ |U| ∣ U ∣ . This is expected because overlapping individuals are counted multiple times. Always use the Principle of Inclusion-Exclusion.
Misinterpreting the Empty Set vs. Zero : The number 0 0 0 is an integer element, whereas ∅ = { } \emptyset = \{\} ∅ = { } is a set with cardinality 0 0 0 . Note that { 0 } ≠ ∅ \{0\} \neq \emptyset { 0 } = ∅ because { 0 } \{0\} { 0 } contains one element (the number 0 0 0 ), meaning ∣ { 0 } ∣ = 1 |\{0\}| = 1 ∣ { 0 } ∣ = 1 .
Neglecting the Exterior Region : When finding the union from survey data, students often forget that ∣ U ∣ − ∣ A ∪ B ∣ |U| - |A \cup B| ∣ U ∣ − ∣ A ∪ B ∣ represents the exterior population who participate in neither activity.