Past exam of the mathematics course of the University of Cambridge / 2022 / ib / Paper 2 / 18H / c / Solution

The pair $Z_n=(X_n,Y_n)$ is an irreducible positive recurrent product Markov chain with stationary distributionThe stationary cycle occupation formula says that, during one return cycle to a state $z$, the expected number of visits to a set $A$ is $\Pi (A)/\Pi (z)$. TakeThenThe initial and terminal states both have $Y=0$, so either convention for including the endpoints gives the same count. Thus

Solved by gpt-5.6-sol high.