Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Universal Set (ξ): The set containing all possible elements under consideration.
Null/Empty Set (∅ or {}): A set containing no elements.
Subsets: A is a subset of B (A ⊆ B) if every element of A is also in B. A is a proper subset (A ⊂ B) if A is in B but A ≠ B.
Union (A ∪ B): The set of elements that are in A, or in B, or in both.
Intersection (A ∩ B): The set of elements that are in both A and B.
Complement (A'): The set of elements in the universal set that are not in A.
Cardinality (n(A)): The number of elements in set A.
Disjoint Sets: Sets that have no elements in common (A ∩ B = ∅).
De Morgan's Laws: Relationship between the complement of unions and intersections.
📐Formulae
💡Examples
Problem 1:
In a group of 100 students, 60 like Math, 45 like Physics, and 20 like both. How many students like neither subject?
Solution:
15 students
Explanation:
Let M be the set of students who like Math and P be the set who like Physics. We are given n(M) = 60, n(P) = 45, and n(M ∩ P) = 20. Using the formula n(M ∪ P) = n(M) + n(P) - n(M ∩ P), we get 60 + 45 - 20 = 85. The number of students who like neither is n(ξ) - n(M ∪ P) = 100 - 85 = 15.
Problem 2:
List the elements of the set A ∩ B' where ξ = {x : x is an integer, 1 ≤ x ≤ 10}, A = {prime numbers}, and B = {even numbers}.
Solution:
{3, 5, 7}
Explanation:
First, define ξ = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. Set A (primes) = {2, 3, 5, 7}. Set B (evens) = {2, 4, 6, 8, 10}. Set B' (complements of B in ξ) = {1, 3, 5, 7, 9}. The intersection A ∩ B' represents elements that are prime AND odd. Looking at both sets, the common elements are {3, 5, 7}.
Problem 3:
Given n(ξ) = 30, n(A) = 15, n(B) = 12, and n(A ∪ B)' = 8. Find n(A ∩ B).
Solution:
5
Explanation:
First, find n(A ∪ B). Since n(A ∪ B)' = 8, then n(A ∪ B) = n(ξ) - 8 = 30 - 8 = 22. Now use the inclusion-exclusion principle: n(A ∪ B) = n(A) + n(B) - n(A ∩ B). Substituting the values: 22 = 15 + 12 - n(A ∩ B). This simplifies to 22 = 27 - n(A ∩ B), so n(A ∩ B) = 5.