MathDB
2018 CHMMC Tiebreaker 1 - infinitely many lily numbered pads

Source:

March 2, 2024
combinatoricsCHMMC

Problem Statement

A large pond contains infinitely many lily pads labelled 11, 22, 33,... ... , placed in a line, where for each kk, lily pad k+1k + 1 is one unit to the right of lily pad kk. A frog starts at lily pad 100100. Each minute, if the frog is at lily pad nn, it hops to lily pad n+1n + 1 with probability n1n\frac{n-1}{n} , and hops all the way back to lily pad 11 with probability 1n\frac{1}{n}. Let NN be the position of the frog after 10001000 minutes. What is the expected value of NN?