Question #35202

On a tiny remote island where the death sentence still exists a man can be granted mercy after receiving the death sentence
He is given 18 red balls and 6 green balls
He must divide them between 3 boxes with at least one ball in each
He is blindfolded and must choose a box at random and then a single ball from within the box
He only receives mercy if a red ball is chosen
Find the probability that he recieves mercy when he distributes the balls in the most favourable mannor
1

Expert's answer

2013-09-19T08:42:47-0400

Task:

On a tiny remote island where the death sentence still exists a man can be granted mercy after receiving the death sentence

He is given 18 red balls and 6 green balls

He must divide them between 3 boxes with at least one ball in each

He is blindfolded and must choose a box at random and then a single ball from within the box. He only receives mercy if a red ball is chosen

Find the probability that he receives mercy when he distributes the balls in the most favorable manner.

Solution:

Suppose that a man placed r1,r2r_1, r_2 and r3r_3 red balls in the 1st1^{\text{st}}, 2nd2^{\text{nd}} and 3rd3^{\text{rd}} boxes respectively. And g1,g2,g3g_1, g_2, g_3 green balls in the 1st1^{\text{st}}, 2nd2^{\text{nd}} and 3rd3^{\text{rd}} boxes respectively (gi,rig_i, r_i are non-negative whole numbers). We have that

(1) r1+r2+r3=18r_1 + r_2 + r_3 = 18,

(2) g1+g2+g3=6g_1 + g_2 + g_3 = 6.

(3) r1+g2>0,i=1,2,3r_1 + g_2 > 0, i = 1, 2, 3.

Denote a valid distribution as dd, d=d(r1,r2,r3,g1,g2,g3)d = d(r_1, r_2, r_3, g_1, g_2, g_3) is defined by r1,r2,r3,g1,g2,g3r_1, r_2, r_3, g_1, g_2, g_3, for which (1)-(3) are right. The probability that a man receives mercy is P(d)=13r1r1+g1+13r2r2+g2+13r3r3+g3=13(r1r1+g1+r2r2+g2+r3r3+g3)P(d) = \frac{1}{3} \frac{r_1}{r_1 + g_1} + \frac{1}{3} \frac{r_2}{r_2 + g_2} + \frac{1}{3} \frac{r_3}{r_3 + g_3} = \frac{1}{3} \left( \frac{r_1}{r_1 + g_1} + \frac{r_2}{r_2 + g_2} + \frac{r_3}{r_3 + g_3} \right).

Call the balls distribution d0d_0 optimal if P(d0)=maxdP(d)=P0P(d_0) = \max_d P(d) = P_0.

Then

1) P01011P_0 \geq \frac{10}{11}. Proof: P0P(d(16,1,1,6,0,0))=13(1616+6+11+0+11+0)=13(811+2)=130311=1011P_0 \geq P(d(16, 1, 1, 6, 0, 0)) = \frac{1}{3} \left( \frac{16}{16 + 6} + \frac{1}{1 + 0} + \frac{1}{1 + 0} \right) = \frac{1}{3} \left( \frac{8}{11} + 2 \right) = \frac{130}{311} = \frac{10}{11}.

2) r1,r2,r31r_1, r_2, r_3 \geq 1, because otherwise P(d0)13(1+1+0)=231011P(d_0) \leq \frac{1}{3} (1 + 1 + 0) = \frac{2}{3} \leq \frac{10}{11}.

3) For 1<ab1 < a \leq b, 1<cd1 < c \leq d, ab+cda+c1b+d1+1\frac{a}{b} + \frac{c}{d} \leq \frac{a + c - 1}{b + d - 1} + 1.

Proof: inequality is equivalent to ab(b+d1)+cd(b+d1)a+b+c+d2\frac{a}{b} (b + d - 1) + \frac{c}{d} (b + d - 1) \leq a + b + c + d - 2

a+adbab+c+cbdcda+b+c+d2ab(d1)+cd(b1)b+d2\begin{array}{l} a + a \frac{d}{b} - \frac{a}{b} + c + c \frac{b}{d} - \frac{c}{d} \leq a + b + c + d - 2 \\ \frac{a}{b} (d - 1) + \frac{c}{d} (b - 1) \leq b + d - 2 \\ \end{array}


But aba \leq b and cdc \leq d, therefore, ab(d1)+cd(b1)d1+b1=b+d2\frac{a}{b} (d - 1) + \frac{c}{d} (b - 1) \leq d - 1 + b - 1 = b + d - 2.

Therefore, ab(d1)+cd(b1)b+d2\frac{a}{b} (d - 1) + \frac{c}{d} (b - 1) \leq b + d - 2 is right and ab+cda+c1b+d1+1\frac{a}{b} + \frac{c}{d} \leq \frac{a + c - 1}{b + d - 1} + 1 is right.

4) Using 3): P(d)=13(r1r1+g1+r2r2+g2+r3r3+g3)13(r1r1+g1+r2+r31r2+g2+r3+g31+1)P(d) = \frac{1}{3} \left( \frac{r_1}{r_1 + g_1} + \frac{r_2}{r_2 + g_2} + \frac{r_3}{r_3 + g_3} \right) \leq \frac{1}{3} \left( \frac{r_1}{r_1 + g_1} + \frac{r_2 + r_3 - 1}{r_2 + g_2 + r_3 + g_3 - 1} + 1 \right) \leq

13(r1+r2+r32r1+g1+r2+g2+r3+g32+2)=13(1616+6+2)=1011.\frac{1}{3} \left( \frac{r_1 + r_2 + r_3 - 2}{r_1 + g_1 + r_2 + g_2 + r_3 + g_3 - 2} + 2 \right) = \frac{1}{3} \left( \frac{16}{16 + 6} + 2 \right) = \frac{10}{11}.


5) 1) and 4) P0=1011\Rightarrow P_0 = \frac{10}{11}.

Answer: 1011\frac{10}{11}.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS