Q.If A = { 3, 5, 7, 9, 11 }, B = {7, 9, 11, 13}, C = {11, 13, 15}and D = {15, 17}; 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 →This problem asks us to find various intersections and combinations of four sets. The intersection contains only elements that belong to both and simultaneously; the union contains elements in either set. We systematically identify common elements for each operation.
The intersection of two sets is the collection of elements they share. Think of it as the overlap in a Venn diagram: if an element appears in both sets, it belongs to their intersection; otherwise, it doesn't. The union, by contrast, gathers everything from both sets without duplication.
The strategy is straightforward: for each intersection, scan through the sets and pick out elements that appear in all the sets being intersected. For unions, collect all distinct elements from the sets involved, then proceed with any further operations.
Let me work through each part:
(i)
We need elements that appear in both and .
Checking each element of :
- but
- but
- and ✓
- and ✓
- and ✓
So .
(ii)
Elements common to and :
- but
- but
- and ✓
- and ✓
So .
(iii)
We need elements present in all three sets: , , and .
First, : only appears in both and , so .
Now intersect with : does ? No.
So (the empty set).
(iv)
Elements common to and :
Only appears in both.
So .
(v)
Elements common to and :
No element of appears in .
So .
(vi)
First find , the union of and :
.
Now intersect with :
- but
- but
- and ✓
- and ✓
- and ✓
So .
(vii)
Elements common to and :
No overlap.
So .
(viii)
First find , the union of and :
.
Now intersect with :
The common elements are .
So .
(ix)
From part (i), . …
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.