Let be the set of the first natural numbers and any two subsets of .
Compute the number of ordered pairs such that .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For each of the 100 elements there are 3 options, i.e., be placed in subset A , subset B or neither. There are thus 3 1 0 0 ordered disjoint pairs ( A , B ) .