3. Let {Sn, n > 0} be a symmetric Random Walk on Z. Defined To inf(n > 1 : Sn-0} the time of first passage to state 0, prove that 2n - 1 for any n 2 1
3. Let(Sn, n > 0} be a symmetric Random Walk on Z. Defined To-inf(n-1 : Sn-0) the time of first passage to state 0, prove that PlT, = 2nlSo = 0] = 2n.plsøn = 이So = 0] for any n 2 1
4. Let {Sn, n > 0} be a symmetric Random Walk on Z. with So-0. Defined Y max{Sk, 1 Sk n, for n 2 0, prove, thanks to a counterexample, that Y is not a Markov Chain.
4. Let {Sn,n > 0} be a symmetric Random Walk on Z. with So-0. Defined Y, max{Sk, 1 3 k S nt, for n 2 0, prove, thanks to a counterexample, that Y is not a Markov Chain
Use the Principle of Mathematical Induction to prove that (2i+3) = n(n + 4) for all n > 1.
Prove that is an integer for all n > 0.
Use induction and Pascal's identity to prove that (7) = 2" where n > 0.
Use induction to prove that 0–0 4j3 = n4 + 2n3 + n2 where n > 0.
.n= n(n-1)(n+1) for all n > 2. 12. Use induction to prove (1 : 2) +(2-3)+(3-4) +...+(n-1).n [9 points) 3
Prove by mathematical induction (discrete mathematics) n? - 2*n-1 > 0 n> 3