Number Of Disjoint Subsets

Probability Level pending

Let S S be the set of the first 100 100 natural numbers and A , B A, B any two subsets of S S .

Compute the number of ordered pairs ( A , B ) \left(A,B\right) such that A B = A \cap B = \emptyset .

None of the other answers 3 100 2 100 3^{100}-2^{100} 3 100 3^{100} 2 100 2^{100} 3 100 1 2 + 1 \displaystyle{\frac{3^{100}-1}{2}+1}

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.

1 solution

For each of the 100 elements there are 3 options, i.e., be placed in subset A A , subset B B or neither. There are thus 3 100 \boxed{3^{100}} ordered disjoint pairs ( A , B ) (A,B) .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...