Let's prove that, if a set has size \(n\), then that same set has exactly \(2^n\) subsets.

|S| = n implies that |P(S)| = 2^n

Twitter proof

Do you have an idea for a twitter proof? Let me know in the comments below!

Take your Python 🐍 skills to the next level πŸš€

I write about Python every week. Join +16.000 others who are taking their Python 🐍 skills to the next level πŸš€, one email at a time.

Previous Post Next Post

Blog Comments powered by Disqus.