Let . Then the number of one-one functions , where denotes the power set of , such that where , is _____.
JEE Mathematics 2023 Question with Solution
Answer
Correct answer:3240
Step-by-step solution
Standard Method
Given: so .
Find: The number of one-one functions such that whenever $$n
Case 1
: option.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of or the empty subset : options.
Hence,
Case-wise Counting from the Given Solution
Case 2
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= the empty subset : option.
So,
Case 3
: option.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= any -element subset of : options.
= the empty subset : option.
Therefore,
Cases 4, 5 and 6
Similarly, the remaining configurations contribute functions each.
So the total is
Therefore, the number of such functions is .
Common mistakes
Assuming only one chain of subset sizes is possible. This is wrong because the solution counts several valid configurations of subset cardinalities. Count all cases listed, not only the most obvious descending chain.
Forgetting that the condition for
Missing the empty set as a possible image for the smallest element. This changes the count in some cases. Always include when the nesting condition permits it.
Practice more Power Set & Algebra of Sets questions
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.
