 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2017/discrete-mathematics-continuous-mathematics-and-probability/9/b/ii/solution

Var (i = 1 \sum n X_{i}) = i = 1 \sum n Var (X_{i}) + 2 1 \leq i < j \leq n \sum Cov (X_{i}, X_{j}) .

Each distinct unordered pair appears once in the second sum and twice when the full square is expanded. No independence assumption is needed.

 New to topics? Read the docs here!