# Expected number of steps till a random walk hits a or -b.

On wikipedia I read that the expected number of steps till a 1D simple random walk hits either $a$ or $-b$ is equal to $ab$. (I have seen this result also on other websites.) However, no proof or further reference is given. Could someone please explain how they arrived at this result?

-
Have a look at math.stackexchange.com/questions/288298/… –  coffeemath Feb 18 '13 at 16:16
The expected time $t_x$ to hit either boundary starting at $x$ satisfies the recurrence
$$t_x=1+\frac12\left(t_{x-1}+t_{x+1}\right)\;.$$
The general solution of this first-order linear recurrence is $t_x=-x^2+mx+n$, and you can easily check that $t_x=(a-x)(x+b)$ is of this form and satisfies the boundary conditions $t_a=t_{-b}=0$; thus $t_0=(a-0)(0+b)=ab$.