Find the probability that the first white ball is placed before all the black balls.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP



Find the probability that the first white ball is placed before all the black balls.



Suppose in an urn there are $20$ black balls labelled $1,2, ldots , 20$ and $10$ white balls labelled $1,2, ldots ,10$. Balls are drawn one by one without replacement. Find the probability that the white ball labelled $1$ is drawn before all the black balls.



My attempt $:$



If we want to draw the first white ball before all the black balls then I have to draw the first white ball in one of first $10$ steps.



Suppose I draw the first white ball in $k$-th step. Then in order to fulfil my requirement I have to draw white balls in first $k-1$ steps. That can be done in $binom 9 k-1 (k-1)!$ ways. For each of these ways remaining $30-k$ balls can be drawn in $(30-k)!$ ways. This $k$ can run from $1$ to $10$.



So the total number of ways to draw the first white ball before all the black balls is $$sumlimits_k=1^10 binom 9 k-1(k-1)! (30-k)!$$ So the required probability is $$frac130!sumlimits_k=1^10 binom 9 k-1(k-1)! (30-k)! =sumlimits_k=1^10 frac 9!(30-k)! 30!(10-k)!$$



Now my instructor has given it's answer which is $frac 1 21$. Does the above sum evaluate to $frac 1 21$? Is there any other simpler way to do this? Please help me in this regard. Thank you very much.





No. That's not my question.
– Dbchatto67
6 hours ago




3 Answers
3



To evaluate $sum_k=1^10frac9!30!frac(30-k)!(10-k)!$:



beginalign
sum_k=1^10frac9!30!frac(30-k)!(10-k)!&=frac9!cdot 20!30!sum_k=1^10frac(30-k)!20!(10-k)! \
&=frac9!cdot 20!30!sum_k=1^10binom30-k20 \
&=frac9!cdot 20!30!left[binom2020+binom2120+binom2220+binom2320+ldots+binom2920right] \
&=frac9!cdot 20!30!left[binom2121+binom2120+binom2220+binom2320+ldots+binom2920right] \
&=frac9!cdot 20!30!left[binom2221+binom2220+binom2320+ldots+binom2920right] \
&=frac9!cdot 20!30!left[binom2321+binom2320+ldots+binom2920right] \
&=cdots \
&=frac9!cdot 20!30!binom3021 \
&=frac9!cdot 20!30!frac30!21!cdot 9! \
&=frac121
endalign



When handling the sum, the relations $binomnn=binomn+1n+1$ and $binomnr+binomnr+1=binomn+1r+1$ are used.





Great simplification @Yuta. Thanks for your help.
– Dbchatto67
10 hours ago



The question is rather badly posed. "The first white ball" sounds as if it refers to the first white ball drawn, but apparently it's intended to refer to the white ball with the number $1$.



There's indeed a much simpler way to show that the probability of drawing the white ball with the number $1$ before all black balls is $frac121$. Consider the $21$ balls comprising the white ball with the number $1$ and the $20$ black balls. All orders of these $21$ balls are equally likely; in particular, the white ball with the number $1$ is equally likely to be in any of the $21$ positions in this order. Thus the probability for each of the positions, including the first position, is $frac121$.



On how to evaluate your sum, see the hockey-stick identity.





I have calculated my sum in wolfram alpha and found the sum to be exactly $frac 1 21$. Here's the link $:$ wolframalpha.com/widget/…
– Dbchatto67
17 hours ago






@Dbchatto67: That seems to be the wrong link; when I follow it I get $sum_n=1^inftyfrac1n^frac32=zetaleft(frac32right)$.
– joriki
17 hours ago





Oh sorry! I can't share you the exact link of it. But still you can put the $k$-th term and take the limit from $1$ to $10$ in the link for verification.
– Dbchatto67
17 hours ago





@Dbchatto67: The result you need to evaluate that sum is called the hockey-stick identity; I've appended that to the answer.
– joriki
16 hours ago





@joriki Glad to learn the name hockey-stick identity!
– Yuta
16 hours ago



Your expression $sum_k=1^10frac9!(30-k)!30!(10-k)!$ can be rewritten as $frac9!20!30!sum_k=1^10binom30-k20$. Now $binom30-k20$ is the number of ways to choose $21$ numbers from $1,ldots,30$ with the first being $k$ (because the remaining $20$ numbers must be chosen from the $30-k$ numbers after $k$), so summing this over all possible values of the first number chosen (which must be in the range 1-10) gives all ways to choose $21$ numbers from $30$. Thus $sum_k=1^10binom30-k20=binom3021=frac30!9!21!$, and so the whole expression becomes $frac9!20!30!timesfrac30!9!21!=frac121$.






By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Popular posts from this blog

Firebase Auth - with Email and Password - Check user already registered

Dynamically update html content plain JS

How to determine optimal route across keyboard