Q.Find the union of each of the following pairs of sets :
The union of two sets collects every element that belongs to at least one of the sets. For each pair, we list all distinct elements from both sets. The answers are: (i) ,
(ii) ,
(iii) ,
(iv) ,
(v) .
The union of two sets and , written , is the set of all elements that are in , or in , or in both. There is no duplication — if an element appears in both sets, it appears only once in the union.
The simplest way to find is to list every element from , then add any element from that hasn't already been listed. That is exactly what we will do for each pair.
(i) ,
- Start with all elements of : .
- Now look at : it has , , and . The and are already in our list, so we only add the new element .
- The combined list is .
A common mistake is to write or to forget that and appear twice. The union never repeats elements.
(ii) ,
- Start with : .
- From , is already present; add and .
- Result: .
Order does not matter in a set. Writing is just as correct as . In exams, alphabetical or logical ordering is cleaner but not required.
(iii) ,
First, write both sets explicitly.
- — all positive multiples of .
- — natural numbers through .
- Start with : .
- From , the element is already in ; add .
- The union is .
Since is infinite, the union is also infinite. We cannot list all elements, so we describe the pattern: all natural numbers that are either less than or multiples of (or both).
(iv) ,
Write them out:
- (natural numbers greater than and up to ).
- (natural numbers strictly between and ).
- Start with : .
- has — none of these are in , so add all three.
- Result: .
Notice that is in but not in , and is in but not in . The sets are disjoint (no common elements), so the union is simply the combination of both.
(v) , (the empty set)
- Start with : .
- has no elements, so nothing to add.
- The union is exactly : .
For any set , . The empty set contributes nothing to a union.
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.