This question already has an answer here:
- Symmetric random walk with bounds 1 answer
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?
Thanks in advance, Claus