. Prove that the sum of the numbers in the n th row of Pascals triangle is 2 n . One
Chapter 17, Problem 17.14(choose chapter or problem)
. Prove that the sum of the numbers in the n th row of Pascals triangle is 2 n . One easy way to do this is to substitute x D y D 1 into the Binomial Theorem (Theorem 17.8). However, please give a combinatorial proof. That is, prove that 2 n D Xn kD0 n k ! by finding a question that is correctly answered by both sides of this equation.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer