Let (xn) be an irreducible ergodic markov chain on a finite state space. show that xn and xm become independent as n, m → o so that also n – m → o

If g^-1(x) is the inverse of g (x) which statement must be true

Determine the solution for mc001-1.jpeg

Set $r$ is a set of rectangles such that (1) only the grid points shown here are used as vertices, (2) all sides are vertical or horizontal and (3) no two rectangles in the set are congruent. if $r$ contains the maximum possible number of rectangles given these conditions, what fraction of the rectangles in set $r$ are squares? express your answer as a common fraction.