As of now, my blog is being migrated here. You can find all the old content over here.
Let's prove that, if a set has size \(n\), then that same set has exactly \(2^n\) subsets.
This post's problem is a really interesting problem I solved two times. The first time I solved it I failed to prove exactly how it works... then some years later I remembered the problem statement and was able to solve it properly. Let's see how you do!