2013C13

Before you, Brilli the Ant places 2013 urns labelled 1 through 2013. In urn i i , there are i 1 i-1 white balls and 2013 i 2013 - i black balls. If you randomly choose an urn, and then randomly choose 13 balls without replacement, the probability that all balls are the same color is a b \frac{a}{b} , where a a and b b are positive coprime integers. What is the value of a + b a + b ?


The answer is 8.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

6 solutions

Jared Low
Oct 14, 2013

For 1 i 13 1\leq i\leq13 , we have the probability of getting 13 balls to be ( 2013 i 13 ) ( 2012 13 ) \frac{{{2013-i} \choose 13}}{{{2012} \choose 13}} (choosing from the 2013 i 2013-i black balls), while for 2001 i 2013 2001\leq i\leq2013 , we have the probability to be ( i 1 13 ) ( 2012 13 ) \frac{{{i-1} \choose 13}} {{2012} \choose 13} (Choosing from the i 1 i-1 white balls).

Adding up the probabilities in these ranges gives us:

i = 1 13 ( 2013 i 13 ) + i = 2001 2013 ( i 1 13 ) ( 2012 13 ) = 2 i = 1 13 ( 2013 i 13 ) ( 2012 13 ) \frac{\displaystyle \sum_{i=1}^{13} {{2013-i} \choose 13}+\displaystyle \sum_{i=2001}^{2013}{{i-1} \choose 13}}{{2012} \choose 13}=2*\frac{\displaystyle \sum_{i=1}^{13} {{2013-i} \choose 13}}{{2012} \choose 13}

(Note that the 2 summations are equivalent).

Note that adding ( 2000 14 ) {{2000}\choose 14} to i = 1 13 ( 2013 i 13 ) \displaystyle \sum_{i=1}^{13} {{2013-i} \choose 13} gives us ( 2013 14 ) {2013}\choose 14 , so the above summation is equivalent to 2 ( 2013 14 ) ( 2000 14 ) ( 2012 13 ) 2*\frac{{{2013}\choose 14}-{{2000}\choose 14}}{{{2012} \choose 13}}

For 14 i 2000 14\leq i \leq 2000 , we have the probability of getting 13 balls to be ( 2013 i 13 ) + ( i 1 13 ) ( 2012 13 ) \frac{{{2013-i} \choose 13}+{{i-1} \choose 13}}{{2012} \choose 13} (choosing from the 2013 i 2013-i black balls or the i 1 i-1 white balls)

Adding up the probabilities in this range then gives us:

i = 14 2000 ( 2013 i 13 ) + i = 14 2000 ( i 1 13 ) ( 2012 13 ) = 2 i = 13 1999 ( i 13 ) ( 2012 13 ) = 2 ( 2000 14 ) ( 2012 13 ) \frac {\displaystyle \sum_{i=14}^{2000} {{2013-i} \choose 13}+\displaystyle \sum_{i=14}^{2000}{{i-1} \choose 13}} {{{2012} \choose 13}}=2*\frac {\displaystyle \sum_{i=13}^{1999} {{i} \choose 13}} {{{2012} \choose 13}}=2*\frac {{{2000} \choose 14}} {{{2012} \choose 13}}

(Firstly, the two summations are equivalent and secondly, i = 14 2000 ( i 1 13 ) = i = 13 1999 ( i 13 ) \displaystyle \sum_{i=14}^{2000}{{i-1} \choose 13}=\displaystyle \sum_{i=13}^{1999} {{i} \choose 13} )

Adding up all the probabilities for 1 i 2013 1 \leq i \leq 2013 , we then get:

2 ( 2013 14 ) ( 2000 14 ) ( 2012 13 ) + 2 ( 2000 14 ) ( 2012 13 ) = 2 ( 2013 14 ) ( 2012 13 ) = 2 2013 14 = 2013 7 2*\frac{ { {2013}\choose 14} -{ {2000} \choose 14} } {{{2012} \choose 13}} + 2*\frac {{{2000} \choose 14}} {{{2012} \choose 13}}=2*\frac{{2013}\choose 14}{{2012}\choose 13}=2*\frac{2013}{14}=\frac{2013}{7}

Dividing the total sum of the probabilities above by 2013 2013 , we have the expected probability that the 13 balls taken are all the same colour is then 1 7 \frac{1}{7} . The sum of the reduced fraction's numerator and denominator is then 1 + 7 = 8 1+7=\fbox{8}

