Author name: mathemerize

Prove that the total number of subsets of a finite set containing n elements is \(2^n\).

Solution : Let A be a finite set containing n elements. Let 0 \(\le\) r \(\le\) n. Consider those subsets of A that have r elements each. We know that the number of ways in which r elements can be chosen out of n elements is \(^nC_r\). Therefore, the number of subsets of A having

Prove that the total number of subsets of a finite set containing n elements is \(2^n\). Read More »