Chocolate Breaker

You have many chocolate bars of unit length and start breaking each of them into 3 pieces by randomly choosing two points on the bar. What are the average lengths of the shortest, medium, and longest pieces?

If the product of these averages can be expressed as p q \frac pq , where p p and q q are coprime positive integers, give your answer as p + q p+ q .


The answer is 2971.

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.

4 solutions

Mark Hennings
Sep 30, 2017

Relevant wiki: Linearity of Expectation

Let m , μ , M m,\mu,M be the smallest, middle and largest lengths created. Then m + μ + M = 1 m + \mu + M = 1 , so that E [ m ] + E [ μ ] + E [ M ] = 1 \mathbb{E}[m] + \mathbb{E}[\mu] + \mathbb{E}[M] \; = \; 1 Suppose that the two breaks in a bar take places at points x x and y y where x , y x,y are independently and uniformly distributed on [ 0 , 1 ] [0,1] .

The smallest length m m can only take values between 0 0 and 1 3 \tfrac13 . If 0 < u < 1 3 0 < u < \tfrac13 , we have m u m \le u precisely when either x u x \le u , y u y \le u , x 1 u x \ge 1-u , y 1 u y \ge 1-u or else x y u |x-y| \le u . Considering the first diagram we see that m u m \le u precisely when ( x , y ) (x,y) lies outside the yellow region. Thus F m ( u ) = P [ m u ] = 1 ( 1 3 u ) 2 0 u 1 3 F_m(u) \; = \; \mathbb{P}[m \le u] \; = \; 1 - (1 - 3u)^2 \hspace{2cm} 0 \le u \le \tfrac13 so that m m has probability density function f m ( u ) = { 6 ( 1 3 u ) 0 u 1 3 0 o.w. f_m(u) \; = \; \left\{ \begin{array}{lll} 6(1-3u) & \hspace{1cm} & 0 \le u \le \tfrac13 \\ 0 & & \mbox{o.w.} \end{array} \right. Thus we have E [ m ] = 0 1 3 6 u ( 1 3 u ) d u = 1 9 \mathbb{E}[m] \; = \; \int_0^{\frac13} 6u(1-3u)\,du \; = \; \tfrac19

The largest length M M can only take values between 1 3 \tfrac13 and 1 1 . If 1 3 < u < 1 \tfrac13 < u < 1 we have M u M \ge u when either both x , y 1 u x,y \le 1-u , both x , y u x,y \ge u or else x y u |x-y| \ge u . Looking at the second and third pictures, this means that M u M \le u when ( x , y ) (x,y) lies in the indicated yellow regions, and hence F M ( u ) = P [ M u ] = { ( 3 u 1 ) 2 1 3 < u < 1 2 1 3 ( 1 u ) 2 1 2 < u < 1 F_M(u) \; = \; \mathbb{P}[M \le u] \; = \; \left\{ \begin{array}{lll} (3u-1)^2 & \hspace{1cm} & \tfrac13 < u < \tfrac12 \\ 1 - 3(1-u)^2 & & \tfrac12 < u < 1 \end{array}\right. so that M M has probability density function f M ( u ) = { 6 ( 3 u 1 ) 1 3 < u < 1 2 6 ( 1 u ) 1 2 < u < 1 0 o.w. f_M(u) \; =\; \left\{ \begin{array}{lll} 6(3u-1) & \hspace{1cm} & \tfrac13 < u < \tfrac12 \\ 6(1-u) & & \tfrac12 < u < 1 \\ 0 & & \mbox{o.w.} \end{array} \right. so that E [ M ] = 1 3 1 2 6 u ( 3 u 1 ) d u + 1 2 1 6 u ( 1 u ) d u = 11 18 \mathbb{E}[M] \; = \; \int_{\frac13}^{\frac12} 6u(3u-1)\,du + \int_{\frac12}^1 6u(1-u)\,du \; = \; \tfrac{11}{18} and hence E [ μ ] = 1 1 9 11 18 = 5 18 \mathbb{E}[\mu] \; = \; 1 - \tfrac19 - \tfrac{11}{18} \; =\; \tfrac{5}{18} and so E [ m ] × E [ μ ] × E [ M ] = 1 9 × 5 18 × 11 18 = 55 2916 \mathbb{E}[m] \times \mathbb{E}[\mu] \times \mathbb{E}[M] \; = \; \tfrac19 \times \tfrac{5}{18} \times \tfrac{11}{18} \; = \; \tfrac{55}{2916} making the answer 55 + 2916 = 2971 55 + 2916 = \boxed{2971} .

What is u?

Denis Evstratenko - 1 year, 12 months ago

Log in to reply

A dummy variable. Your question is like asking”what is x x ?” In the formula f ( x ) = x 2 f(x)=x^2 .

Mark Hennings - 1 year, 12 months ago

Got it, thank you!

Denis Evstratenko - 1 year, 11 months ago
Borut Levart
Sep 28, 2017

Relevant wiki: Geometric Probability

Let S S , M M , and L L be random variables that represent lengths of the smallest, medium-sized and largest piece, and let X X and Y Y represent breaking points. Without loss of generality, we can say X < Y X < Y and reduce the probability space of possible breaking outcomes ( X , Y ) (X, Y) to the region above the line Y = X Y = X . Mind that this effectively doubles any probability calculation (see Conditional Probability ).

Let us first say that the smallest piece occurs on the left, so S = X S = X . You can adapt the logic below for the middle ( S = Y X S = Y - X ) and right ( S = 1 Y S = 1 - Y ) place, and you will see that i) the chance that the smallest piece is anywhere along the stick is even, and ii) no matter where it is, the average length is the same. If the smallest piece occurs on the left though, the following holds:

( X < Y X ) ( X < 1 Y ) \Big( X < Y - X \Big) \land \Big( X < 1 - Y \Big)

This region is depicted dark green on the left. Since E [ S ] = E [ X ] \mathbb{E}[S] = \mathbb{E}[X] , we have to find the x-coordinate of the geometric center of that triangle. In a general triangle, center is at one third along the median, which means E [ S ] = 1 9 E[S] = \frac{1}{9} in this case. Result is the same if the smallest piece occurs in the middle (lighter green) or on the right (still lighter green). You may want to verify this.

How about the medium-sized piece? Let it first occur on the left. This means M = X M = X and:

( X > Y X X < 1 Y ) ( X < Y X X > 1 Y ) \Big( X > Y - X \land X < 1 - Y \Big) \lor \Big( X < Y - X \land X > 1 - Y \Big)

This is depicted dark violet in the middle. Lighter region denotes the middle piece, and still lighter region denotes the right piece. Calculating the x-coordinate of the centroid of the dark violet region (comprising of two disjoint parts) determines E [ M ] = 5 18 \mathbb{E}[M] = \frac{5}{18} . Note that in the case of the middle piece, one should calculate both centroid coordinates since then E [ M ] = E [ Y X ] \mathbb{E}[M] = \mathbb{E}[Y - X] . But one would be better off, as Mark Hennings has noted in his solution, finding E [ L ] \mathbb{E}[L] first and using the fact that there are exactly three pieces, so M = 1 ( L + S ) M = 1 - (L + S) , and by linearity of expectation E [ M ] = 1 ( E [ L ] + E [ S ] ) \mathbb{E}[M] = 1 - (\mathbb{E}[L] + \mathbb{E}[S]) . In short, find centroid for each of any two pieces at any place, and use identity for the third piece.

Arjen Vreugdenhil
Oct 11, 2017

My solution is not significantly different from the others posted here. Note that a bit of symmetry can be added by letting x x = length of left piece, y y = length of right piece. The possible situations are then limited by x + y 1 x + y \leq 1 , and without loss of generality we can limit ourselves to x < y x < y .

I, too, did some graphing. The red, blue, green lines correspond to the smallest, medium, and longest piece. Enjoy.

Let x x be the length of the small chocolate piece and y y be the length of the medium chocolate piece. The following are constraints on x x and y y .

  • 0 < x < 1 0 < x < 1 and 0 < y < 1 0 < y < 1

  • x y x \leq y . This ensures that the medium piece is at least as large as the small piece.

  • y 1 x y y \leq 1 - x - y . This ensures that the large piece is at least as large as the medium piece.

Through some algebra, we conclude that the region on the xy-plane which satisfies these constraints are x y 1 x 2 { 1 3 x 0 } x\le y\le\frac{1-x}{2}\left\{\frac{1}{3}\ge x\ge0\right\} . The region is a triangle with base 1 2 \frac{1}{2} , height 1 3 \frac{1}{3} , and area A = 1 12 A = \frac{1}{12} .

Let s = E [ x ] s = E[x] , m = E [ y ] m = E[y] , l = E [ 1 x y ] = 1 E [ x ] E [ y ] l = E[1 - x - y] = 1 - E[x] - E[y] . Then s = 0 1 3 x 1 x 2 x d y d x A = 1 9 s = \displaystyle \frac{\int_{0}^{\frac{1}{3}}\int_{x}^{\frac{1-x}{2}}xdydx}{A} = \frac{1}{9} , m = 0 1 3 x 1 x 2 y d y d x A = 5 18 m = \displaystyle \frac{\int_{0}^{\frac{1}{3}}\int_{x}^{\frac{1-x}{2}}ydydx}{A} = \frac{5}{18} , and l = 1 s m = 11 18 \displaystyle l = 1 - s - m = \frac{11}{18} . Finally, s m l = 55 2916 s \cdot m \cdot l = \frac{55}{2916} meaning that the answer to the problem is 55 + 2916 = 2971 55 + 2916 = \boxed{2971}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...