Hello all(adsbygoogle = window.adsbygoogle || []).push({});

In my calculus book, this problem has been pestering me"

Prove nC(k-1) + nCk = (n+1)Ck, where k > 0 which is read " n choose k-1" + "n choose k"

= n+1C k.

I tried using the formula for the binomial coefficient, but it becomes very messy. I also tried setting k = 1, but then it did not seem like I was actually proving it. Rather I was showing that the statement holds for k > 0. Would I have to use proof my induction? I know that n! = n(n-1)!. Any replies would be greatly appreciated.

Thanks a lot

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Combinatorics Proof

Loading...

Similar Threads - Combinatorics Proof | Date |
---|---|

B Proof of a limit rule | Dec 19, 2017 |

B Proof of quotient rule using Leibniz differentials | Jun 10, 2017 |

B Don't follow one small step in proof | Jun 10, 2017 |

**Physics Forums - The Fusion of Science and Community**