Grade 10 · Pure Mathematics · Cambridge IGCSE 0580 · Age 14–16
Sets are one of the most fundamental ideas in all of mathematics. A set is simply a well-defined collection of objects. Set notation gives us a precise language to describe collections, relationships, and operations — from listing the prime numbers below 20 to describing all rational numbers. On the Cambridge IGCSE 0580 Extended paper, set questions appear every year, often combining Venn diagrams with algebra to find unknown values.
∈, ∉, ∅, ξ, n(A), listing & set-builder
Union ∪, intersection ∩, complement '
A⊂B proper, A⊆B improper
2-set & 3-set, shading regions
n formula, unknowns, algebra
ℕ, ℤ, ℚ, ℝ and relationships
A set is a well-defined collection of distinct objects called elements or members. Sets are written using curly braces { }. The order of elements does not matter and each element appears only once.
| Symbol | Meaning | Example |
|---|---|---|
| ∈ | is an element of / belongs to | 3 ∈ {1, 2, 3, 4} is TRUE |
| ∉ | is NOT an element of | 5 ∉ {1, 2, 3, 4} is TRUE |
| { } | set brackets — list elements inside | {2, 4, 6, 8} |
| ∅ | empty set — contains no elements | ∅ = {} — do NOT write {∅} |
| ξ | universal set — all elements under consideration | ξ = {1,2,3,...,10} |
| n(A) | number of elements in set A | n({3,6,9}) = 3 |
| n(∅) | number of elements in the empty set | n(∅) = 0 |
To list a set, write all elements between curly braces, separated by commas. There are two common ways to define a set:
The universal set ξ (xi) contains every element being considered in a particular problem. All other sets in the problem are subsets of ξ. It is drawn as a rectangle in a Venn diagram.
The empty set ∅ has no elements at all. It is a subset of every set. Write ∅ or {} — never {∅} (that would be a set containing the empty set, which has one element).
Set-builder notation {x : condition} is especially useful for infinite sets or sets defined by inequalities.
The union A ∪ B contains every element that is in A, or in B, or in both. Think of it as combining the two sets together (but each element is only listed once).
The intersection A ∩ B contains only the elements that are in both A AND B simultaneously.
The complement A' (read "A prime" or "A complement") contains all elements in the universal set ξ that are NOT in A.
A is a subset of B (written A ⊆ B) if every element of A is also in B. A is a proper subset of B (written A ⊂ B) if A ⊆ B and A ≠ B (B has at least one element not in A).
A Venn diagram uses circles inside a rectangle (ξ) to show relationships between sets. The overlapping region represents the intersection.
With three sets A, B, C there are 8 regions: the 7 regions inside the circles (including triple overlap) plus the "outside all" region.
The key formula for counting elements in unions is:
We subtract n(A ∩ B) because elements in both A and B are counted twice when we add n(A) + n(B).
Exam questions often place an unknown x in a Venn diagram region, then give you n(ξ) or some other total. Set up an equation and solve.
The standard number sets are nested inside each other, from smallest to largest:
De Morgan's Laws connect complements with unions and intersections:
These are the errors that cost students marks most often on IGCSE set notation questions.
∈ connects an element (single object) to a set. ⊂ connects a set to another set. The number 3 is an element; {3} is a set containing the number 3. These are different objects.
Elements in A∩B are counted once in n(A) AND once in n(B). Adding them gives a count of 2 for those elements, so you must subtract n(A∩B) once to correct it.
The complement A' includes everything in ξ that is not in A. In a 2-set Venn diagram, this means the B-only crescent AND the outside-both area. Students often forget the "neither" region.
{∅} is a set that contains the empty set as its one element, so n({∅}) = 1. This is different from the empty set ∅ which has n(∅) = 0. This is a subtle but frequently penalised error.
The number n(A) counts ALL elements in A, including those also in B. The value you write in the "A only" part of the diagram must exclude the intersection. Always subtract the intersection first.
| Formula / Fact | Notes |
|---|---|
| n(A∪B) = n(A) + n(B) − n(A∩B) | Inclusion-exclusion — the most tested formula |
| n(A) + n(A') = n(ξ) | A and its complement together make the whole universal set |
| (A∪B)' = A' ∩ B' | De Morgan's First Law |
| (A∩B)' = A' ∪ B' | De Morgan's Second Law |
| A ⊆ B ⟺ A∩B = A | A is a subset of B iff their intersection is just A |
| A ⊆ B ⟺ A∪B = B | Equivalent condition for subset |
| n(∅) = 0 | Empty set has no elements |
| ∅ ⊆ A for all sets A | Empty set is a subset of every set |
| ℕ ⊂ ℤ ⊂ ℚ ⊂ ℝ | The nesting of standard number sets |
| A ∩ A' = ∅ | A set and its complement are disjoint |
| A ∪ A' = ξ | A set and its complement together form the universal set |
Click a region to shade or unshade it. Use the buttons to shade standard set expressions. The expression box shows what the current shading represents.
Enter the universal set and two sets A and B (comma-separated integers), then explore all set operations.
1. A = {2, 4, 6, 8, 10, 12}. Find n(A).
2. ξ = {1,2,3,...,15}, A = {multiples of 3 up to 15}. Find n(A).
3. B = {x : x is a prime number, x < 20}. Find n(B).
4. ξ = {1,...,20}, A = {odd numbers}. Find n(A').
5. A = {factors of 36}. Find n(A).
6. ξ has 25 elements. n(A) = 11. Find n(A').
7. A = {x : x² = 49, x ∈ ℤ}. Find n(A).
8. B = {x : 3 < x < 10, x ∈ ℕ}. Find n(B).
ξ = {1,2,3,...,12}, A = {2,4,6,8,10,12}, B = {3,6,9,12} for all questions.
1. Find n(A∪B).
2. Find n(A∩B).
3. Find n(A').
4. Find n(B').
5. Find n(A∩B') — elements in A but not B.
6. Find n(A'∩B') — elements in neither A nor B.
7. Find n((A∪B)').
8. Find n(A'∪B).
1. n(A)=10, n(B)=8, n(A∩B)=3. Find n(A∪B).
2. n(A)=15, n(B)=12, n(A∩B)=5. Find n(A∪B).
3. n(A∪B)=20, n(A)=13, n(B)=11. Find n(A∩B).
4. n(A∪B)=25, n(A∩B)=4, n(A)=16. Find n(B).
5. n(ξ)=30, n(A∪B)=22. Find n((A∪B)').
6. n(A)=18, n(B)=14, n(A∩B)=6, n(ξ)=35. Find the number in neither A nor B.
7. n(A)=20, n(B)=20, A and B are disjoint. n(ξ)=50. Find n(A'∩B').
8. n(A∪B)=40, n(A)=n(B)=25. Find n(A∩B).
1. A only = x, A∩B = 3, B only = x+2, Neither = 4, n(ξ) = 25. Find x.
2. A only = 2x, A∩B = x, B only = 3x, Neither = 5, n(ξ) = 35. Find x.
3. Using Q4.1 values: once x is found, find n(A).
4. A only = 5, A∩B = x+1, B only = 2x, Neither = 4, n(ξ) = 30. Find x.
5. n(A) = 3x, n(B) = 2x, n(A∩B) = x, n(ξ) = 40, neither = 10. Find x.
6. Using Q4.5 values: find n(A∪B).
7. A only = x+4, A∩B = 2x, B only = x+1, Neither = 3, n(ξ) = 44. Find x.
8. Using Q4.7 values: find n(B).
Answer 1 for TRUE and 0 for FALSE.
1. Is −5 ∈ ℤ? (1=yes, 0=no)
2. Is √2 ∈ ℚ? (1=yes, 0=no)
3. Is 0.75 ∈ ℚ? (1=yes, 0=no)
4. Is π ∈ ℝ? (1=yes, 0=no)
5. Is ℕ ⊂ ℤ? (1=yes, 0=no)
6. How many subsets does {a, b, c} have?
7. A = {2, 4}, B = {1, 2, 3, 4, 5}. Is A ⊂ B? (1=yes, 0=no)
8. How many subsets does {1, 2, 3, 4} have?
🔵 = Non-calculator 🟢 = Calculator allowed
🔵 1. A = {letters in "MATHEMATICS"}. Find n(A). (Count distinct letters)
🔵 2. n(A)=12, n(B)=9, n(A∩B)=4. Find n(A∪B).
🔵 3. n(ξ)=50, n(A∪B)=38. Find n((A∪B)').
🔵 4. ξ={1,...,10}, A={2,4,6,8,10}. Find n(A').
🔵 5. A only=7, A∩B=5, B only=8, neither=3. Find n(ξ).
🔵 6. n(A∪B)=30, n(A)=18, n(A∩B)=6. Find n(B).
🔵 7. A = {x : x is a factor of 20}. Find n(A).
🔵 8. Is 0.333... ∈ ℚ? (1=yes, 0=no)
🔵 9. A only=x, A∩B=4, B only=2x, neither=2, n(ξ)=30. Find x.
🔵 10. n(A)=16, n(B)=16, n(A∩B)=6. Find n(A∪B).
🔵 11. ξ={1,...,20}, A={multiples of 4}. Find n(A').
🔵 12. How many subsets does {p, q} have?
🔵 13. A={3,6,9,12}, B={2,4,6,8,10,12}. Find n(A∩B).
🔵 14. From Q13, find n(A∪B).
🔵 15. n(A)=25, n(A')=15. Find n(ξ).
🔵 16. Is √9 ∈ ℕ? (1=yes, 0=no)
🔵 17. A only=9, A∩B=6, B only=5, n(ξ)=28. Find number in neither.
🔵 18. n(A∪B)=45, n(A)=28, n(B)=23. Find n(A∩B).
🔵 19. A={multiples of 2 up to 20}, B={multiples of 5 up to 20}. Find n(A∩B).
🔵 20. From Q19, find n(A∪B).
🔵 21. B = {x : 1 ≤ x ≤ 6, x ∈ ℕ}. Find n(B).
🔵 22. A only=2x+1, A∩B=x, B only=3x, neither=4, n(ξ)=40. Find x.
🔵 23. From Q22, find n(A).
🔵 24. A={2,4,6,8}, B={1,2,3,4}. Find n(A∩B').
🔵 25. n(ξ)=60, n(A)=35, n(B)=30, n(A∩B)=15. Find n(A'∩B').
1. n(A∪B∪C)=55, n(A)=25, n(B)=20, n(C)=22, n(A∩B)=8, n(A∩C)=6, n(B∩C)=7, n(A∩B∩C)=3. Find the number in exactly one set. (Use inclusion-exclusion for 3 sets)
2. In a class of 40: 25 like maths (M), 20 like science (S), x like both, 3 like neither. Find x.
3. A = {x : x is a prime, x < 30}. Find n(A).
4. Three overlapping sets A, B, C in ξ=50. A only=8, B only=6, C only=9, A∩B only=4, A∩C only=3, B∩C only=5, A∩B∩C=2, neither=?. Find neither.
5. A={x : x² − 5x + 6 = 0}. Find n(A). (Solve the quadratic)
6. n(A)=3k, n(B)=2k, n(A∩B)=k, n(ξ)=50, neither=14. Find k.
7. How many proper subsets does a set with 4 elements have? (A proper subset excludes the set itself)
8. A={multiples of 6 up to 60}, B={multiples of 4 up to 60}. Find n(A∪B).
9. Verify De Morgan: ξ={1..10}, A={1,3,5,7,9}, B={2,3,5,8}. Find n((A∪B)').
10. A only=x²−2, A∩B=x+3, B only=2x, neither=1, n(ξ)=30. Find the positive value of x.
11. In a group of 100 people: 60 speak English (E), 50 speak French (F), 30 speak both. Find n(E'∩F') — speak neither.
12. A = {x : |x| ≤ 3, x ∈ ℤ}. Find n(A).
Mark-scheme style. Show all working in your book. Enter final answers here for self-marking.
ξ = {students in a year group}, n(ξ) = 60.
A = {students who study Art}, B = {students who study Biology}.
n(A) = 25, n(B) = 30, n(A∩B) = x, n(A'∩B') = 10.
ξ = {x : x is an integer, 1 ≤ x ≤ 15}
P = {x : x is a multiple of 3} Q = {x : x is a multiple of 5}
In a survey of 80 people: 45 like football (F), 38 like cricket (C), 30 like tennis (T).
n(F∩C) = 18, n(F∩T) = 14, n(C∩T) = 12, n(F∩C∩T) = 6.
State whether each number belongs to ℕ, ℤ, ℚ, or ℝ only. Enter the size of the SMALLEST set it belongs to: 1=ℕ, 2=ℤ, 3=ℚ, 4=ℝ only.
ξ = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
A = {1, 2, 3, 4, 5} B = {4, 5, 6, 7, 8}