Calculate $\sum_{k=0}^{n}\binom{n}{k}$.
The quantity to be calculated represents the number of subsets of a set with $n$ elements. It can be counted in the following way: for each element, there is an independent choice of either taking it or not taking it. The answer is therefore $2^{n}$. Another proof consists of a proof by induction.