SOLUTION: Show that (m+n)Ck = mCk * nC0 + mC(k-1) * nC1 + mC(k-2) * nC2 + ... + mC0 * nCk For k <= (m+n)

Question 491882: Show that (m+n)Ck = mCk * nC0 + mC(k-1) * nC1 + mC(k-2) * nC2 + ... + mC0 * nCk
For k <= (m+n)
Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
Suppose Committee A has m people and Committee B has n people, and we want to choose a total of k people out of the total m+n. We can choose all k people from Committee A and none from Committee B, for mCk*nC0 ways. Or we can choose k-1 people from A and 1 person from B, and so on, hence the given statement is true.

However, this only works for k <= m and k <= n, unless we define xCy = 0, if x < y.
RELATED QUESTIONS
Show that nC0+nC2+nC4+...=nC1+nC3+...=2^,where... (answered by mathslover)

Are there m, n, k so that: 1/m + 1/n + 1/k = 1/(m+n) + 1/(n+k) + 1/(m+k)... (answered by ikleyn)

Solve for m... (answered by josgarithmetic)

For arbitrary positive integers k, m, and n, will there exist a prime p such that... (answered by Edwin McCravy)

Solve for k:... (answered by bosco20106)

How do i show for integers m and n and a natural number k that is greator and equal to 1. (answered by venugopalramana)

1. (K ¡ L) ⊃ (M ● N) 2. (N ¡ O) ⊃ (P ● ∼K)/ ∼K (answered by Edwin McCravy)

solve each problum using the segment addition postulate and/or the concept of midpoint. (answered by ewatrrr)

idk how to solve this problem 36-4(k+m),for k=1,n=3 (answered by solver91311)