(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Prove that if a set a contains n elements, then the number of different subsets of A is equal to 2^{n}.

3. The attempt at a solution

I know how to prove with just combinatorics, where to construct a subset, each element is either in the set or not, leading to 2^{n}subsets. I want to know how to prove it with mathematical induction though. How would I start?

I figured this using summation notation:

[itex]\sum^{k=0}_{n}[/itex] (n k)=2^{n}

**Physics Forums - The Fusion of Science and Community**

# Proof: Number of different subsets of A is equal to 2^n?

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Proof: Number of different subsets of A is equal to 2^n?

Loading...

**Physics Forums - The Fusion of Science and Community**