Let A and B be subsets of {1, 2, 3, ..., 10}. Find the number of pairs (A,B) such that \(A \cap B = \emptyset\)
1 pair because (A,B) doesn't want to be changed into anything else. Trust me, I asked it myself.
