wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Let S = {1, 2, 3, 4}.Find the total number of unordered pairs of disjoint subsets of S.

Open in App
Solution

S = {1, 2, 3, 4}. Let us assume S has m elements
No. of ways to select n elements out of m1=mCn
mCn=m!(mn)!n!
Remaining elements = (m - n) [u, z, n are already selected]
No. of subsets that can be formed from (m - n) elements =2mn
So, for any particular value of n, total number of disjoint sets
=m!(mn)!n!×2mn
because 2mn subsets have all different elements form =m!(mn)!n!
So, total no. of disjoint ordered sets pair =
4n=0m!(mn)!n!×2mn
=4n=0mCn 2mn. 1n
Comparing with form (1+x)m=mn=0mCnxmn1n we get
4n=0mCn 2mn 1n=(2+1)m=3m
There, 3m pairs also contain (Φ,ϕ). So, subtracting that leaves (3m1) which are ordered. This means for eg. {1}, {2,3,4} and {(2,3,4),(1)} will both be corrected. But in question only unordered pairs are asked. So, total no. of pairs of disjoint unordered sets =3m12+1m for (Φ,ϕ)
[sin a,m=A]=3412+1=41 pairs

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Sum of Numbers and Last Digits
QUANTITATIVE APTITUDE
Watch in App
Join BYJU'S Learning Program
CrossIcon