Use induction and Pascal's Identity to show that $\sum_{k=0}^{r}C(n+k,k) = C(n+r+1,r)$

249 Views Asked by At

I know Pascal's Identity is ${n \choose k}={n-1 \choose k-1}{n-1 \choose k}$, but I am not sure how to set up and use the proof to show that $\sum_{k=0}^{r}C(n+k,k) = C(n+r+1,r)$.

Can anyone help me with this problem?

1

There are 1 best solutions below

4
On

First verify $r=0$, then prove an induction on $r$ using Pascal's identity.