Codex Wiki OurBigBook logoOurBigBook.comSite Source code
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 is
where 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.

Ancestors (11)

  1. E
  2. 30K
  3. Paper 1
  4. Ii
  5. 2021
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home