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!
Improve your Python 🐍 fluency and algorithm knowledge 🎯
Get ready for 12 intense days of problem-solving. The “Algorithm Mastery Bootcamp” starts December 1st and it will feature 24 programming challenges, live analysis sessions, a supportive community of like-minded problem-solvers, and more! Join now and become the Python expert others can rely on.
