If one takes the sum of a row of entries in Pascal’s triangle, one finds that $$\binom{n}{0}+\binom{n}{1}+\cdots+\binom{n}{n}=2^n.$$ In this video, we prove this remarkable combinatorial identity in two ways: by forming a committee and substituting numbers into the binomial theorem.
