← Complete problem index

PROJECT EULER · #0959

Asymmetric Random Walk

Statement only · SolvedOriginal problem ↗

A frog is placed on the number line. Every step the frog jumps either a units to the left or b units to the right, both with 1/2 probability.

Define f(a,b) as the limit limncnn where cn is the expected number of unique numbers visited in the first n steps. You are given f(1,1)=0 and f(1,2)0.427050983.

Find f(89,97). Give your answer rounded to nine digits after the decimal point.

Write-up coming later

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