{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

MIT6_042JF10_rec23

# MIT6_042JF10_rec23 - 6.042/18.062J Mathematics for Computer...

This preview shows pages 1–3. Sign up to view the full content.

6.042/18.062J Mathematics for Computer Science December 8, 2010 Tom Leighton and Marten van Dijk Problems for Recitation 23 Theorem 1. Let E 1 , . . . , E n be events, and let X be the number of these events that occur. Then: Ex ( X ) = Pr { E 1 } + Pr { E 2 } + . . . + Pr { E n } Theorem 2 (Markov’s Inequality) . Let X be a nonnegative random variable. If c > 0 , then: Ex ( X ) Pr { X c } ≤ c Theorem 3 (Chebyshev’s Inequality) . For all x > 0 and any random variable R , Var [ R ] Pr {| R Ex ( R ) | ≥ x } ≤ x 2 Theorem 4 (Union Bound) . For events E 1 , . . . , E n : Pr { E 1 . . . E n } ≤ Pr { E 1 } + . . . + Pr { E n } Theorem 5 (“Murphy’s Law”) . If events E 1 , . . . E n are mutually independent and X is the number of these events that occur, then: Pr { E 1 . . . E n } ≥ 1 e Ex( X ) Theorem 6 (Chernoff Bounds) . Let E 1 , . . . , E n be a collection of mutually independent events, and let X be the number of these events that occur. Then: Pr { X c Ex ( X ) } ≤ e ( c ln c c + 1) Ex ( X ) when c > 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Recitation 23 2 1 Getting Dressed Sometimes I forget a few items when I leave the house in the morning. For example, here are probabilities that I forget various pieces of footwear: left sock 0 . 2 right sock 0 . 1 left shoe 0 . 1 right shoe 0 . 3 a. Let X be the number of these that I forget. What is
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}