Prove that number of subsets of a set containing $n$ distinct elements is $2^n$, for all $ n \in N$ by using principle of mathematical induction.

Share

Please log in or register to add a comment.