Q.If A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, C = {5, 6, 7, 8 }and D = { 7, 8, 9, 10 }; find
You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
Start your 14-day free trial to unlock the full solution →The union of sets collects all distinct elements from the sets being combined, with no repetition. We systematically find each union by listing every element that appears in at least one of the given sets.
The union operation creates a new set containing every element that belongs to , or to , or to both. Think of it as pooling resources: if you have one bag of marbles and another bag of marbles, the union is all the marbles you have when you pour both bags together—but you only count each unique marble once, even if it appeared in both bags.
The key principle: an element if and only if or (or both). Duplicates are automatically eliminated because sets contain each element at most once.
Given:
Let's work through each union systematically.
(i)
- List all elements from :
- Add elements from that aren't already listed: (we skip and since they're already in )
- Arrange in ascending order:
(ii)
- Start with :
- From , all elements are new
- Therefore:
(iii)
- Start with :
- From , we already have and , so add only
- Therefore:
(iv)
- Start with :
- From , all elements are new
- Therefore:
(v)
We can build this incrementally. We already know .
- Take :
- From , we already have and , so add
- Therefore:
Notice that in this case. That's because every element of is already in either or , so contributes nothing new to the three-way 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.