TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 2
Question 2 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer and explanation.
Let S = {1,2,..., n}. Let S₁ be the set of all subsets of S that contain 1. Let T₁ denote the set of all subsets of S that don't contain 1. Which of the following statement is correct?
- |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾
- |T₁| ≠ |S₁|
- |T₁| + |S₁| = 2⁽ⁿ⁻¹⁾
- |T₁| + |S₁| = 2ⁿ
Show answer
Answer: (1) |T₁| = |S₁| = 2⁽ⁿ⁻¹⁾ / (4) |T₁| + |S₁| = 2ⁿ
A subset of S that contains 1 is fixed by choosing any subset of the other n − 1 elements, so |S₁| = 2ⁿ⁻¹; likewise a subset without 1 is any subset of {2,...,n}, so |T₁| = 2ⁿ⁻¹. Hence statement (1) is true, and since every subset of S falls in exactly one of the two classes, |T₁| + |S₁| = 2ⁿ⁻¹ + 2ⁿ⁻¹ = 2ⁿ, so statement (4) is also true. Because both are correct, TSPSC accepted both (1) and (4); (2) and (3) are false.