Counting in 2 ways proof

Mathematics
Tutor: None Selected Time limit: 1 Day

Apr 21st, 2015

suppose we have total a+b of ball, a is white, and b is black, if we take k balls out of a+b balls and don't care about the color of the balls, the number of ways is (a+b, k).  On the other hands the k balls also can be selected by picking up i of a balls and k-i of  b balls,  which make total of k balls, i can be 0 to k, (if a>=k and b>=k), the sum of i from 0 to k, should give the total ways of selecting the balls, thus we have 

(a+b,k) = sum of i from 0 to k (a,i) (b,k-i) 

if we just define that (a,j)=0 for j>a, and (b,j)=0, for j>b    

Apr 21st, 2015

Are you studying on the go? Check out our FREE app and post questions on the fly!
Download on the
App Store
...
Apr 21st, 2015
...
Apr 21st, 2015
Dec 7th, 2016
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer