Number of subset pairs
by hemangsarkar, Jun 20, 2016, 7:10 AM
Q) Let A be a set of the first N positive integers :A={1,2,3,4.........N}.
Let B be the set containing all the subsets of A.
A relations is defined as follows:
R1={ (x,y) : x and y belong to B and x is not a subset of y and y is not a subset of x and the intersection of x and y is equal to empty set }
NOTE : (x,y) is the same as (y,x) ,i.e the pairs are unordered.
example:
Let A={1,2}
Then B={Phi,{1},{2},{1,2}}
Phi=Empty Set
So R1=Either {({1},{2})} or {({2},{1})} hence number of relations is 1.
Solution:
We are given a number
, the first thing we need to think of is how many numbers from
to
can we use to make our relation? We can use a minimum of
numbers and a maximum
numbers.
Let us use say
numbers where
.
Number of ways to select
numbers out of
numbers is
.
Once we have selected
numbers, we start thinking about our unordered pair
.
can contain a minimum of
and a maximum of
numbers. Hence if we are considering ordered pairs then we can have a total of

pairs.
We know that
.
hence our required sum is
.
But this counts the number of ordered pairs and we want number of unordered pairs hence we divide by
.
pairs for
numbers selected out of
numbers.
We can easily see that the final answer will be:

or,
or,
or,
or,
You can also go here to see another solution:
http://math.stackexchange.com/questions/216984/finding-the-number-of-subset-pairs-of-a-set
Let B be the set containing all the subsets of A.
A relations is defined as follows:
R1={ (x,y) : x and y belong to B and x is not a subset of y and y is not a subset of x and the intersection of x and y is equal to empty set }
NOTE : (x,y) is the same as (y,x) ,i.e the pairs are unordered.
example:
Let A={1,2}
Then B={Phi,{1},{2},{1,2}}
Phi=Empty Set
So R1=Either {({1},{2})} or {({2},{1})} hence number of relations is 1.
Solution:
We are given a number





Let us use say


Number of ways to select



Once we have selected






pairs.
We know that

hence our required sum is

But this counts the number of ordered pairs and we want number of unordered pairs hence we divide by




We can easily see that the final answer will be:

or,

or,

or,

or,

You can also go here to see another solution:
http://math.stackexchange.com/questions/216984/finding-the-number-of-subset-pairs-of-a-set
This post has been edited 2 times. Last edited by hemangsarkar, Jun 20, 2016, 8:05 AM