Hint for the gambler's ruin problem. To prove a number to be finite, it is not always necessary to evaluate it, but only to find an upper bound. There is more than one way to work the problem. One way is to prove and then use the following lemma: The probability that A will be ruined in a steps is 2-a. You also need the lemma that if a positive series is bounded by a monotone decreasing exponential series, then it converges; which is a standard lemma from real analysis. This is different from the approach I suggested in class. In that approach, you define p(t) to be the probability that the game has still not ended after t steps. You then prove that, for any t, p(t+a+b) is less than or equal to C p(t), where C is a constant less than 1. Then use standard lemmas from real analysis.