SOLUTION: simplify (n-1)C(r-1) + (n-1)Cr

SOLUTION: simplify (n-1)C(r-1) + (n-1)Cr

Algebra.Com

Question 594320: simplify (n-1)C(r-1) + (n-1)Cr
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
Pascal's triangle. It can be proven using a committee-forming argument (suppose you choose r people from a group of n. If person X is chosen, we have to choose r-1 people from n-1. If X is not chosen, we choose r people from n-1).

You can also do it algebraically.
RELATED QUESTIONS
For positive integers n > r, show that: a) nCr = nC(n-r) b) nCr = (n-1)C(r-1) +... (answered by swincher4391)

How to verify the identity of: (n+1)Cr= nCr +... (answered by ikleyn)

prove that C(n , r) + C(n , r-1) = C(n+1 ,... (answered by ikleyn)

prove that:... (answered by venugopalramana)

Show that r(nCr) = n[(n-1)C(r-1)] (answered by Edwin McCravy)

(r+1)(n+1/r+1)=(n+1)(n/r) (answered by ikleyn)

Proof that ncr=(n/n-r)(n-1 c r) Proof that n(n-1 c r) = (r+1) (n c... (answered by math_helper)

Find A, B and C, cr[cr(2) - 1] = cr(A) + cr(B) + cr(C) Where cr means cube root (answered by ikleyn)

n! / r! =... (answered by edjones)