If a set $S$ has $n$ elements, how many such pairs $(A,B)$ can be formed where $A$ and $B$ are subsets of $S$ and $A \cap B = \emptyset$?
Finding the number of subset pairs of a set
2
$\begingroup$
combinatorics