62 problems found
I choose at random an integer in the range 10000 to 99999, all choices being equally likely. Given that my choice does not contain the digits 0, 6, 7, 8 or 9, show that the expected number of different digits in my choice is 3.3616.
Solution: We are choosing any \(5\) digit number from \(\{1,2,3,4,5\}\). There are \(5^5\) such numbers. \begin{align*} && \mathbb{E}(\text{different digits}) &= \frac1{5^5} \left (1 \cdot 5 + 2 \cdot \binom{5}{2}(2^5-2)+3 \cdot \binom{5}{3}(3^5-3 \cdot 2^5+3)+4 \cdot \binom{5}{4}(4^5 - 4 \cdot 3^5+6 \cdot 2^5-4) + 5 \cdot 5! \right) \\ &&&= \frac{2101}{625} = 3.3616 \end{align*}
In this question, you may assume that \(\displaystyle \int_0^\infty \!\!\! \e^{-x^2/2} \d x = \sqrt{\tfrac12 \pi}\,\). The number of supermarkets situated in any given region can be modelled by a Poisson random variable, where the mean is \(k\) times the area of the given region. Find the probability that there are no supermarkets within a circle of radius \(y\). The random variable \(Y\) denotes the distance between a randomly chosen point in the region and the nearest supermarket. Write down \(\P(Y < y)\) and hence show that the probability density function of \(Y\) is \(\displaystyle 2\pi y k \e^{-\pi k y^2}\) for \(y\ge0\). Find \(\E(Y)\) and show that \(\var(Y) = \dfrac{4-\pi}{4\pi k}\).
Solution: A circle radius \(y\) has a number of supermarkets \(X\) where \(X \sim Po(k \pi y^2)\). \[ \mathbb{P}(X = 0) = e^{-k\pi y^2} \frac{1}{0!} = e^{-k\pi y^2} \] The probability \(\mathbb{P}(Y < y) = 1-\mathbb{P}(Y \geq y) = 1-e^{-k\pi y^2}\), and in particular \(f_Y(y) = 2k\pi y e^{-k\pi y^2}\) (by differentiating). \begin{align*} && \mathbb{E}(Y) &= \int_0^\infty yf_Y(y) \d y \\ &&&= \int_0^\infty 2\pi y^2 k e^{-\pi k y^2} \d y \\ \sigma^2 = \frac{1}{2k\pi}:&&&= \pi k \sqrt{2 \pi}\sigma \int_{-\infty}^\infty \frac{1}{\sqrt{2 \pi} \sigma }y^2 e^{-\frac12 \cdot 2\pi k y^2} \d y \\ &&&=\pi k \sqrt{2 \pi}\sigma \mathbb{E}\left (N(0, \sigma^2)^2 \right) \\ &&&= \pi k \sqrt{2 \pi}\sigma\sigma^2 \\ &&&= \pi k \sqrt{2 \pi} \frac{1}{(2k\pi)^{3/2}} \\ &&&= \frac{1}{2\sqrt{k}} \end{align*} \begin{align*} && \mathbb{E}(Y^2) &= \int_0^\infty y^2f_Y(y) \d y \\ &&&= \int_0^\infty 2\pi y^3 k e^{-\pi k y^2} \d y \\ &&&= \int_0^{\infty}y^2 2y \pi k e^{-\pi k y^2} \d y \\ \\ &&&= \left [-y^2 e^{-\pi k y^2}\right]_0^{\infty}+\int_0^\infty 2ye^{-\pi k y^2} \d y \\ &&&= \left [-\frac{1}{\pi k}e^{-\pi k y^2} \right]_0^{\infty} \\ &&&= \frac{1}{\pi k} \\ \Rightarrow && \textrm{Var}(Y) &= \mathbb{E}(Y^2) - \left [ \mathbb{E}(Y)\right]^2 \\ &&&= \frac{1}{\pi k} - \frac{1}{4k} \\ &&&= \frac{4 - \pi}{4\pi k} \end{align*}
Xavier and Younis are playing a match. The match consists of a series of games and each game consists of three points. Xavier has probability \(p\) and Younis has probability \(1-p\) of winning the first point of any game. In the second and third points of each game, the player who won the previous point has probability \(p\) and the player who lost the previous point has probability \(1-p\) of winning the point. If a player wins two consecutive points in a single game, the match ends and that player has won; otherwise the match continues with another game.
Solution:
The infinite series \(S\) is given by \[ S = 1 + (1 + d)r + (1 + 2d)r^2 + \cdots + (1+nd)r^n +\cdots\; ,\] for \(\vert r \vert <1\,\). By considering \(S - rS\), or otherwise, prove that \[ S = \frac 1{1-r} + \frac {rd}{(1-r)^2} \,.\] Arthur and Boadicea shoot arrows at a target. The probability that an arrow shot by Arthur hits the target is \(a\); the probability that an arrow shot by Boadicea hits the target is \(b\). Each shot is independent of all others. Prove that the expected number of shots it takes Arthur to hit the target is \(1/a\). Arthur and Boadicea now have a contest. They take alternate shots, with Arthur going first. The winner is the one who hits the target first. The probability that Arthur wins the contest is \(\alpha\) and the probability that Boadicea wins is \(\beta\). Show that \[ \alpha = \frac a {1-a'b'}\,, \] where \(a' = 1-a\) and \(b'=1-b\), and find \(\beta\). Show that the expected number of shots in the contest is \(\displaystyle \frac \alpha a + \frac \beta b\,.\)
Solution: Notice that \begin{align*} && S - rS &= 1 + dr + dr^2 + \cdots \\ &&&= 1 + dr(1 + r+r^2+ \cdots) \\ &&&= 1 + \frac{rd}{1-r} \\ \Rightarrow && S &= \frac{1}{1-r} + \frac{rd}{(1-r)^2} \end{align*} The number of shots Arthur takes is \(\textrm{Geo}(a)\), so it's expectation is \(1/a\). The probability Arthur wins is: \begin{align*} \alpha &= a + a'b'a + (a'b')^2a + \cdots \\ &= a(1+a'b' + \cdots) \\ &= \frac{a}{1-a'b'} \\ \\ \beta &= a'b + a'b'a'b + \cdots \\ &= a'b(1+b'a' + (b'a')^2 + \cdots ) \\ &= \frac{a'b}{1-a'b'} \end{align*} The expected number of shots in the contest is: \begin{align*} E &= a + 2a'b + 3a'b'a + 4a'b'a'b + \cdots \\ &= a(1 + 3a'b' + 5(a'b')^2 + \cdots) + 2a'b(1 + 2(a'b') + 3(a'b')^2 + \cdots) \\ &= a \left ( \frac{1}{1-a'b'} + \frac{2a'b'}{(1-a'b')^2} \right) + 2a'b \left ( \frac{1}{1-a'b'} + \frac{a'b'}{(1-a'b')^2}\right) \\ &= \frac{a}{1-a'b'} \left (1 + \frac{2a'b'}{(1-a'b')} \right) + 2\frac{a'b}{1-a'b'} \left ( 1 + \frac{a'b'}{(1-a'b')}\right) \\ &= \alpha \frac{1+a'b'}{1-a'b'} + \beta \frac{2}{1-a'b'} \\ &= \alpha \frac{1+1-a-b+ab}{1-a'b'} + \beta \frac{2}{1-a'b'} \\ \end{align*}
Satellites are launched using two different types of rocket: the Andover and the Basingstoke. The Andover has four engines and the Basingstoke has six. Each engine has a probability~\(p\) of failing during any given launch. After the launch, the rockets are retrieved and repaired by replacing some or all of the engines. The cost of replacing each engine is \(K\). For the Andover, if more than one engine fails, all four engines are replaced. Otherwise, only the failed engine (if there is one) is replaced. Show that the expected repair cost for a single launch using the Andover is \[ 4Kp(1+q+q^2-2q^3) \ \ \ \ \ \ \ \ \ \ \ \ \ (q=1-p) \tag{*} \] For the Basingstoke, if more than two engines fail, all six engines are replaced. Otherwise only the failed engines (if there are any) are replaced. Find, in a form similar to \((*)\), the expected repair cost for a single launch using the Basingstoke. Find the values of \(p\) for which the expected repair cost for the Andover is \(\frac23\) of the expected repair cost for the Basingstoke.
A box contains \(n\) pieces of string, each of which has two ends. I select two string ends at random and tie them together. This creates either a ring (if the two ends are from the same string) or a longer piece of string. I repeat the process of tying together string ends chosen at random until there are none left. Find the expected number of rings created at the first step and hence obtain an expression for the expected number of rings created by the end of the process. Find also an expression for the variance of the number of rings created. Given that \(\ln 20 \approx 3\) and that \(1+ \frac12 + \cdots + \frac 1n \approx \ln n\) for large \(n\), determine approximately the expected number of rings created in the case \(n=40\,000\).
Solution: Let \(X_i\) be the indicator variable a loop is formed when there are \(i\) strings in the bag, so \(\mathbb{P}(X_i = 1) = \frac{1}{2i-1}\). Therefore \begin{align*} && Y_n &= X_n + Y_{n-1} \\ && Y_n &= X_n + \cdots + X_1 \\ \Rightarrow && \E[Y_n] &= \frac{1}{2n-1} + \frac{1}{2n-3} + \cdots + \frac{1}{1} \\ && \var[Y_n] &= \sum_{i=1}^n \frac{1}{2i-1} \frac{2i-2}{2i-1} \\ &&&= 2\sum_{i=1}^n \frac{i-1}{(2i-1)^2} \end{align*} \begin{align*} && \E[Y_{n}] &= 1 + \frac13 + \cdots + \frac{1}{2n-1} \\ &&&= 1 + \frac12 + \cdots + \frac1{2n} - \frac12\left (1 + \frac12 + \cdots + \frac1n \right) \\ &&&\approx \ln 2n -\frac12 \ln n \\ &&&= \ln 2 \sqrt{n} \\ \\ && \E[Y_{40\,000}] &= \ln 2 \sqrt{40\,000} \\ &&&= \ln 400 \\ &&&= 2 \ln 20 \approx 6 \end{align*}
A frog jumps towards a large pond. Each jump takes the frog either \(1\,\)m or \(2\,\)m nearer to the pond. The probability of a \(1\,\)m jump is \(p\) and the probability of a \(2\,\)m jump is \(q\), where \(p+q=1\), the occurence of long and short jumps being independent.
Solution:
Fifty times a year, 1024 tourists disembark from a cruise liner at a port. From there they must travel to the city centre either by bus or by taxi. Tourists are equally likely to be directed to the bus station or to the taxi rank. Each bus of the bus company holds 32 passengers, and the company currently runs 15 buses. The company makes a profit of \(\pounds\)1 for each passenger carried. It carries as many passengers as it can, with any excess being (eventually) transported by taxi. Show that the largest annual licence fee, in pounds, that the company should consider paying to be allowed to run an extra bus is approximately \[ 1600 \Phi(2) - \frac{800}{\sqrt{2\pi}}\big(1- \e^{-2}\big)\,, \] where \(\displaystyle \Phi(x) =\dfrac1{\sqrt{2\pi}} \int_{-\infty}^x \e^{-\frac12t^2}\d t\,\). You should not consider continuity corrections.
Solution: The the number of people being directed towards the buses (each cruise) is \(X \sim B(1024, \tfrac12) \approx N(512, 256) \approx 16Z + 512\). Therefore without an extra bus, the expected profit is \(\mathbb{E}[\min(X, 15 \times 32)]\). With the extra bus, the extra profit is \(\mathbb{E}[\min(X, 16 \times 32)]\), therefore the expected extra profit is: \(\mathbb{E}[\min(X, 16 \times 32)]-\mathbb{E}[\min(X, 15 \times 32)] = \mathbb{E}[\min(X, 16 \times 32)-\min(X, 15 \times 32)] \) \begin{align*} \text{Expected extra profit} &= \mathbb{E}[\min(X, 16 \times 32)-\min(X, 15 \times 32)] \\ &= \mathbb{E}[\min(16Z+512, 16 \times 32)-\min(16Z+512, 15 \times 32)] \\ &= 16\mathbb{E}[\min(Z+32, 32)-\min(Z+32, 30)] \\ &=16\int_{-\infty}^{\infty} \left (\min(Z+32, 32)-\min(Z+32, 30) \right)p_Z(z) \d z \\ &= 16 \left ( \int_{-2}^{0} (z+32-30) p_Z(z) \d z + \int_0^\infty (32-30)p_Z(z) \d z \right) \\ &= 16 \left ( \int_{-2}^{0} (z+2) p_Z(z) \d z + \int_0^\infty 2p_Z(z) \d z \right) \\ &= 16 \left ( \int_{-2}^{0} zp_Z(z) \d z + 2\int_{-2}^\infty p_Z(z) \d z \right) \\ &= 16 \left ( \int_{-2}^{0} z \frac{1}{\sqrt{2\pi}} e^{-\frac12 z^2} \d z + 2(1-\Phi(2)) \right) \\ &= 32(1-\Phi(2)) + \frac{16}{\sqrt{2\pi}} \left [ -e^{-\frac12z^2} \right]_{-2}^0 \\ &= 32(1-\Phi(2)) - \frac{16}{\sqrt{2\pi}} \left ( 1-e^{-2}\right) \end{align*} Across \(50\) different runs, this profit is \[ 1600(1-\Phi(2)) - \frac{800}{\sqrt{2\pi}} \left ( 1-e^{-2}\right) \]
Two points are chosen independently at random on the perimeter (including the diameter) of a semicircle of unit radius. The area of the triangle whose vertices are these two points and the midpoint of the diameter is denoted by the random variable \(A\). Show that the expected value of \(A\) is \((2+\pi)^{-1}\).
Solution: There are \(3\) possible numbers of points on the curved part of the perimeter. \(0\): The area is \(0\) \(1\):
A pack of cards consists of \(n+1\) cards, which are printed with the integers from \(0\) to \(n\). A~game consists of drawing cards repeatedly at random from the pack until the card printed with 0 is drawn, at which point the game ends. After each draw, the player receives \(\pounds 1\) if the card drawn shows any of the integers from \(1\) to \(w\) inclusive but receives nothing if the card drawn shows any of the integers from \(w+1\) to \(n\) inclusive.
A bag contains \(b\) balls, \(r\) of them red and the rest white. In a game the player must remove balls one at a time from the bag (without replacement). She may remove as many balls as she wishes, but if she removes any red ball, she loses and gets no reward at all. If she does not remove a red ball, she is rewarded with \pounds 1 for each white ball she has removed. If she removes \(n\) white balls on her first \(n\) draws, calculate her expected gain on the next draw and show that %her expected total reward would be the same as before it is zero if \(\ds n = {b-r \over r+1}\,\). Hence, or otherwise, show that she will maximise her expected total reward if she aims to remove \(n\) balls, where \[ n = \mbox{ the integer part of } \ds {b + 1 \over r + 1}\;. \] With this value of \(n\), show that in the case \(r=1\) and \(b\) even, her expected total reward is \(\pounds {1 \over 4}b\,\), and find her expected total reward in the case \(r=1\) and \(b\) odd.
In a bag are \(n\) balls numbered 1, 2, \(\ldots\,\), \(n\,\). When a ball is taken out of the bag, each ball is equally likely to be taken.
Solution:
If a football match ends in a draw, there may be a "penalty shoot-out". Initially the teams each take 5 shots at goal. If one team scores more times than the other, then that team wins. If the scores are level, the teams take shots alternately until one team scores and the other team does not score, both teams having taken the same number of shots. The team that scores wins. Two teams, Team A and Team B, take part in a penalty shoot-out. Their probabilities of scoring when they take a single shot are \(p_A\) and \(p_B\) respectively. Explain why the probability \(\alpha\) of neither side having won at the end of the initial \(10\)-shot period is given by $$\alpha =\sum_{i=0}^5\binom{5}{i}^2(1-p_A)^i(1-p_B)^i\,p_A^{5-i}p_B^{5-i}.$$ Show that the expected number of shots taken is \(\displaystyle 10+ \frac{2\alpha}\beta\;,\) where \(\beta=p_A+p_B-2p_Ap_B\,.\)
Solution: Note that in the first \(10\)-short period the number of goals scored by each team is \(B(5, \p_i)\). For them to be equal they must both have scored the same number of goals, ie \begin{align*} && \alpha &= \sum_{i=0}^5 \mathbb{P}(\text{both teams score }5-i) \\ &&&= \sum_{i=0}^5 \binom{5}{i} (1-p_A)^ip_A^{5-i} \binom{5}{i} (1-p_B)^i p_B^{5-i} \\ &&&= \sum_{i=0}^5 \binom{5}{i} ^2(1-p_A)^i (1-p_B)^i p_A^{5-i} p_B^{5-i} \\ \end{align*} Suppose we make it to the end of the shoot out with scores tied. The probability that we finish each round is \(p_A(1-p_B) + p_B(1-p_A)\) (the probability \(A\) wins or \(B\) wins). This is \(p_A + p_B - 2p_Ap_B = \beta\)). Therefore the number of additional rounds is geometric with parameter \(\beta\) and the expected number of rounds is \(\frac{1}{\beta}\). Each round has two shots, and there is a probability \(\alpha\) of this occuring, ie \(\frac{2\alpha}{\beta}\). Added to the \(10\) guaranteed shots we get the desired result