Chapter 1: Problem 11
Two distinct integers are chosen at random and without replacement from the first six positive integers. Compute the expected value of the absolute value of the difference of these two numbers.
Chapter 1: Problem 11
Two distinct integers are chosen at random and without replacement from the first six positive integers. Compute the expected value of the absolute value of the difference of these two numbers.
All the tools & learning materials you need for study success - in one app.
Get started for freeFrom a well shuffled deck of ordinary playing cards, four cards are turned over one at a time without replacement. What is the probability that the spades and red cards alternate?
Let \(\psi(t)=\log M(t)\), where \(M(t)\) is the mgf of a distribution. Prove that \(\psi^{\prime}(0)=\mu\) and \(\psi^{\prime \prime}(0)=\sigma^{2}\). The function \(\psi(t)\) is called the cumulant generating function.
The random variable \(X\) is said to be stochastically larger than the random variable \(Y\) if $$P(X>z) \geq P(Y>z)$$ for all real \(z\), with strict inequality holding for at least one \(z\) value. Show that this requires that the cdfs enjoy the following property $$F_{X}(z) \leq F_{Y}(z)$$ for all real \(z\), with strict inequality holding for at least one \(z\) value.
Let \(X\) be a random variable with a pdf \(f(x)\) and mgf \(M(t)\). Suppose \(f\) is symmetric about \(0,(f(-x)=f(x))\). Show that \(M(-t)=M(t)\).
Let \(X\) have the pmf \(p(x)=1 / k, x=1,2,3, \ldots, k\), zero elsewhere. Show that the mgf is $$M(t)=\left\\{\begin{array}{ll}\frac{e^{t}\left(1-e^{k t}\right)}{k\left(1-e^{t}\right)} & t \neq 0 \\ 1 & t=0\end{array}\right.$$
What do you think about this solution?
We value your feedback to improve our textbook solutions.