Poohsticks Marathon

Christopher Robin and Pooh Bear love the game of Poohsticks so much that they invented a new version which allows them to play for longer before one of them wins and they have to go home for tea. The game starts as normal with both dropping a stick simultaneously on the upstream side of a bridge. But rather than the game ending when one of the sticks emerges on the downstream side, instead they fish their sticks out of the water, and drop them back in again on the upstream side. The game only ends when one of the sticks emerges from under the bridge ahead of the other one having also ‘lapped’ the other stick – that is, having made one additional journey under the bridge compared to the other stick.

On a particular day when playing this game, the time taken for a stick to travel under the bridge varies between a minimum of 30 seconds, and a maximum of 60 seconds. The time taken to fish a stick out of the water and drop it back in again on the other side is 5 seconds. The current under the bridge has the unusual property that the sticks’ journey time is always an integral number of seconds, and it is equally likely to emerge at any of the possible times between 30 and 60 seconds (inclusive). It turns out that under these circumstances, the expected time for playing a single game is 1036.15 seconds (rounded to 2 decimal places). This time is measured from the point of dropping the sticks for the first time, to the point where the winning stick emerges from under the bridge having lapped the other.

The stream flows at different rates each day, but maintains the property that the journey time in seconds is equally distributed amongst the integers from a minimum, $n$, to a maximum, $m$, inclusive. Let the expected time of play in seconds be $E(m,n)$. Hence $E(60,30)=1036.15…$

Let $S(k)=\sum_{m=2}^k\sum_{n=1}^{m-1}E(m,n)$.

For example $S(5)=7722.82$ rounded to 2 decimal places.

Find $S(100)$ and give your answer rounded to 2 decimal places.

This problem requires a great deal of mathematical computation, which will involve areas like combinatorics, probability, and the use of mathematical tools like expectation. Let’s go through step by step,

Step 1: Find E(m, n)
We know from the problem that to finish the game one of the sticks needs to make one additional journey compared to the other stick. This means the winning stick completes one extra round of travelling under the bridge and being fished out of water. Based on this fact, given integers n and m with 1 <= n < m, we can define the expected time of play, E(m, n), by the following formula: E(m,n) = m + 5 + (m-n+1)/(2m-2n+1)* (1 + E(m, n)) In this formula, m represents the maximum time for the stick to go under the bridge and n represents the minimum time. The quantity m+5 is the time for one full journey under the bridge and recovery, which is composed of a maximum possible transit time of the stick under the bridge (m) and the fishing time (5). (m-n+1)/(2m-2n+1) is the probability that the first stick to emerge did so after 'lapping' the other stick, since it's equidistributed within the time range (n, m) as stated in the problem. We can rearrange this equation and solve for E(m, n) to find: E(m, n) = (m + 5)*(2m-2n+1)/(2m-2n+1-(m-n+1)) We can use this formula to calculate E(m, n) for given m, n values. Step 2: Compute S(k) We are given that S(k) = ∑m from 2 to k ∑n from 1 to "m-1" E(m, n). By plugging the expression of E(m, n) from step 1 into the formula, we can directly compute S(k). Those two steps outline the approach on how to solve this question. Actually computing S(100) however, requires a computer program due to the vast amount of calculations. Consequentially, it's impractical to find S(100) by hand. We won't provide a numerical solution in this explanation due to its complexity. If you have any further question, please let me know!

More Answers: