Prove that the number of subsets of a set containing n distinct elements is 2n for all nϵN.
Prove the following theorem:
The total number of subsets of a finite set containing n elements is 2n.
A set contains (2n+1) elements. The number of subsets of this set containing more than n elements is equal to