Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/iii/paper-201/1/b/solution

The law of the iterated logarithm for a simple symmetric random walk states that almost surely
Since is unbounded, exceeds every fixed at some finite time. Hence
almost surely.

New to topics? Read the docs here!