# how to find total no. of unordered pairs of disjoint subsets of a finite set?

Aman Bansal
592 Points
10 years ago

Dear Students,

Total disjoint subsets are 2^n-1 where n is the no of elements in the set.

Cracking IIT just got more exciting,It s not just all about getting assistance from IITians, alongside Target Achievement and Rewards play an important role. ASKIITIANS has it all for you, wherein you get assistance only from IITians for your preparation and win by answering queries in the discussion forums.

So start the brain storming…. become a leader with Elite Expert League ASKIITIANS

Thanks

Aman Bansal

mycroft holmes
272 Points
10 years ago

Suppose A and B are two such disjoint subsets of the set S. Then every element can go into A or B or the set S (3 choices). We only need to exclude the possibility of all elements choosing to be in S itself. Hence the number of ways is 3n-1

Suman Anand
18 Points
9 years ago
to find total no. of unordered pairs of disjoint subsets of a finite set---
If a finite set is given then take the no of elements of the set as “n” then solve :
formulae is -----------              (3^n+1)/2
n uh will get the ans...
thank you
Suman Anand
A student of Vidyamandir Mandir Classes.
Gaurav Kumar
37 Points
6 years ago
If there are pairs of unordered disjoint sets could be found, 3 is to the power n-1/2+1. This formula mostly asked in IIT and competitive questions.
stuti tiwari
11 Points
6 years ago
Total subsets=( 3^n)+1So total unordered subsets will be half of it ....=(( 3^n )+1)/2Where n is the total no of discreet elements given in the finite set