When mathematicians find a solution to a problem, they are interested in the practicality of being able to actually compute the solution. You have seen in the box following Example that a set having k elements will have 2k subsets. We will pursue this idea.
Find the largest value for k on your calculator that when you try to compute 2k, you do not get an overflow. (On the calculator that I was using, the largest k for which I could get an answer was k = 332.)
Example Finding All Subsets of a Set Systematically Find all subsets of the set {1, 2, 3, 4}.
We can organize this problem by considering subsets according to their size, going from 0 to 4. This method is illustrated in the following table.
Size of Subset | Subsets of This Size
| Number of Subsets of This Size |
0 | ∅ | 1 |
1 | {1}, {2}, {3}, {4} | 4 |
2 | {1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4} | 6 |
3 | {1, 2, 3}, {1, 2, 4}, {1, 3, 4}, {2, 3, 4} | 4 |
4 | {1, 2, 3, 4} | 1 |
5 |
| Total = 16 |
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.