Is there a simpler explanation which doesn't require you to deal with such massive calculations? There should be some reason why the answer is so nice.

Hint: 1 7 = 2 14 \frac{1}{7} = \frac{2}{14}

Calvin Lin Staff - 7 years, 7 months ago

Log in to reply

That massive calculation really isn't that bad. That sum is sometimes known as the hockey stick theorem in pascal's triangle.

Gino Pagano - 7 years, 7 months ago

Log in to reply

I'm not referring to how 'bad' it is, or not. I'm asking for an alternative interpretation, which would allow us to simplify the calculations.

Calvin Lin Staff - 7 years, 7 months ago

Use of hockey stick identity!

A Brilliant Member - 7 years, 7 months ago

Log in to reply

Yup!

Sreejato Bhattacharya - 7 years, 7 months ago
Matt McNabb
Oct 15, 2013

Here is a general solution. Let n n be the number of balls per urn, so that there are n + 1 n+1 urns in total. Let m m be the number of balls we select, and P white P_{\mbox{white}} be the probability of choosing m m balls in a row and having them be all white.

For an urn with j m j \ge m white balls, there are ( n m ) \binom{n}{m} ways of choosing m m balls, of which ( j m ) \binom{j}{m} of those feature all balls being white. For urns with fewer white balls there are no ways of picking m m white balls.

Averaging this over all urns gives: P white = 1 n + 1 j = m n ( ( j m ) / ( n m ) ) = 1 n + 1 1 ( n m ) j = m n ( j m ) = 1 n + 1 1 ( n m ) ( n + 1 m + 1 ) = 1 n + 1 m ! ( n m ) ! n ! ( n + 1 ) ! ( m + 1 ) ! ( n m ) ! = 1 m + 1 \begin{aligned} P_{\mbox{white}} &= {1 \over n+1} \sum_{j=m}^{n} ( \dbinom{j}{m} / \dbinom{n}{m} ) \\ &= {1 \over n+1} {1 \over \binom{n}{m}} \sum_{j=m}^{n} \dbinom{j}{m} \\ &= {1 \over n+1} {1 \over \binom{n}{m}} \dbinom{n+1}{m+1} \\ &= {1 \over n+1} {m!(n-m)! \over n!} {(n+1)! \over (m+1)!(n-m)!} \\ &= {1 \over m+1} \end{aligned} where the third step comes from Pascal's Christmas Stocking, and can easily be proven by induction considering that ( n + 1 m + 1 ) = ( n m ) + ( n m + 1 ) \binom{n+1}{m+1} = \binom{n}{m} + \binom{n}{m+1} , i.e. the sum of the two entries above it in Pascal's Triangle.

Surprisingly the result only depends on m m . For this actual problem where m = 13 m=13 , and we want to double the answer since we want the probability of white added to the probability of black, we get 2 14 2 \over 14 , or 1 7 \boxed{1 \over 7} .

Jatin Yadav
Oct 14, 2013

Let P ( i ) P(i) denote the probability that we would get 13 balls of same colour from urn i i . We know that we can either select 13 13 white balls out of i 1 i - 1 white balls or we can select 13 13 black balls from 2013 i 2013 - i black balls.

\Rightarrow P ( i ) P(i) = ( i 1 13 ) + ( 2013 i 13 ) ( 2012 13 ) \frac{{i - 1 \choose 13} + {2013 - i \choose 13}}{{2012 \choose 13}}

By Baye's theorem, required probability = 1 2013 1 = 1 2013 P ( i ) \frac{1}{2013} \displaystyle \sum_{1 = 1}^{2013} P(i)

= 1 2013 1 = 1 2013 ( i 1 13 ) + ( 2013 i 13 ) ( 2012 13 ) \frac{1}{2013}\displaystyle \sum_{1 = 1}^{2013}\frac{{i - 1 \choose 13} + {2013 - i \choose 13}}{{2012 \choose 13}} (Note that ( 6 13 ) = 0 {6 \choose 13} = 0 )

= 1 2013 2 ( 2013 14 ) ( 2012 13 ) \frac{1}{2013} \frac{2{2013 \choose 14}}{{2012 \choose 13}}

