7 problems found
Solution:
Solution:
I choose a number from the integers \(1, 2, \ldots, (2n-1)\) and the outcome is the random variable \(N\). Calculate \( \E(N)\) and \(\E(N^2)\). I then repeat a certain experiment \(N\) times, the outcome of the \(i\)th experiment being the random variable \(X_i\) (\(1\le i \le N\)). For each \(i\), the random variable \(X_i\) has mean \(\mu\) and variance \(\sigma^2\), and \(X_i\) is independent of \(X_j\) for \(i\ne j\) and also independent of \(N\). The random variable \(Y\) is defined by \(Y= \sum\limits_{i=1}^NX_i\). Show that \(\E(Y)=n\mu\) and that \(\mathrm{Cov}(Y,N) = \frac13n(n-1)\mu\). Find \(\var(Y) \) in terms of \(n\), \(\sigma^2\) and \(\mu\).
Solution: \begin{align*} && \E[N] &= \sum_{i=1}^{2n-1} \frac{i}{2n-1} \\ &&&= \frac{2n(2n-1)}{2(2n-1)} = n\\ && \E[N^2] &= \sum_{i=1}^{2n-1} \frac{i^2}{2n-1} \\ &&&= \frac{(2n-1)(2n)(4n-1)}{6(2n-1)} \\ &&&= \frac{n(4n-1)}{3} \\ && \var[N] &= \frac{n(4n-1)}{3} - n^2 \\ &&&= \frac{n^2-n}{3} \end{align*} \begin{align*} && \E[Y] &= \E \left [ \E \left [ \sum_{i=1}^N X_i | N = k\right] \right]\\ &&&= \E \left[ N\mu \right] = n\mu \\ \\ && \mathrm{Cov}(Y,N) &= \mathbb{E}[XY] - \E[X]\E[Y] \\ &&&= \E \left [ \E \left [N \sum_{i=1}^N X_i | N = k\right] \right] - n^2 \mu \\ &&&= \E[N^2\mu] - n^2 \mu \\ &&&= \left ( \frac{n^2(4n-1)}{3} - n^2 \right) \mu \\ &&&= \frac{n^2-n}{3}\mu \\ \\ && \E[Y^2] &= \E \left [ \E \left [ \left ( \sum_{i=1}^N X_i \right) ^2\right ] \right] \\ &&&= \E \left [ \E \left [ \sum_{i=1}^N X_i ^2 + 2\sum_{i,j} X_iX_j\right ] \right] \\ &&&= \E \left [ \sum_{i=1}^N \left ( \E[X_i ^2] + 2\sum_{i,j} \E[X_i]\E[X_j]\right ) \right] \\ &&&= \E \left [ N(\sigma^2 + \mu^2) + (N^2-N)\mu^2\right] \\ &&&= n(\sigma^2+\mu^2) + \left ( \frac{n^2-n}{3}-n \right)\mu^2 \\ &&&= n\sigma^2 + \frac{n^2-n}{3} \mu^2 \\ \Rightarrow && \var[Y] &= n\sigma^2 + \frac{n^2-n}{3} \mu^2 - n^2\mu^2 \\ &&&= n\sigma^2 - \frac{2n^2+n}{3} \mu^2 \end{align*}
Jane goes out with any of her friends who call, except that she never goes out with more than two friends in a day. The number of her friends who call on a given day follows a Poisson distribution with parameter \(2\). Show that the average number of friends she sees in a day is~\(2-4\e^{-2}\,\). Now Jane has a new friend who calls on any given day with probability \(p\). Her old friends call as before, independently of the new friend. She never goes out with more than two friends in a day. Find the average number of friends she now sees in a day.
Brief interruptions to my work occur on average every ten minutes and the number of interruptions in any given time period has a Poisson distribution. Given that an interruption has just occurred, find the probability that I will have less than \(t\) minutes to work before the next interruption. If the random variable \(T\) is the time I have to work before the next interruption, find the probability density function of \(T\,\). I need an uninterrupted half hour to finish an important paper. Show that the expected number of interruptions before my first uninterrupted period of half an hour or more is \(\e^3-1\). Find also the expected length of time between interruptions that are less than half an hour apart. Hence write down the expected wait before my first uninterrupted period of half an hour or more.
In the basic version of Horizons (H1) the player has a maximum of \(n\) turns, where \(n \ge 1\). At each turn, she has a probability \(p\) of success, where \(0 < p < 1\). If her first success is at the \(r\)th turn, where \(1 \le r \le n\), she collects \(r\) pounds and then withdraws from the game. Otherwise, her winnings are nil. Show that in H1, her expected winnings are $$ p^{-1}\left[1+nq^{n+1}-(n+1)q^n\right]\quad\hbox{pounds}, $$ where \(q=1-p\). The rules of H2 are the same as those of H1, except that \(n\) is randomly selected from a Poisson distribution with parameter \(\lambda\). If \(n=0\) her winnings are nil. Otherwise she plays H1 with the selected \(n\). Show that in H2, her expected winnings are $$ {1 \over p}{\left(1-{\e^{-{\lambda}p}}\right)} -{{\lambda}q}{\e^{-{\lambda}p}} \quad\hbox{pounds}. $$
Solution: \begin{align*} && \E[H1] &= \sum_{r=1}^n r \cdot \mathbb{P}(\text{first success on }r\text{th turn}) \\ &&&= \sum_{r=1}^n r \cdot q^{r-1}p \\ &&&= p\sum_{r=1}^n r q^{r-1} \\ \\ && \frac{1-x^{n+1}}{1-x} &= \sum_{r=0}^n x^r \\ \Rightarrow && \sum_{r=1}^n r x^{r-1} &= \frac{-(n+1)x^n(1-x) +(1-x^{n+1})}{(1-x)^2} \\ &&&= \frac{1-(n+1)x^n+nx^{n+1}}{(1-x)^2} \\ \\ && \E[H1] &= p\sum_{r=1}^n r q^{r-1} \\ &&&= p\frac{1-(n+1)q^n+nq^{n+1}}{(1-q)^2} \\ &&&= p^{-1}(1-(n+1)q^{n} + nq^{n+1}) \end{align*} Not that if \(n =0\) , the formula for \(\E[H1] = 0\). So \begin{align*} && \E[H2] &= \E[\E[H1|n=N]] \\ &&&= p^{-1}\E \left [ 1-(N+1)q^{N} + Nq^{N+1}\right] \\ &&&= p^{-1}\E \left [ 1-((1-q)N+1)q^{N} \right] \\ &&&= p^{-1}\left (1 - p\E[Nq^N] - G_{Po(\lambda)}(q) \right) \\ &&&= p^{-1}(1-e^{-\lambda(1-q)}) - \E[Nq^N] \\ &&&= p^{-1}(1-e^{-\lambda(1-q)}) - q\lambda e^{-\lambda(1-q)} \\ &&&= p^{-1}(1-e^{-\lambda p}) - q\lambda e^{-\lambda p} \end{align*}
Two points are chosen independently at random on the perimeter (including the diameter) of a semicircle of unit radius. What is the probability that exactly one of them lies on the diameter? Let the area of the triangle formed by the two points and the midpoint of the diameter be denoted by the random variable \(A\).
Solution: