Q.List all the subsets of the set { –1, 0, 1 }
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 key idea is to systematically list every possible combination of elements from the set . The total number of subsets is , and the complete list is: , , , , , , , .
The question asks for all subsets of . A subset is any collection of elements taken from the original set, including the possibility of taking none (the empty set) or all (the set itself). The number of subsets of a set with elements is , because each element has two choices: either it is in the subset or it is not. Here , so we expect subsets.
The most reliable way to list them is to go by size — from 0 elements up to 3 elements — so you never miss one.
-
0-element subset (the empty set): (also written as ). This is always a subset of any set.
-
1-element subsets (singletons): Pick each element alone.
-
2-element subsets: Choose any two of the three elements.
-
3-element subset (the set itself): Take all three elements.
That gives us 1 + 3 + 3 + 1 = 8 subsets, which matches the count. …
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.