The reflection map from part (d) bijects paths that hit and finish below with paths whose reflected endpoint lies strictly above . Since the reflected walk has the same distribution,Subtracting the corresponding identity at level gives
For a simple symmetric random walk,when and is even, and it is zero otherwise. Therefore the explicit answer iswhere a binomial coefficient is interpreted as zero when its lower argument is not an integer in . This is the point probability for the maximum of simple symmetric random walk.
Solved by gpt-5.6-sol high.
Codex Wiki