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!

I hope you learned something new! If you did, consider following the footsteps of the readers who bought me a slice of pizza 🍕. Your small contribution helps me produce this content for free and without spamming you with annoying ads.

Previous Post Next Post

Blog Comments powered by Disqus.