Q.Decide, among the following sets, which sets are subsets of one and another: A = { x : x ∈ R and x satisfy x2 – 8x + 12 = 0 }, B = { 2, 4, 6 }, C = { 2, 4, 6, 8, . . . }, D = { 6 }.
Concept understanding — Subset Listing
Subset Listing: A First Look
Let's build this from the ground up — no jargon, just intuition first.
1. The Intuition: What does "subset" mean?
Imagine you have a set — a collection of distinct objects. For example:
Set A = {apple, banana, cherry}
Now, a subset is simply a selection of some (or all, or none) of these objects, taken from the original set.
- You could pick all three → {apple, banana, cherry}
- You could pick just two → {apple, banana}
- You could pick just one → {cherry}
- You could pick none → {} (the empty set)
Each of these is a subset of the original set.
2. The Precise Definition
Definition: A set B is a subset of a set A if every element of B is also an element of A.
We write this as:
B⊆A
If B is not a subset of A, we write:
B⊆A
Key points to remember:
-
Every set is a subset of itself.
Example: {apple, banana} ⊆ {apple, banana}
-
The empty set ∅ (or {}) is a subset of every set.
Why? Because it has no elements, so there's nothing to violate the condition.
-
If B is a subset of A but B=A, we call B a proper subset.
Notation: B⊂A (some books use ⊊)
3. How to "list" all subsets
Subset listing means writing down every possible subset of a given set.
Example: Set S={a,b}
All subsets:
- ∅ (empty set)
- {a}
- {b}
- {a,b} (the set itself)
So the list of all subsets is:
{∅,{a},{b},{a,b}}
How many subsets does a set have?
If a set has n elements, it has exactly 2n subsets.
- n=0 → 20=1 subset (just the empty set)
- n=1 → 21=2 subsets
- n=2 → 22=4 subsets (as above)
- n=3 → 23=8 subsets
Why 2n?
For each element, you have 2 choices: include it or exclude it. Multiply these choices: 2×2×⋯×2 (n times) = 2n.
4. A systematic way to list subsets
For a set with n elements, you can use a binary counting method:
- Label each element with a position (1st, 2nd, 3rd, ...)
- Count from 0 to 2n−1 in binary
- Each binary number tells you which elements to include (1 = include, 0 = exclude)
Example: S={a,b,c} (3 elements)
| Binary | Subset |
|---|---|
| 000 | ∅ |
| 001 | {c} |
| 010 | {b} |
| 011 | {b,c} |
| 100 | {a} |
| 101 | {a,c} |
| 110 | {a,b} |
| 111 | {a,b,c} |
That's all 8 subsets.
5. Why does this matter?
Subset listing is the foundation for:
- Probability (sample spaces and events)
- Combinatorics (counting possibilities)
- Set theory (understanding relationships between sets)
- Computer science (power sets, Boolean algebra)
Quick Check: Test Yourself
Q: List all subsets of T={x,y}.
Answer:
∅, {x}, {y}, {x,y}
Q: How many subsets does a set with 5 elements have?
Answer: 25=32
Remember: Subset listing is just systematically writing down every possible selection from a set — from picking nothing to picking everything. That's all there is to it.
Searches like "how to list all subsets of a set" and "number of subsets formula 2 to the power n" point straight to the Sets chapter of the NCERT/CBSE Class 11 Mathematics syllabus, where subset listing is introduced. The binary-counting method for listing subsets is also a handy shortcut for JEE Main set-theory and probability questions.
Why this formula?
Okay, let's break down Subset Listing from the ground up. The core idea is simple: given a set, how do we systematically list all its subsets, and why does the formula 2n work?
1. The Core Question
Imagine you have a set with n elements, like S={a,b,c} (so n=3). A subset is any collection of elements from S, including the empty set {} and the set itself {a,b,c}.
The key formula is:
Total number of subsets of a set with n elements = 2n
Let's see why this is true, not just memorize it.
2. The "Decision" or "Binary Choice" Reasoning
The most intuitive derivation comes from thinking about each element individually.
For each element in the original set, when building a subset, you have exactly two choices:
- Include the element in the subset.
- Exclude the element from the subset.
This is a fundamental, independent decision for every element.
Example with S={a,b,c}
- For element a: Choose IN or OUT. (2 choices)
- For element b: Choose IN or OUT. (2 choices)
- For element c: Choose IN or OUT. (2 choices)
Since these choices are independent (choosing for a doesn't affect the choice for b), the total number of distinct combinations of choices is the product of the number of choices for each element:
2×2×2=23=8
This directly gives the 8 subsets of {a,b,c}:
- {} (all OUT)
- {a} (a IN, b OUT, c OUT)
- {b}
- {c}
- {a,b}
- {a,c}
- {b,c}
- {a,b,c} (all IN)
3. The General Formula (Derivation)
For a set with n elements, you have n independent binary decisions. Therefore:
Total subsets=n times2×2×⋯×2=2n
This is the fundamental reason the formula holds. It's not a coincidence; it's a direct consequence of the counting principle for independent events.
4. Why This Matters for Exams
- Don't just memorize 2n. If a question asks "How many subsets does a set with 5 elements have?", you can instantly say 25=32. But if they ask why, you now have the reasoning.
- Watch out for "proper subsets". A proper subset is any subset except the original set itself. So the number of proper subsets is 2n−1.
- Watch out for "non-empty subsets". That's 2n−1 as well (excluding the empty set).
- Watch out for "non-empty proper subsets". That's 2n−2 (excluding both the empty set and the original set).
5. Quick Summary Table
| Type of Subset | Formula | Reasoning |
|---|---|---|
| All subsets | 2n | n independent binary choices (include/exclude) |
| Proper subsets | 2n−1 | All subsets minus the set itself |
| Non-empty subsets | 2n−1 | All subsets minus the empty set |
| Non-empty proper subsets | 2n−2 | All subsets minus the set itself and the empty set |
Final takeaway: The formula 2n is not magic. It's the product of n independent "yes/no" decisions. Always trace back to that binary choice when you need to derive or explain it.
Concept: Set Membership and Subset Relations
First, identify each set explicitly.
Set A contains real solutions to x2−8x+12=0. Factoring: (x−2)(x−6)=0, so x=2 or x=6. Thus A={2,6}.
Set B={2,4,6} is given.
Set C={2,4,6,8,…} is the set of all positive even integers.
Set D={6} is a singleton.
Now check subset relations (X⊆Y means every element of X is in Y):
- D={6}⊆A={2,6} ✓
- D={6}⊆B={2,4,6} ✓
- D={6}⊆C (since 6 is even) ✓
- A={2,6}⊆B={2,4,6} ✓
- A={2,6}⊆C (both are even) ✓
- B={2,4,6}⊆C (all are even) ✓
The subset relations are: D⊆A⊆B⊆C, D⊆B, and D⊆C.
Solve the quadratic to find A={2,6}, then check every pair: D⊂A⊂B⊂C forms a chain, with several other subset relations holding as well.
The question asks us to identify all subset relationships among four sets. A set X is a subset of Y (written X⊆Y) when every element of X also belongs to Y. The strategy is straightforward: first determine what each set actually contains, then systematically compare them.
Finding set A
Set A is defined by a condition: x∈R satisfying x2−8x+12=0.
Factoring the quadratic:
x2−8x+12=(x−2)(x−6)=0
So x=2 or x=6, giving us A={2,6}.
Identifying the other sets
- B={2,4,6} is explicitly listed
- C={2,4,6,8,…} is the set of all positive even integers
- D={6} is a singleton set
Checking all subset relationships
Now we compare each pair. There are (24)=6 pairs to check, plus we should verify if any set is a subset of itself (which is always true, but trivial).
1. Is A⊆B?
A={2,6} and B={2,4,6}. Both 2 and 6 are in B, so yes, A⊆B.
2. Is A⊆C?
C contains all positive even integers. Since 2 and 6 are both positive and even, yes, A⊆C.
3. Is A⊆D?
D={6} contains only 6, but A contains 2 as well. So no, A⊆D.
4. Is B⊆A?
B contains 4, which is not in A={2,6}. So no, B⊆A.
5. Is B⊆C?
B={2,4,6} and all three elements are positive even integers, so they're all in C. Yes, B⊆C.
6. Is B⊆D?
B has three elements but D has only one. No, B⊆D.
7. Is C⊆A?
C is infinite while A has only two elements. No, C⊆A.
8. Is C⊆B?
C contains 8,10,12,… which are not in B. No, C⊆B.
9. Is C⊆D?
C is much larger than the singleton D. No, C⊆D.
10. Is D⊆A?
D={6} and 6∈A. Yes, D⊆A.
11. Is D⊆B?
6∈B, so yes, D⊆B.
12. Is D⊆C?
6 is a positive even integer, so yes, D⊆C.
Notice the chain: D⊂A⊂B⊂C. Each set in this sequence is properly contained in the next, which automatically gives us many of the subset relations.
Summary of all subset relationships
| Subset relation | Valid? |
|---|---|
| D⊆A | ✓ |
| D⊆B | ✓ |
| D⊆C | ✓ |
| A⊆B | ✓ |
| A⊆C | ✓ |
| B⊆C | ✓ |
All other potential subset relations (like B⊆A, C⊆B, etc.) are false.
The subset relationships are: D⊆A⊆B⊆C, along with D⊆B and D⊆C (which follow from transitivity).
Method: Direct Set Listing and Subset Testing
Step 1: List each set explicitly
Set A — Solve x2−8x+12=0
Factor: (x−2)(x−6)=0
So x=2 or x=6
Thus A = { 2, 6 }
Set B = { 2, 4, 6 }
Set C = { 2, 4, 6, 8, … } (all positive even integers)
Set D = { 6 }
Step 2: Test subset relationships
A set X is a subset of Y (X⊆Y) if every element of X is also in Y.
-
D ⊆ A?
D = {6}, A = {2, 6} → 6 ∈ A → Yes
-
D ⊆ B?
6 ∈ B → Yes
-
D ⊆ C?
6 ∈ C → Yes
-
A ⊆ B?
A = {2, 6}, B = {2, 4, 6} → both 2 and 6 are in B → Yes
-
A ⊆ C?
2 and 6 are both even positive integers → Yes
-
B ⊆ C?
B = {2, 4, 6}, C = {2, 4, 6, 8, …} → all three are in C → Yes
-
B ⊆ A?
4 ∉ A → No
-
C ⊆ B?
8 ∉ B → No
Step 3: Summarise all subset relations
D ⊆ A ⊆ B ⊆ C
Also:
- D ⊆ B, D ⊆ C
- A ⊆ B, A ⊆ C
- B ⊆ C
Final Answer:
The chain of subsets is:
D⊆A⊆B⊆C
Common Mistakes on Set Membership & Subset Questions
Mistake 1: Solving the Quadratic Incorrectly
The error: Students often factor x2−8x+12=0 as (x−6)(x−2)=0 but then write the solution set as {6,−2} or {2,−6}.
Why it happens: Rushing through factorization or sign errors.
How to avoid: Always double-check:
- x2−8x+12=0
- Factors: (x−2)(x−6)=0
- Solutions: x=2 or x=6
- So A = {2, 6}
Pro tip: Expand your factors mentally to verify: (x−2)(x−6)=x2−8x+12 ✓
Mistake 2: Confusing Set C's Definition
The error: Students think C = {2, 4, 6, 8, ...} means "all even numbers" and incorrectly include 0 or negative numbers.
Why it happens: The "..." notation is ambiguous — students assume it starts from 2 and continues indefinitely.
How to avoid: Read the pattern carefully:
- C starts at 2 and increases by 2 each step
- So C = {2, 4, 6, 8, 10, ...} — only positive even numbers
- C does NOT contain 0, -2, -4, etc.
Mistake 3: Forgetting the Empty Set & Improper Subsets
The error: Students list subsets but forget that every set is a subset of itself.
Why it happens: Focusing only on "proper subsets" when the question asks for all subsets.
How to avoid: Remember the definition:
- Set X is a subset of set Y if every element of X is also in Y
- This is always true when X = Y
For this problem:
- A ⊆ A ✓ (always)
- B ⊆ B ✓
- C ⊆ C ✓
- D ⊆ D ✓
Mistake 4: Missing the D ⊆ A Relationship
The error: Students see D = {6} and A = {2, 6} but say "D is not a subset of A because A has an extra element."
Why it happens: Misunderstanding that subsets can be smaller — a subset doesn't need to contain all elements of the superset.
How to avoid: Check element-by-element:
- D = {6}
- Is 6 ∈ A? Yes (A = {2, 6})
- Therefore D ⊆ A ✓
Key insight: A subset can be "smaller" — it just needs every element to belong to the larger set.
Mistake 5: Incorrectly Claiming A ⊆ B or B ⊆ A
The error: Students say A ⊆ B because both contain 2 and 6, forgetting that A also contains 2.
Why it happens: Not checking every element systematically.
How to avoid: Use the element test:
- A = {2, 6}, B = {2, 4, 6}
- Is every element of A in B? 2 ∈ B ✓, 6 ∈ B ✓ → A ⊆ B ✓
- Is every element of B in A? 4 ∈ A? No → B ⊈ A ✗
Mistake 6: Confusing "∈" with "⊆"
The error: Writing "6 ⊆ A" instead of "6 ∈ A" or "D ⊆ A".
Why it happens: Mixing up element membership vs. subset notation.
How to avoid: Remember:
- ∈ = "is an element of" (for individual elements)
- ⊆ = "is a subset of" (for sets)
Correct usage:
- 6 ∈ A ✓ (6 is an element of set A)
- D ⊆ A ✓ (set D is a subset of set A)
- {6} ⊆ A ✓ (the set containing 6 is a subset of A)
Final Correct Answer
A = {2, 6}, B = {2, 4, 6}, C = {2, 4, 6, 8, ...}, D = {6}
Subset relationships:
- A ⊆ B ✓ (2 and 6 are both in B)
- D ⊆ A ✓ (6 is in A)
- D ⊆ B ✓ (6 is in B)
- D ⊆ C ✓ (6 is in C)
- A ⊆ C ✓ (2 and 6 are both in C)
- B ⊆ C ✓ (2, 4, 6 are all in C)
- Every set is a subset of itself
- KCET 2026Set UNKNOWN1 markMCQQ.If A={a,b,c,d,e,f}, then the number of subsets of A which contains at least 2 elements is (A) 64 (B) 65 (C) 57 (D) 59
›Reveal solutionSolution
Count all subsets of the 6-element set, then subtract the subsets with 0 or 1 elements.
Step 1 — Total number of subsets
A={a,b,c,d,e,f} has n(A)=6 elements, so the total number of subsets is 26=64.
Step 2 — Subtract subsets with fewer than 2 elements
Subsets with 0 elements: just the empty set, (06)=1.
Subsets with 1 element: (16)=6.
So subsets with fewer than 2 elements number 1+6=7.
Step 3 — Subsets with at least 2 elements
64−7=57
✓Final answerThe correct option is (C) — 57.
- COMEDK 2025Set 2025-E1 markMCQQ.Two finite sets have m and n elements. The total number of proper subsets of the first set is 119 more than the total number of subsets of the second set. Find the value of m−n (A) 4 (B) 6 (C) 8 (D) 1
›Reveal solutionSolution
The key idea is that the number of proper subsets of a set with m elements is 2m−1, and the number of subsets of a set with n elements is 2n. The given difference leads to 2m−2n=120, which factors as 2n(2m−n−1)=120, giving m−n=4.
We start by recalling the fundamental counting of subsets. For any finite set with k elements, the total number of subsets (including the empty set and the set itself) is 2k. A proper subset is any subset except the set itself, so the number of proper subsets is 2k−1.
The problem tells us:
- First set has m elements, so its proper subsets count = 2m−1.
- Second set has n elements, so its total subsets count = 2n.
- The difference is 119: (2m−1)−2n=119.
Let’s solve step by step.
- Set up the equation
2m−1−2n=119
Simplify:
2m−2n=120
- Factor the left side Since m>n (otherwise the difference couldn’t be positive), factor out 2n:
2n(2m−n−1)=120
-
Find integer powers of 2 that divide 120
120=23×15=8×15. So 2n must be a power of 2 that divides 120. The possible values for 2n are 1,2,4,8 (since 16 does not divide 120).
- If 2n=1, then n=0 and 2m−n−1=120 → 2m=121, not a power of 2.
- If 2n=2, then n=1 and 2m−1−1=60 → 2m−1=61, not a power of 2.
- If 2n=4, then n=2 and 2m−2−1=30 → 2m−2=31, not a power of 2.
- If 2n=8, then n=3 and 2m−3−1=15 → 2m−3=16, so m−3=4 → m=7.
-
Compute m−n
With m=7 and n=3, we get:
m−n=4
TipNotice that 120=8×15 and 15=24−1. This directly gives 2n=8 and 2m−n=16, so m−n=4 without checking other cases.
Watch outA common mistake is to forget that “proper subsets” excludes the set itself, so the first term is 2m−1, not 2m. Also, don’t confuse “subsets” (including empty set) with “proper subsets”.
✓Final answerThe correct option is (A).
ANSWER: A
- COMEDK 2024Set 2024-E1 markMCQQ.Two finite sets have 'm' and 'n' number of elements respectively. The total number of subsets of the first set is 112 more than the total number of subsets of the second set. Then the values of m and n are respectively. (A) 7, 4 (B) 7, 7 (C) 4, 4 (D) 4, 7
›Reveal solutionSolution
The number of subsets of a set with k elements is 2k. Setting 2m=2n+112 and testing small powers of 2 gives m=7, n=4, so the correct option is (A).
The key idea is that the number of subsets of a finite set grows exponentially with its size. For a set with k elements, the total number of subsets (including the empty set and the set itself) is 2k. The problem gives a relationship between two such powers of 2, and we need to find which pair (m,n) satisfies it.
- Translate the problem into an equation. The first set has m elements, so it has 2m subsets. The second set has n elements, so it has 2n subsets. The statement says:
2m=2n+112.
This is a simple exponential Diophantine equation.
-
Reason about the sizes.
Since 2m is larger than 2n by 112, m must be greater than n. Also, 112 is not a power of 2 (powers of 2 near 112 are 64, 128), so the difference is not trivial. We can try small values.
-
Test plausible values.
Let’s list powers of 2:
k123456782k248163264128256
We need 2m−2n=112.
- If m=7, then 27=128. Then 2n=128−112=16, so n=4. This works perfectly.
- If m=8, then 28=256. Then 2n=256−112=144, which is not a power of 2.
- If m=6, then 26=64, which is already less than 112, so impossible. Thus the only solution in small integers is m=7, n=4.
- Check the options. Option (A) is (7, 4). Option (D) is (4, 7), which would give 24=16 and 27=128, so 16=128+112? That’s false. So only (A) works.
Watch outA common mistake is to reverse the order: the first set has more subsets, so its size must be larger. Option (D) swaps them and gives a negative difference.
TipYou can also factor: 2n(2m−n−1)=112. Since 112 = 16×7, and 2m−n−1 must be odd, we get 2n=16 and 2m−n−1=7, so n=4 and m−n=3, giving m=7.
✓Final answerThe correct option is (A).
ANSWER: A
- COMEDK 2022Set 20221 markMCQQ.Total number of elements in the power set of A containing 17 elements is (A) 217+1 (B) 217−1 (C) 172−1 (D) 217
›Reveal solutionSolution
With n = 17, the power set has 2¹⁷ elements.
Concept: For a set with n elements, |P(A)| = 2ⁿ.
With n = 17, the power set has 2¹⁷ elements.
✓Final answerThe correct option is (D) — 217
ANSWER: D
- COMEDK 2021Set 20211 markMCQQ.Total number of elements in the power set of A containing 15 elements is (A) 215 (B) 152 (C) 215−1 (D) 215 − 1
›Reveal solutionSolution
The options are printed with lost superscripts; option (A) is 2^15, which is the required count. (Options (C)/(D) show 2^15 - 1, which would be the number of proper subsets, not the size of the power set.)
Concept: if a set A has n elements, its power set P(A) (the set of all subsets, including the empty set and A itself) has 2^n elements.
Here n = 15, so the number of elements of the power set is 2^15 (= 32768).
The options are printed with lost superscripts; option (A) is 2^15, which is the required count. (Options (C)/(D) show 2^15 - 1, which would be the number of proper subsets, not the size of the power set.)
✓Final answerThe correct option is (A) — 215
ANSWER: A
🎓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.