Starting with a line segment of length 1, randomly split it somewhere along its length into two parts. Compute the product of these two lengths. Then take each of the two resulting segments and repeat the process. That is, for each one, randomly split it somewhere along its length into two parts and compute the product. Then do this for all four resulting segments, then the eight after that, and the 16 after that, and so on.
After doing this (forever), you add up all the products you computed throughout. On average, what value would you expect this sum to approach?
There is nothing magical about the initial value of the line segment, that is, 1, so let's instead generalize and say that the function f:R+→R+ gives the expected value of the sum of the products of randomly splitting a line segment of initial length ℓ∈R+ into two parts, then breaking each of those segments into two parts, etc. Then to restate the question, we want the value of f(1).
We can approximate f by not allowing for infinite recursion, but instead just a finite number of breaking into smaller pieces. If we just have one splitting then we get the expected value of the product is f1(ℓ)=∫ℓ0x(ℓ−x)dx=[ℓx22−x33]ℓ0=ℓ36. Going one step further, we then see that after two splits, we add in the expected product of two uniformly random numbers that add up to x and the expected product of two uniformly random numbers that add up to ℓ−x. That is, we get f2(ℓ)=∫ℓ0x(ℓ−x)+f1(x)+f1(ℓ−x)dx=f1(ℓ)+2∫ℓ0f1(x)dx. Similarly, if we keep going with more recursion, we get that the expected sum of the products after n+1 rounds of splitting is given by fn+1(ℓ)=f1(ℓ)+2∫ℓ0fn(x)dx, for n≥1. As n→∞, we get that we must have f(ℓ)=f1(ℓ)+2∫ℓ0f(x)dx=ℓ36+∫ℓ0f(x)dx. Differentiating both sides with respect to ℓ, we get the differential equation f′(ℓ)=t22+2f(ℓ), with initial conditions f(0)=0. This is solved by the generic form f(ℓ)=Ce2ℓ+p(ℓ), where p is a polynomial, say p(t)=at2+bt+c. Plugging back into the differential equation we get that 2at+b=t22+2at2+2bt+2c, for all t. By gathering like terms and setting equal to zero, we get 2a+12=02b−2a=02c−b=0, that is a=b=−14 and c=−18. Additionally, we have f(0)=C−18=0, so C=18. So finally, we see that f(ℓ)=e2ℓ−2ℓ2−2ℓ−18, and so the expected value of the sum of the products of random splitting into two subparts is f(1)=e2−58≈0.29863201236.....
But wait ... there's more, what if as opposed to two pieces, each time we randomly split, we split into three pieces. Let g:R+→R+ be the expected value of the sum of the random triple products of splitting a line segement of initial length ℓ∈R+. Here too we can demonstrate the recurrence with a few small number of splits.
We see that after one splitting we get g1(ℓ)=∫ℓ0∫ℓ−x0xy(ℓ−x−y)dydx=∫ℓ0xf1(ℓ−x)dx=∫ℓ0x(ℓ−x)36dx=ℓ5120. If we again split each piece into three then after two splittings we have the original value of original splitting, followed by the expected product of three uniformly random numbers that add up to x, the expected product of three random numbers that add up to y, and the expected product of three random numbers that add up to ℓ−x−y. That is, g2(ℓ)=∫ℓ0∫ℓ−x0xy(ℓ−x−y)+g1(x)+g1(y)+g1(ℓ−x−y)dydx=g1(ℓ)+3∫ℓ0(ℓ−x)g1(x)dx. In fact, this relation holds for any arbitrary number of splits, n≥1, that is gn+1(ℓ)=g1(ℓ)+3∫ℓ0(ℓ−x)gn(x)dx and in particular as n→∞ we get g(ℓ)=ℓ5120+3∫ℓ0(ℓ−x)g(x)dx.
Let's define the integral of g to be G(ℓ)=∫ℓ0g(x)dx. Differentiating under the integral sign with respect to ℓ, we get g′(ℓ)=ℓ424+3∫ℓ0g(x)dx=ℓ424+3G(ℓ). Differentiating once more gives the second order inhomogeneous differential equation g′′(ℓ)−3g(ℓ)=ℓ36, where g(0)=g′(0)=0. This is solved by a function of the form g(ℓ)=Csinh(√3ℓ)+p(ℓ), where p is a polynoial, say p(t)=at3+bt2+ct+d. Plugging back into the differential equation we get 6at+2b−3(at3+bt2+ct+d)=t36, for all t. By gathering terms and setting equal to zero, we get −3a=16b=06a−3c=02b−3d=0, that is a=−118,b=d=0, and c=−19. Additionally, we have g′(0)=√3C−19=0, so C=√327. So finally, we see that g(ℓ)=2√3sinh(√3ℓ)−3ℓ3−6ℓ54, and so the expected value of the sum of the triple products of random splittings into three subparts is g(1)=2√3sinh(√3)−954≈0.00895406261852....