As the title says.
Prove that ${n+1 \choose k} = {n \choose k} + {n \choose k-1}$
It looks to me like induction but since there are two variables, I'm not really sure how to even set up a base case. If it is, in fact, induction.
As the title says.
Prove that ${n+1 \choose k} = {n \choose k} + {n \choose k-1}$
It looks to me like induction but since there are two variables, I'm not really sure how to even set up a base case. If it is, in fact, induction.
We know $$\binom{n}{k} = \frac{n!}{k!(n-k)!}$$ So now $$\begin{align*} \binom{n}{k} + \binom{n}{k-1} & = \frac{n!}{k!(n-k)!} + \frac{n!}{(k-1)! (n-k+1)!} \\ & = \frac{n! (n-k+1)}{k! (n+1-k)!} + \frac{k n!}{k! (n+1-k)!} \\ & = \frac{(n+1-k+k)n!}{k! (n+1-k)!} = \frac{(n+1)!}{k! (n+1-k)!} \\ & = \binom{n+1}{k} \end{align*}$$ q.e.d.
The first summand is if your choice of $k$ elements excludes the first element.
The second summand is if the $k$ elements includes the first element.