*MATLAB exercise* So there is an initial vector x = [0.1 0.9]'. The question asks how many time steps is required to achieve accurately the first 3 digits after the decimal for every vector in the steady state vector x. My thought process when thinking about this was to run monte carlo simulations (just x = P*x for every a varying number of loops) and change how many time steps I use. I did this and found that for my P matrix, 1 time step was sufficient. What I don't understand is how this does not vary. Doesn't the number of time steps required mainly rely on what matrix P you use? The question words it so it is assumed almost that P is arbitrary. Thank you