RankRizz
JEE ADVANCED 2010 · PAPER 2MEDIUMTRANSCRIBED

JEE Advanced 2010 Mathematics question — One-one, onto functions and counting functions

Let S = {1, 2, 3, 4}. The total number of unordered pairs of disjoint subsets of S is equal to

SOLUTION

To solve this problem, we need to determine the total number of unordered pairs of disjoint subsets of the set .

Understanding the Problem:

Disjoint Subsets: Two subsets and are disjoint if they have no elements in common, i.e., .

Unordered Pairs: Pairs where is considered the same as .

Approach:

Counting Ordered Pairs of Disjoint Subsets:

For each element in , it can be in:

Subset only,

Subset only,

Neither nor .

Note: An element cannot be in both and because and are disjoint.

Therefore, each element has 3 choices.

Total number of ordered pairs is .

Identifying Ordered Pairs where :

Since and are disjoint and , the only possibility is when both are the empty set.

So, there's 1 ordered pair where .

Calculating Unordered Pairs:

Ordered Pairs with : .

Unordered Pairs from Ordered Pairs with : Each unordered pair corresponds to 2 ordered pairs (since and are different but represent the same unordered pair).

Number of unordered pairs from is .

Include the pair where : Add .

Total Unordered Pairs: .

Conclusion:

The total number of unordered pairs of disjoint subsets of is 41.


Answer: Option D

Tagged One-one, onto functions and counting functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.

ChapterFunctions
TopicOne-one, onto functions and counting functions
TypeMultiple choice