Algebraic Proof of Combinatorial Identity

  • Thread starter Thread starter Shoney45
  • Start date Start date
  • Tags Tags
    Identity Proof
Shoney45
Messages
65
Reaction score
0

Homework Statement



Verify C(n,k) = C(n-1,k) + C(n-1,k-1) algebraically.

Homework Equations



N/A

The Attempt at a Solution



I've set the identity up factorially like so: (n-1)!/k!(n-1-k)! + (n-1)!/[(k-1)!(n-2-k)!

I'm having a really hard time getting started here. That is the story in a nutshell. I've been staring at this for a while, and just can't get started. I need a nudge getting the ball rolling a little bit.
 
Physics news on Phys.org
There are a lot of factors in common to both terms...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top