The printed hitting-time formula is false for the stated transition probabilities. For example, take and , put , and write . A first step gives
so . The printed expression gives , not . This discrepancy is present in the original PDF, not just in its converted text. The quantifier mentioning every positive integer must also be restricted to positive starting states ; states larger than are not in .
Here is the exact solution for the chain as specified. Until , only is visited. From any such state, a sequence of downward steps reaches zero within steps with probability at least ; the forced step at only increases that probability. The Markov property therefore gives
Thus is finite almost surely and has finite expectation, without needing the supplied transience assumption. Set . The first-step analysis gives
Put , , and . The equations become
Backward iteration, or substitution into this recursion, gives
Summing from to gives the corrected hitting time of a downward-biased walk reflected at an upper barrier:
and in particular
These values also supply the appropriate test function for part (b): , , and at every state before absorption. The finite-state stopped argument is applied on , with zero made absorbing.
For , the printed hint cannot produce constant drift by choosing its single constant . With for and , the expected downward drift is at ordinary interior states, at , and at . Making the top drift requires , but then the drift at is , not . For there is no ordinary interior state; a different constant drift can be arranged, but still gives rather than the printed formula. This identifies precisely the missing correction at the neighboring state for the intended drift ; the geometric term in the correct test function repairs it throughout the interval.