Chapter 1: Problem 2
Let \(X\) be a random variable such that \(P(X \leq 0)=0\) and let \(\mu=E(X)\) exist. Show that \(P(X \geq 2 \mu) \leq \frac{1}{2}\).
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 1: Problem 2
Let \(X\) be a random variable such that \(P(X \leq 0)=0\) and let \(\mu=E(X)\) exist. Show that \(P(X \geq 2 \mu) \leq \frac{1}{2}\).
All the tools & learning materials you need for study success - in one app.
Get started for free
A mode of a distribution of one random variable \(X\) is a value of \(x\) that
maximizes the pdf or pmf. For \(X\) of the continuous type, \(f(x)\) must be
continuous. If there is only one such \(x\), it is called the mode of the
distribution. Find the mode of each of the following distributions:
(a) \(p(x)=\left(\frac{1}{2}\right)^{x}, x=1,2,3, \ldots\), zero elsewhere.
(b) \(f(x)=12 x^{2}(1-x), 0
A die is cast independently until the first 6 appears. If the casting stops on an odd number of times, Bob wins; otherwise, Joe wins. (a) Assuming the die is fair, what is the probability that Bob wins? (b) Let \(p\) denote the probability of a \(6 .\) Show that the game favors Bob, for all \(p\), \(0
A median of a distribution of one random variable \(X\) of the discrete or
continuous type is a value of \(x\) such that \(P(X
A bowl contains three red (R) balls and seven white (W) balls of exactly the same size and shape. Select balls successively at random and with replacement so that the events of white on the first trial, white on the second, and so on, can be assumed to be independent. In four trials, make certain assumptions and compute the probabilities of the following ordered sequences: (a) WWRW; (b) RWWW; (c) WWWR; and (d) WRWW. Compute the probability of exactly one red ball in the four trials.
Generalize Exercise \(1.2 .5\) to obtain $$\left(C_{1} \cup C_{2} \cup \cdots \cup C_{k}\right)^{c}=C_{1}^{c} \cap C_{2}^{c} \cap \cdots \cap C_{k}^{c}$$ Say that \(C_{1}, C_{2}, \ldots, C_{k}\) are independent events that have respective probabilities \(p_{1}, p_{2}, \ldots, p_{k} .\) Argue that the probability of at least one of \(C_{1}, C_{2}, \ldots, C_{k}\) is equal to $$1-\left(1-p_{1}\right)\left(1-p_{2}\right) \cdots\left(1-p_{k}\right)$$
What do you think about this solution?
We value your feedback to improve our textbook solutions.