This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math136/Stat219 Fall 2009 Sample Final Examination Write your name and sign the Honor code in the blue books provided. You have 3 hours to solve all questions, each worth points as marked (maximum of 100). Complete reasoning is required for full credit. You may cite lecture notes and homework sets, as needed, stating precisely the result you use, why and how it applies. Important note: If you wish to use a result that is contained in an Exercise in the course notes that was not assigned for homework or proved in lecture, you must prove the result yourself (i.e. you cannot just site the Exercise number.) 1. (5x5) Consider a simple, symmetric random walk. That is, let 1 , 2 , . . . be a sequence of independent random variables with P ( k = 1) = P ( k = 1) = 1 / 2 for all k . Let S = 0 and S n = n k =1 k for n = 1 , 2 , . . . . Let F n = ( 1 , . . . , n ). For fixed positive integers a and b let = min { n 0 : S n / ( a, b ) } . You may assume that < a.s....
View
Full
Document
This document was uploaded on 04/12/2010.
 Spring '09
 Math

Click to edit the document details