NVAMediumJEE 2023Power Set & Algebra of Sets

JEE Mathematics 2023 Question with Solution

Let S={1,2,3,4,5,6}S = \{1, 2, 3, 4, 5, 6\}. Then the number of one-one functions f:SP(S)f: S \to P(S), where P(S)P(S) denotes the power set of SS, such that f(n)f(m)f(n) \subset f(m) where n<mn < m, is _____.

Answer

Correct answer:3240

Step-by-step solution

Standard Method

Given: S={1,2,3,4,5,6}S = \{1,2,3,4,5,6\} so n(S)=6n(S)=6.

Find: The number of one-one functions f:SP(S)f:S \to P(S) such that f(n)f(m)f(n) \subset f(m) whenever $$n

Case 1

f(6)=Sf(6)=S : 11 option.

f(5)f(5) = any 55-element subset of SS : 66 options.

f(4)f(4) = any 44-element subset of f(5)f(5) : 55 options.

f(3)f(3) = any 33-element subset of f(4)f(4) : 44 options.

f(2)f(2) = any 22-element subset of f(3)f(3) : 33 options.

f(1)f(1) = any 11-element subset of f(2)f(2) or the empty subset : 33 options.

Hence,

165433=10801 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 3 = 1080

Case-wise Counting from the Given Solution

Case 2

f(6)f(6) = any 55-element subset of SS : 66 options.

f(5)f(5) = any 44-element subset of f(6)f(6) : 55 options.

f(4)f(4) = any 33-element subset of f(5)f(5) : 44 options.

f(3)f(3) = any 22-element subset of f(4)f(4) : 33 options.

f(2)f(2) = any 11-element subset of f(3)f(3) : 22 options.

f(1)f(1) = the empty subset : 11 option.

So,

654321=7206 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1 = 720

Case 3

f(6)=Sf(6)=S : 11 option.

f(5)f(5) = any 44-element subset of SS : 1515 options.

f(4)f(4) = any 33-element subset of f(5)f(5) : 44 options.

f(3)f(3) = any 22-element subset of f(4)f(4) : 33 options.

f(2)f(2) = any 11-element subset of f(3)f(3) : 22 options.

f(1)f(1) = the empty subset : 11 option.

Therefore,

1154321=3601 \cdot 15 \cdot 4 \cdot 3 \cdot 2 \cdot 1 = 360

Cases 4, 5 and 6

Similarly, the remaining configurations contribute 360360 functions each.

So the total is

1080+720+360+360+360+360=32401080 + 720 + 360 + 360 + 360 + 360 = 3240

Therefore, the number of such functions is 32403240.

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 f(n)f(m)f(n) \subset f(m) for nn

  • Missing the empty set as a possible image for the smallest element. This changes the count in some cases. Always include \varnothing 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.

Related questions