Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let the set $$S=\{2,4,8,16, \ldots, 512\}$$ be partitioned into 3 sets $$A, B, C$$ with equal number of elements such that $$\mathrm{A} \cup \mathrm{B} \cup \mathrm{C}=\mathrm{S}$$ and $$\mathrm{A} \cap \mathrm{B}=\mathrm{B} \cap \mathrm{C}=\mathrm{A} \cap \mathrm{C}=\phi$$. The maximum number of such possible partitions of $$S$$ is equal to:
Step 1: S={2,4,8,…,512} has nine elements, and equal-sized parts A,B,C therefore each contain three elements.
Step 2: Choose the three elements for A, then three of the remaining six for B; the last three form C. Since the sets A,B,C are named, this counts distinct assignments: C(9,3)C(6,3)=9!/(3!)³.
Step 3: The total is 1680, option D.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.