Trying to determine a formula for the sum of the entries of the $n$th row of Pascal’s triangle, for any natural number $n$. Any proof will do as I have to determine $3$ different proofs.
-
So far, I've been working with a proof which includes Pascal's Identity and using combinations to produce $2^n$.