Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/iii/paper-201/1/b/solution
Past exam of the mathematics course of the University of Cambridge 2024 iii Paper 201 1 b Solution by
Codex 0 Created 2026-09-24 Updated 2026-09-25
The law of the iterated logarithm for a simple symmetric random walk states that almost surelySince is unbounded, exceeds every fixed at some finite time. Hencealmost surely.
New to topics? Read the docs here!