IDY in < oo and lim - Yn < 0o. Prove that lim,+ 1. Let In > 0. Yn > 0 such that lim,- Yn) < lim,-- In lim,+ Yn: i tn < oo and lim yn < . Prove that lim. In 1. Let In 20, yn 0 such that lim Yn) < limn+In lim + Yr
2. Let (sn) be a sequence. (a) Prove that limn→oo8n = 0 if and only if lim, (b) Is the following statement true: Innn +oosn-s if and only if limn-o ls,1 = Isl. 18ml = 0. du.
, then n lim Let Ά be a square matrix. Prove that if ρ(A)<1 Use the following fact without proof. For any square matrix A and any positive real number ε , there exists a natural matrix norm I l such that l-4 ll < ρ (d) +ε IIA" 11-0
3n+3 3 (i.e. let &>0 and determine a n, to satisfy the definition of convergence.) Prove that lim n5n+5 5 Also, show, using algebraic evidence, that it is an increasing sequence.
1. Let n,m e N with n > 0. Prove that there exist unique non-negative integers a, ..., an with a: < 0+1 for all 1 Si<n such that m- Hint:(Show existence and uniqueness of a s.t. () <m<("), and use induction)
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
(2) Let r1 1 and -(-) 1 (n+1)2 = I+ur (a) Show that lim,, T, exists. (b) Prove that z, #t1 by induction and find the limit.
part (c) 7.23. Let y(x) = n²x e-nx. (a) Show that lim, - fn(x)=0 for all x > 0. (Hint: Treat x = 0 as for x > 0 you can use L'Hospital's rule (Theorem A.11) - but remember that n is the variable, not x.) (b) Find lim - So fn(x)dx. (Hint: The answer is not 0.) (c) Why doesn't your answer to part (b) violate Proposition 7.27 Proposition 7.27. Suppose f. : G C is continuous, for n...
(6) Let A denote an m x n matrix. Prove that rank A < 1 if and only if A = BC. Where B is an m x 1 matrix and C is a 1 xn matrix. Solution (7) Do the following: (a) Use proof by induction to find a formula for for all positive integers n and for alld E R. Solution ... 2 for all positive (b) Find a closed formula for each entry of A" where A...
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