How many subsets in a set? (2 of 2: Combinatorial proof)

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

This is one of my all time favorite propfs because after substituting 1 the answer immediately appears which is s "whoa what just happened?!" moment.

SeeTv.
Автор

I thought I was so clever pointing this out in a comment on yesterday's video, but you were one step ahead as always, Mr. Woo! Enjoy your weekend!

AdamLaMore
Автор

If you want an easier proof, you should just notice that for each of the n elements, you have 2 choices: either it's in the set or it's not in the set. So you have 2 choices, n times, which means the total number of options is 2^n.

mxlexrd
Автор

it's just easier to note that every member has 2 options either to be included or to be excluded. and therefore there are 2 to the power of the number of members subsets.

magick
Автор

I want to study from you for entrance examination of IIT i.e. JEE mains and advance.

himanshumaurya
Автор

Sir please teach for IIT examination, which is one of the most difficult examination in India.

himanshumaurya
Автор

Sir, I recently found your channel 😅
Can you suggest something for JEE Mains and Advanced for your followers who wants this
Atleast some tips ✌🏼🙂

kanishkaasde
Автор

Sir, which is the best book or website to became a math teacher ? "PLEASE REPLAY"

srikantadash
Автор

I love maths but i am studying for chartered accountant 😕

suryakumarijuthuka
Автор

If Eddie woo got 85 views in 16 minutes, how many views Will he get on 14 days?

ahzaanwari
Автор

Why can't you find an Arabic translation?

تيتانالصغيره-كب