Define (n k) = n!/k!(n-k)! for k=0,1,...,n.
Part (b) Show that (n k) + (n k-1) = (n+1 k) for k=1,2,...n.
Part (c) Prove the binomial theorem using mathematical induction and part (b).
The Attempt at a Solution
I'm wasn't able to find the correct symbols to write out what (n k) should look like (it should be vertical). I hope it is still clear what was meant. If anyone knows what symbols to use on this site please let me know.
I attempted this by using induction, but it got pretty sloppy pretty quickly. Before I try to pursue that route I was wondering if there was a more elegant way to approach the problem. Or if using induction, what would be the best way to start. Perhaps if someone can lay out the approach I should be able to make a good dent in the problem.
I will post any questions about part (c) only after I solve part (b).
Thank you for reading.