Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This is a problem from Feller's book introduction to probability theory and its application, Vol 1, Chap 3 problem 3.

Let $a$ and $b$ be positive, and $-b <c<a$. Prove the number of paths to the point $(n,c)$ which meet neither the line $x=-b$ nor $x=a$ is given by the series $$\tag1 \sum_{k={-\infty}}^{\infty} (N_{n,4k(a+b)+c}-N_{n,4k(a+b)+2a-c})$$ where $N_{n,k}$ is the number of paths going from origin to point $(n,k)$ and only finitely many terms in $(1)$ are non-zero.

The hint suggests to use the reflection repeatedly, but why $4k(a+b)+c$ not $2k(a+b)+c$ ? Is this a typo in the problem?

share|cite|improve this question
I haven't looked at your problem but Feller's texts both volumes as brilliant as they are are load with little errors. So my apriori guess based on that knowledge is that you could be right@ – Michael Chernick Sep 8 '12 at 0:35

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.