= 1 7 a + b = 8 \frac{1}{7} \Rightarrow a + b = \fbox{8}

Avi Eisenberg
Oct 17, 2013

By experimentation with smaller numbers of urns and balls ( 7 , 3 ) ( 9 , 3 ) ( 7 , 5 ) ( 9 , 5 ) (7,3)(9,3)(7,5)(9,5) I discovered that the number of urns(2013), doesn't matter to the average as long as it is more than the number of balls picked. Therefore, we can look at the average as if there were only 14 urns. Then for the 1st and 14th urns, the probability would be 1, and for the other urns it would be 0. 2 / 14 = 1 / 7 2/14=1/7 1 + 7 = 8 1+7=8

Does anyone have reasoning on why the number of urns doesn't matter?

Daniel Chiu - 7 years, 7 months ago

Log in to reply

Indeed this was what I was hinting at in my initial comment. Here's another hint:

Hint: Use the technique of a distinguished element, to relate this to a problem on 2014 balls.

Calvin Lin Staff - 7 years, 7 months ago

This is not a proof but it gave me the right answer.

Avi Eisenberg - 7 years, 7 months ago

Log in to reply

Great insight!

Now think about why it is true, and why the answer is 2 b + 1 \frac{2}{b+1} .

Calvin Lin Staff - 7 years, 7 months ago
Josh Kennedy
Oct 14, 2013

Let S be the number of ways to pick 13 balls of the same color, and T be the number of ways to choose 13 balls of any color. We are looking for S T \frac{S}{T} . There are 2013 urns, and ( 2012 13 ) {2012 \choose 13} ways to select 13 balls from an urn of i 1 + 2013 + i = 2012 {i-1}+{2013+i}=2012 balls, so T = 2013 ( 2012 13 ) T=2013{2012 \choose 13} . Split S into W, the number of ways to select 13 white balls, and B, the number of ways to select 13 black balls. S = W + B S=W+B . There are ( 13 13 ) {13 \choose 13} ways to select 13 white balls from urn 14, ( 14 13 ) {14 \choose 13} ways to select 13 white balls from urn 15, all the way up to ( 2012 13 ) {2012 \choose 13} ways for urn 2013. We are looking for i = 14 2013 ( i 1 13 ) \sum_{i=14}^{2013}{{i-1 \choose 13}} , which by the hockey stick identity, is ( 2013 14 ) {2013 \choose 14} . By the same process, B = ( 2013 14 ) B={2013 \choose 14} as well. Therefore, S = 2 ( 2013 14 ) S=2{2013 \choose 14} , so S T = 2 ( 2013 14 ) 2013 ( 2012 13 ) = 2 2013 2013 14 = 1 7 \frac{S}{T}=\frac{2{2013 \choose 14}}{2013{2012 \choose 13}}=\frac{2*2013}{2013*14}=\frac{1}{7} , so a + b = 8 a+b=8

Guiping Xie
Oct 13, 2013

Lets write out the first couple terms

Urn 1 = 0 White 2012 Black

Urn 2 = 1 White 2011 Black

Urn 3 = 2 White 2010 Black

Now write the probabilities we get

1 ( 2012 13 ) \frac{1}{{2012 \choose 13}} times

( 2012 13 ) + . . . + ( ( 1999 13 ) + ( 13 13 ) ) + . . . + ( ( 13 13 ) + ( 1999 13 ) ) + . . . + ( 2012 13 ) {2012 \choose 13}+...+({1999 \choose 13}+{13\choose 13})+...+({13 \choose 13}+{1999\choose 13})+...+{2012 \choose 13}

Now we see that the mess on top can be simplified with the hockey stick identity.

It simplifies into 2 × ( 2013 14 ) 2 \times {2013 \choose 14} .

We have a 1 2013 \frac{1}{2013} chance of choosing a specific urn

Bringing everything together we get 2 2013 × ( 2013 14 ) ( 2012 13 ) = 1 7 \frac{2}{2013}\times\frac{{2013 \choose 14}}{{2012 \choose 13}} = \frac{1}{7}

1 + 7 = 8 1+7 = \boxed{8}

Is there a simpler explanation which doesn't require you to deal with such massive calculations? There should be some reason why the answer is so nice.

Hint: 1 7 = 2 14 \frac{1}{7} = \frac{2}{14}

Calvin Lin Staff - 7 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...