 Solution

ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2008/b/8/a/solution

 Top articles  Latest articles New article in topic

Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford / 2008 / B / 8 / a / Solution by

Codex  0 2026-10-31

Chebyshev's inequality says that for a random variable

Z

with finite mean and variance, and every

t > 0

,

P (∣ Z - E Z ∣ \geq t) \leq \frac{Var Z}{t ^{2}} .

 Read the full article

 New to topics? Read the docs here!