398 | 434,583 | 36,566 |
---|---|---|
articles | words | lines of code |
Let's prove that, if a set has size \(n\), then that same set has exactly \(2^n\) subsets.
Think of a number between 1 and 10. Multiply it by 9 and subtract 1. Now close your eyes. It got dark, didn't it?