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 $$S=\{1,2,3,4,5,6\}$$. Then the number of one-one functions $$f: \mathrm{S} \rightarrow \mathrm{P}(\mathrm{S})$$, where $$\mathrm{P}(\mathrm{S})$$ denote the power set of $$\mathrm{S}$$, such that $$f(n) \subset f(\mathrm{~m})$$ where $$n < m$$ is ____________.
Step 1: The condition is a strict chain f(1)⊊f(2)⊊…⊊f(6). Assign each element of S to its first chain set in which it appears, or to the class ‘never appears’.
Step 2: Each of the five transition classes must be nonempty. If exactly five elements appear during transitions, the count is 6·5!·2=1440: choose the omitted element, order the five singleton additions, then place the omitted element initially or never.
Step 3: If all six elements appear during transitions, the count is the number of surjections from six labeled elements onto five labeled transitions: 5!·S(6,5)=120·15=1800. Total=1440+1800=3240.
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.