Chapter 2: Problem 63
Calculate the moment generating function of a geometric random variable.
Chapter 2: Problem 63
Calculate the moment generating function of a geometric random variable.
All the tools & learning materials you need for study success - in one app.
Get started for freeIf the density function of \(X\) equals
$$
f(x)=\left\\{\begin{array}{ll}
c e^{-2 x}, & 0
Suppose that the joint probability mass function of \(X\) and \(Y\) is $$ P(X=i, Y=j)=\left(\begin{array}{l} j \\ i \end{array}\right) e^{-2 \lambda} \lambda^{i} / j !, \quad 0 \leq i \leq j $$ (a) Find the probability mass function of \(Y\). (b) Find the probability mass function of \(X\). (c) Find the probability mass function of \(Y-X\).
Suppose that each coupon obtained is, independent of what has been previously obtained, equally likely to be any of \(m\) different types. Find the expected number of coupons one needs to obtain in order to have at least one of each type. Hint: Let \(X\) be the number needed. It is useful to represent \(X\) by $$ X=\sum_{i=1}^{m} X_{i} $$ where each \(X_{i}\) is a geometric random variable.
A total of \(r\) keys are to be put, one at a time, in \(k\) boxes, with each key independently being put in box \(i\) with probability \(p_{i}, \sum_{i=1}^{k} p_{i}=1 .\) Each time a key is put in a nonempty box, we say that a collision occurs. Find the expected number of collisions.
If \(X\) is uniform over \((0,1)\), calculate \(E\left[X^{n}\right]\) and \(\operatorname{Var}\left(X^{n}\right)\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.