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!(m−n)!n!
Remaining elements = (m - n) [u, z, n are already selected]
No. of subsets that can be formed from (m - n) elements =2m−n
So, for any particular value of n, total number of disjoint sets
=m!(m−n)!n!×2m−n
because 2m−n subsets have all different elements form =m!(m−n)!n!
So, total no. of disjoint ordered sets pair =
∑4n=0m!(m−n)!n!×2m−n
=∑4n=0mCn 2m−n. 1n
Comparing with form (1+x)m=∑mn=0mCnxm−n1n we get
∑4n=0mCn 2m−n 1n=(2+1)m=3m
There, 3m pairs also contain (Φ,ϕ). So, subtracting that leaves (3m−1) 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 =3m−12+1m for (Φ,ϕ)
[sin a,m=A]=34−12+1=41 pairs