Possible Duplicate:
Proving a special case of the binomial theorem
Prove the identity using a combinatorial argument: $$\sum_{k=0}^{n}\binom{n}{k} = 2^{n}$$
I'm not sure how to do a combinatorial argument so any help is appreciated. All I know is that $2^{n}$ is representing the number of elements in the power set of n.