The Number of Subsets of a Finite Set Binomial Theorem Proof

The Number of Subsets of a Finite Set Binomial Theorem Proof. Rephrased another way, if S has cardinality n, then it's power set has cardinality 2^n. There are several ways to prove this, in this video the Binomial Theorem is used.

[ellien]

What a life saving tutorial, have my test next week and now I finally understand this concept. Thank you!

[fb-guer]

that is not a proof, it's the intuition behind it

[paradoxscientist]

I proved that there are 2^n subsets in a set using permutation-combination and binomial expansion of (1+x)^n by myself out of curiosity without knowing that it was already proved sometime earlier. 😗

[hyunpang]

do you have the induction way of proving?

[mgominasian]

i have q a question how did you guess x and y = 1 i cannot seems to grasp that part