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 $$\mathrm{A}=\{1,2,3, \ldots, 7\}$$ and let $$\mathrm{P}(\mathrm{A})$$ denote the power set of $$\mathrm{A}$$. If the number of functions $$f: \mathrm{A} \rightarrow \mathrm{P}(\mathrm{A})$$ such that $$\mathrm{a} \in f(\mathrm{a}), \forall \mathrm{a} \in \mathrm{A}$$ is $$\mathrm{m}^{\mathrm{n}}, \mathrm{m}$$ and $$\mathrm{n} \in \mathrm{N}$$ and $$\mathrm{m}$$ is least, then $$\mathrm{m}+\mathrm{n}$$ is equal to _________.
Step 1: For each a∈A, the set f(a) must contain a; each of the other six elements can independently be included or omitted.
Step 2: Thus there are 2^6 choices for each of the seven inputs, giving (2^6)^7=2^42 functions.
Step 3: The least-base form is m^n=2^42, so m+n=2+42=44.
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.