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.

Twitter proof:

— Mathspp (@mathsppblog) August 6, 2020

Take a set of size n. For any of its subsets, we can label items with 0/1 depending on whether or not the item is in the subset or not, and to any such labelling corresponds a single subset. There are 2^n such labellings, hence 2^n subsets.https://t.co/5uxKAi7D9T

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 🍕.