Pick White Marble

You have 50 white marbles and 50 black marbles, and you are allowed to distribute them as you please in two jars. Then you are blindfolded, pick a jar at random, and a marble from that jar.

Over all possible distributions of the marbles in the two jars, suppose that the maximum value of the probability that the marble picked is white is m n \dfrac{m}{n} , where m , n m,n are coprime positive integers. Find m + n m+n .


The answer is 173.

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.

3 solutions

Mark Hennings
Feb 24, 2016

If one jar contains a a white marbles and b b black marbles, then the probability of picking a white marble is f ( a , b ) = 1 2 [ a a + b + 50 a 100 a b ] f(a,b) \; = \; \tfrac12\Big[\frac{a}{a+b} + \frac{50-a}{100-a-b} \Big] provided that 0 < a + b < 100 0 < a+b < 100 . Note that f ( 0 , 0 ) = f ( 50 , 50 ) = 1 4 f(0,0) = f(50,50) = \tfrac14 (when all the balls are in one jar).

If 1 N = a + b 99 1 \le N = a+b \le 99 then f ( a , b ) = f ( a , N a ) = 1 2 [ a N + 50 a 100 N ] = 25 N + ( 50 N ) a N ( 100 N ) f(a,b) \; = \; f(a,N-a) \; = \; \tfrac12\Big[\frac{a}{N} + \frac{50-a}{100-N}\Big] \; = \; \frac{25N + (50-N)a}{N(100-N)} and since the coefficient of a a in the numerator of this fraction is 50 N 50-N , we see that, for fixed N N , f ( a , b ) f(a,b) is maximized by maximizing a a when 1 N 50 1 \le N \le 50 , while f ( a , b ) f(a,b) is maximized by minimizing a a when 51 N 99 51 \le N \le 99 . In other words, m a x a + b = N f ( a , b ) = { f ( N , 0 ) = 75 N 100 N 1 N 50 f ( N 50 , 50 ) = N 25 N 51 N 99 = 25 + 50 N 50 + 50 N \begin{array}{rcl} \displaystyle \mathrm{max}_{a+b=N} f(a,b) & = & \displaystyle \left\{ \begin{array}{lll} f(N,0) \; = \; \frac{75-N}{100-N} & \qquad & 1 \le N \le 50 \\ f(N-50,50) \; = \; \frac{N - 25}{N} & & 51 \le N \le 99 \end{array}\right. \\ & = & \displaystyle \frac{25 + |50-N|}{50 + |50 - N|} \end{array} The symmetry about N = 50 N=50 is to be expected; if one jar contains N N balls, then the other contains 100 N 100-N balls. Anyway (since any of these last probabilities is greater than f ( 0 , 0 ) = f ( 50 , 50 ) f(0,0) = f(50,50) ): m a x 0 a , b 50 f ( a , b ) = m a x 1 N 99 25 + 50 N 50 + 50 N = 74 99 \mathrm{max}_{0 \le a,b \le 50} f(a,b) \; = \; \mathrm{max}_{1 \le N \le 99} \frac{25 + |50-N|}{50 + |50-N|} \; = \; \boxed{\frac{74}{99}} with this largest probability being f ( 1 , 0 ) = f ( 49.50 ) f(1,0) = f(49.50) (with N = 1 N=1 or N = 99 N=99 respectively), so that one jar contains a single white ball, and the other jar all the other balls.

The maximum value of the probability that the marble picked is white is 74 99 \dfrac{74}{99} .

The idea of the proof consists of showing that any other distribution of marbles can be modified to increase the desired probability.

Assume that one jar contains x x white marbles and y y black marbles, and the other one has 50 x 50-x white marbles and 50 y 50-y black marbles. Then, the probability of getting a white marble at the end is given by the following function:

f ( x , y ) = 1 2 . x x + y + 1 2 . 50 x 100 x y f(x,y) = \dfrac{1}{2}.\dfrac{x}{x+y} + \dfrac{1}{2}.\dfrac{50-x}{100-x-y}

We distinguish three cases:

  • Case 1: If both jars contain the same number of white and black marbles ( x = y x=y ) then the probability is 1 2 \dfrac{1}{2} , which is less than 74 99 \dfrac{74}{99} .

  • Case 2: If in each jar the number of white marbles is different from the number of black marbles, then one of the jars will have more white marbles than black marbles, i.e., x > y x>y . Calling u = x y u = x-y we have (after doing some algebra) that the probability is:

f ( x , x u ) = 1 2 + u 4 [ 1 2 x u 1 100 + u 2 x ] f(x,x-u) = \dfrac{1}{2} + \dfrac{u}{4}\left[\dfrac{1}{2x-u}-\dfrac{1}{100+u-2x}\right]

That is a decreasing function in x x . Hence the probability can be increased by moving a white marble and a black marble from that jar to the other. If we keep doing that until no black marbles remain in that jar ( x = u x=u ) we will find ourselves in:

  • Case 3: If one jar contains only white marbles, then the probability is

f ( x , 0 ) = 1 2 + 1 2 + 100 50 x f(x,0) = \dfrac{1}{2} + \dfrac{1}{2 + \dfrac{100}{50 - x}} .

That is also a decreasing function in x x , so by moving white marbles from that jar to the other one the probability will increase, until we end up with a single white marble in that jar and all the other marbles in the other jar, yielding which we claimed to be the maximum probability: f ( 1 , 0 ) = 74 99 f(1,0) = \dfrac{74}{99} .

That exhausts all possible configurations of marbles and ends the proof.

So, m + n = 173 m+n=\boxed{173} .

Fabio Buccoliero
Feb 23, 2016

In order to maximize your probability of picking a white marble you should put only one white marble in a jar and all the other marbles in the other, this is one way to get a probability higher than 50% and in fact is the max probability achievable. So the sought probability is 1 2 + 1 2 × 49 99 = 74 99 \frac{1}{2} + \frac{1}{2} \times \frac{49}{99} = \frac{74}{99} So the solution is 173 \boxed{173}

You need to prove that it is indeed the maximum.

Ivan Koswara - 5 years, 3 months ago

Log in to reply

Do you know the proof?

asad bhai - 5 years, 3 months ago

Log in to reply

I can prove that the probability is smaller than 3/4 (if one bag has probability greater than half, the other is less than half, so the maximum is smaller than 1 2 1 + 1 2 1 2 = 3 4 \frac{1}{2} \cdot 1 + \frac{1}{2} \cdot \frac{1}{2} = \frac{3}{4} ). I think it can be adapted to be more precise.

Ivan Koswara - 5 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...