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

Follow me on Twitter, where I write about Python, APL, and maths.

|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!

Thanks for reading this far! If you would like to show your appreciation for my work and would like to contribute to the development of this project, consider buying me a slice of pizza 🍕.

Previous Post Next Post

Blog Comments powered by Disqus.