Suppose we know that set A has n subsets, S1, S2,…, Sn. If set B consists of the elements of A and one more element so |B| = |A| + 1, show that B must have 2n subsets.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.