← Complete problem index

PROJECT EULER · #0969

Kangaroo Hopping

Statement only · SolvedOriginal problem ↗

Starting at zero, a kangaroo hops along the real number line in the positive direction. Each successive hop takes the kangaroo forward a uniformly random distance between 0 and 1. Let H(n) be the expected number of hops needed for the kangaroo to pass n on the real line.

If we write α=H(1), then for all positive integers n, H(n) can be expressed as a polynomial function of α with rational coefficients. For example H(3)=α32α2+12α. Define S(n) to be the sum of all integer coefficients in this polynomial form of H(n). Therefore S(1)=1 and S(3)=1+(2)=1.
You are also given n=110S(n)=43.
Find n=11018S(n). Give your answer modulo 109+7.

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.