Let . The total number of unordered pairs of disjoint subsets of S is equal to
- (A)25
- (B)34
- (C)42
- (D)41✓ Correct
Answer: (D)
Solution
For each element in S, there are three choices: it can belong to the first subset, the second subset, or neither. This gives ordered pairs of disjoint subsets.
Since we want unordered pairs, we must account for the fact that swapping the two subsets gives the same unordered pair, except when one or both subsets are empty.
The number of ordered pairs where both subsets are non-empty is (using inclusion-exclusion: subtract cases where first is empty, subtract cases where second is empty, add back the case where both are empty).
The number of unordered pairs with both non-empty is .
Adding the cases where at least one is empty: there are subsets, so 16 pairs of the form , which are the same as when unordered.
Total: .
Alternatively, the formula is .
Since we want unordered pairs, we must account for the fact that swapping the two subsets gives the same unordered pair, except when one or both subsets are empty.
The number of ordered pairs where both subsets are non-empty is (using inclusion-exclusion: subtract cases where first is empty, subtract cases where second is empty, add back the case where both are empty).
The number of unordered pairs with both non-empty is .
Adding the cases where at least one is empty: there are subsets, so 16 pairs of the form , which are the same as when unordered.
Total: .
Alternatively, the formula is .
JEE Advanced · 2010 · 11 Apr 2010 · Paper 2 · Single correct option