Before you, Brilli the Ant places 2013 urns labelled 1 through 2013. In urn i , there are i − 1 white balls and 2 0 1 3 − 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 b a , where a and b are positive coprime integers. What is the value of a + b ?
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.
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: 7 1 = 1 4 2
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.
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.
Use of hockey stick identity!
Here is a general solution. Let n be the number of balls per urn, so that there are n + 1 urns in total. Let m be the number of balls we select, and P white be the probability of choosing m balls in a row and having them be all white.
For an urn with j ≥ m white balls, there are ( m n ) ways of choosing m balls, of which ( m j ) of those feature all balls being white. For urns with fewer white balls there are no ways of picking m white balls.
Averaging this over all urns gives: P white = n + 1 1 j = m ∑ n ( ( m j ) / ( m n ) ) = n + 1 1 ( m n ) 1 j = m ∑ n ( m j ) = n + 1 1 ( m n ) 1 ( m + 1 n + 1 ) = n + 1 1 n ! m ! ( n − m ) ! ( m + 1 ) ! ( n − m ) ! ( n + 1 ) ! = m + 1 1 where the third step comes from Pascal's Christmas Stocking, and can easily be proven by induction considering that ( m + 1 n + 1 ) = ( m n ) + ( m + 1 n ) , i.e. the sum of the two entries above it in Pascal's Triangle.
Surprisingly the result only depends on m . For this actual problem where m = 1 3 , and we want to double the answer since we want the probability of white added to the probability of black, we get 1 4 2 , or 7 1 .
Let P ( i ) denote the probability that we would get 13 balls of same colour from urn i . We know that we can either select 1 3 white balls out of i − 1 white balls or we can select 1 3 black balls from 2 0 1 3 − i black balls.
⇒ P ( i ) = ( 1 3 2 0 1 2 ) ( 1 3 i − 1 ) + ( 1 3 2 0 1 3 − i )
By Baye's theorem, required probability = 2 0 1 3 1 1 = 1 ∑ 2 0 1 3 P ( i )
= 2 0 1 3 1 1 = 1 ∑ 2 0 1 3 ( 1 3 2 0 1 2 ) ( 1 3 i − 1 ) + ( 1 3 2 0 1 3 − i ) (Note that ( 1 3 6 ) = 0 )
= 2 0 1 3 1 ( 1 3 2 0 1 2 ) 2 ( 1 4 2 0 1 3 )
= 7 1 ⇒ a + b = 8
By experimentation with smaller numbers of urns and balls ( 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 / 1 4 = 1 / 7 1 + 7 = 8
Does anyone have reasoning on why the number of urns doesn't matter?
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.
This is not a proof but it gave me the right answer.
Log in to reply
Great insight!
Now think about why it is true, and why the answer is b + 1 2 .
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 T S . There are 2013 urns, and ( 1 3 2 0 1 2 ) ways to select 13 balls from an urn of i − 1 + 2 0 1 3 + i = 2 0 1 2 balls, so T = 2 0 1 3 ( 1 3 2 0 1 2 ) . 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 . There are ( 1 3 1 3 ) ways to select 13 white balls from urn 14, ( 1 3 1 4 ) ways to select 13 white balls from urn 15, all the way up to ( 1 3 2 0 1 2 ) ways for urn 2013. We are looking for ∑ i = 1 4 2 0 1 3 ( 1 3 i − 1 ) , which by the hockey stick identity, is ( 1 4 2 0 1 3 ) . By the same process, B = ( 1 4 2 0 1 3 ) as well. Therefore, S = 2 ( 1 4 2 0 1 3 ) , so T S = 2 0 1 3 ( 1 3 2 0 1 2 ) 2 ( 1 4 2 0 1 3 ) = 2 0 1 3 ∗ 1 4 2 ∗ 2 0 1 3 = 7 1 , so a + b = 8
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 3 2 0 1 2 ) 1 times
( 1 3 2 0 1 2 ) + . . . + ( ( 1 3 1 9 9 9 ) + ( 1 3 1 3 ) ) + . . . + ( ( 1 3 1 3 ) + ( 1 3 1 9 9 9 ) ) + . . . + ( 1 3 2 0 1 2 )
Now we see that the mess on top can be simplified with the hockey stick identity.
It simplifies into 2 × ( 1 4 2 0 1 3 ) .
We have a 2 0 1 3 1 chance of choosing a specific urn
Bringing everything together we get 2 0 1 3 2 × ( 1 3 2 0 1 2 ) ( 1 4 2 0 1 3 ) = 7 1
1 + 7 = 8
Problem Loading...
Note Loading...
Set Loading...
For 1 ≤ i ≤ 1 3 , we have the probability of getting 13 balls to be ( 1 3 2 0 1 2 ) ( 1 3 2 0 1 3 − i ) (choosing from the 2 0 1 3 − i black balls), while for 2 0 0 1 ≤ i ≤ 2 0 1 3 , we have the probability to be ( 1 3 2 0 1 2 ) ( 1 3 i − 1 ) (Choosing from the i − 1 white balls).
Adding up the probabilities in these ranges gives us:
( 1 3 2 0 1 2 ) i = 1 ∑ 1 3 ( 1 3 2 0 1 3 − i ) + i = 2 0 0 1 ∑ 2 0 1 3 ( 1 3 i − 1 ) = 2 ∗ ( 1 3 2 0 1 2 ) i = 1 ∑ 1 3 ( 1 3 2 0 1 3 − i )
(Note that the 2 summations are equivalent).
Note that adding ( 1 4 2 0 0 0 ) to i = 1 ∑ 1 3 ( 1 3 2 0 1 3 − i ) gives us ( 1 4 2 0 1 3 ) , so the above summation is equivalent to 2 ∗ ( 1 3 2 0 1 2 ) ( 1 4 2 0 1 3 ) − ( 1 4 2 0 0 0 )
For 1 4 ≤ i ≤ 2 0 0 0 , we have the probability of getting 13 balls to be ( 1 3 2 0 1 2 ) ( 1 3 2 0 1 3 − i ) + ( 1 3 i − 1 ) (choosing from the 2 0 1 3 − i black balls or the i − 1 white balls)
Adding up the probabilities in this range then gives us:
( 1 3 2 0 1 2 ) i = 1 4 ∑ 2 0 0 0 ( 1 3 2 0 1 3 − i ) + i = 1 4 ∑ 2 0 0 0 ( 1 3 i − 1 ) = 2 ∗ ( 1 3 2 0 1 2 ) i = 1 3 ∑ 1 9 9 9 ( 1 3 i ) = 2 ∗ ( 1 3 2 0 1 2 ) ( 1 4 2 0 0 0 )
(Firstly, the two summations are equivalent and secondly, i = 1 4 ∑ 2 0 0 0 ( 1 3 i − 1 ) = i = 1 3 ∑ 1 9 9 9 ( 1 3 i ) )
Adding up all the probabilities for 1 ≤ i ≤ 2 0 1 3 , we then get:
2 ∗ ( 1 3 2 0 1 2 ) ( 1 4 2 0 1 3 ) − ( 1 4 2 0 0 0 ) + 2 ∗ ( 1 3 2 0 1 2 ) ( 1 4 2 0 0 0 ) = 2 ∗ ( 1 3 2 0 1 2 ) ( 1 4 2 0 1 3 ) = 2 ∗ 1 4 2 0 1 3 = 7 2 0 1 3
Dividing the total sum of the probabilities above by 2 0 1 3 , we have the expected probability that the 13 balls taken are all the same colour is then 7 1 . The sum of the reduced fraction's numerator and denominator is then 1 + 7 = 8