The set is to be partitioned into three sets of equal size. Thus, . The number of ways to partition is
- (A)
- (B)
- (C)✓ Correct
- (D)
Answer: (C)
Solution
Since the three groups are named A, B and C, they are treated as distinguishable, each to receive four of the twelve elements. The count is , with no further division. Had the groups been regarded as indistinguishable one would divide by to get ; because the problem labels them, the count without that factor is the one taken.
JEE Main · 2007 · 29 Apr 2007 · Offline · Single correct option