(Step-by-Step) A fair coin is tossed repeatedly with results Y 0 , Y 1 , Y 2 ,... that are 0 and 1 with probability 1 / 2 each. For n ~ 1, let X_n=Y_n+Y_n-1
Question: A fair coin is tossed repeatedly with results Y 0 , Y 1 , Y 2 ,... that are 0 and 1 with probability 1 / 2 each. For n ~ 1, let \({{X}_{n}}={{Y}_{n}}+{{Y}_{n-1}}\) be the number of 1 ' s in the ( n - 1) th toss and n th toss. Is X n a Markov Chain?
Deliverable: Word Document 
![[Solution Library] Consider an irreducible Markov Chain](/images/solutions/MC-solution-library-39444.jpg "[Solution Library] Consider an irreducible Markov Chain with transition")
