how to find total no of unordered pairs of


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

Solution) 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 require to exclude the possibility of all elements choosing to be in S itself. Therefore the number of ways is 3n-1

Request for Solution File

Ask an Expert for Answer!!
Mathematics: how to find total no of unordered pairs of
Reference No:- TGS0210214

Expected delivery within 24 Hours