I need to prove ${n \choose k} = {n \choose k -1}\frac{n -k +1}{k}$ by induction for k in {2 .....,n}. Can someone show be the proof? Here is the work I have done for the inductive step: Assume true for ${n \choose k} = {n \choose k -1}\frac{n -k +1}{k}$ We need to show ${n+1 \choose k} = {n+1 \choose k -1}\frac{n+1 -k +1}{k}$
${n+1 \choose k} = {n+1 \choose k -1}\frac{n+1 -k +1}{k}$
${n \choose k} + {n \choose k-1} = ({n \choose k -1}+{n \choose k -2})\frac{n+2 -k}{k}$
Then by the inductive hypothesis:
${n \choose k -1}\frac{n -k +1}{k} +{n \choose k -2}\frac{n -k +2}{k-1} = ({n \choose k -1}+{n \choose k -2})\frac{n+2 -k}{k}$
I cannot figure out where to go from here