SOLUTION: Proof that (n+1combination r) is equal to (n combination r-1) + (n combination r)

Algebra ->  Permutations -> SOLUTION: Proof that (n+1combination r) is equal to (n combination r-1) + (n combination r)      Log On


   



Question 1143956: Proof that (n+1combination r) is equal to (n combination r-1) + (n combination r)
Answer by Edwin McCravy(20064) About Me  (Show Source):
You can put this solution on YOUR website!
C(n+1,r) = C(n,r-1) + C(n,r)

which is often written this way:



We'll use the facts that 

%28matrix%282%2C1%2CM%2CS%29%29=+M%21%2F%28S%21%28M-S%29%21%29, M%21=M%2A%28M-1%29%21 and %28M%2B1%29%21=%28M%2B1%29M%21

We'll prove the right side equals the left side:

%28matrix%282%2C1%2Cn%2Cr-1%29%29%2B%28matrix%282%2C1%2Cn%2Cr%29%29

matrix%283%2C1%2C%22%22%2C%22%22=%22%22%2C%22%22%29



Rewrite (n-r+1)! in the left denominator and r! in the right denominator:



The LCD is r(r-1)!(n-r+1)(n-r)!



Factor n! out of the numerator and rewrite the denominator:

%28n%21%28r%5E%22%22%2B%28n-r%2B1%29%29%29%2F%28r%21%5E%22%22%28n-r%2B1%29%21%29

%28n%21%28r%5E%22%22%2Bn-r%2B1%29%29%2F%28r%21%5E%22%22%28n-r%2B1%29%21%29

%28n%21%5E%22%22%28n%2B1%29%29%2F%28r%21%5E%22%22%28n-r%2B1%29%21%29

Rewrite the numerator as (n+1)! and the (n-r+1)! as (n+1-r)!

%28n%2B1%29%21%2F%28r%21%5E%22%22%28n%2B1-r%29%21%29

That's the same as the original left side:

%28matrix%282%2C1%2Cn%2B1%2Cr%29%29

Edwin