183 problems found
Bread roll throwing duels at the Drones' Club are governed by a strict etiquette. The two duellists throw alternatively until one is hit, when the other is declared the winner. If Percy has probability \(p>0\) of hitting his target and Rodney has probability \(r>0\) of hitting his, show that, if Percy throws first, the probability that he beats Rodney is \[ \frac{p}{p+r-pr}. \] Algernon, Bertie and Cuthbert decide to have a three sided duel in which they throw in order \(\mathrm{A,B,C,A,B,C,}\ldots\) except that anyone who is hit must leave the game. Cuthbert always his target, Bertie hits his target with probability \(3/5\) and Algernon hits his target with probability \(2/5.\) Bertie and Cuthbert will always aim at each other if they are both still in the duel. Otherwise they aim at Algernon. With his first shot Algernon may aim at either Bertie or Cuthbert or deliberately miss both. Faced with only one opponent Algernon will aim at him. What are Algernon's changes of winning if he:
Fly By Night Airlines run jumbo jets which seat \(N\) passengers. From long experience they know that a very small proportion \(\epsilon\) of their passengers fail to turn up. They decide to sell \(N+k\) tickets for each flight. If \(k\) is very small compared with \(N\) explain why they might expect \[ \mathrm{P}(r\mbox{ passengers fail to turn up})=\frac{\lambda^{r}}{r!}\mathrm{e}^{-\lambda} \] approximately, with \(\lambda=N\epsilon.\) For the rest of the question you may assume that the formula holds exactly. Each ticket sold represents \(\pounds A\) profit, but the airline must pay each passenger that it cannot fly \(\pounds B\) where \(B>A>0.\) Explain why, if \(r\) passengers fail to turn up, its profit, in pounds, is \[ A(N+k)-B\max(0,k-r), \] where \(\max(0,k-r)\) is the larger of \(0\) and \(k-r.\) Write down the expected profit \(u_{k}\) when \(k=0,1,2\) and \(3.\) Find \(v_{k}=u_{k+1}-u_{k}\) for general \(k\) and show that \(v_{k}>v_{k+1}.\) Show also that \[ v_{k}\rightarrow A-B \] as \(k\rightarrow\infty.\) Advise Fly By Night on how to choose \(k\) to maximise its expected profit \(u_{k}.\)
A message of \(10^{k}\) binary digits is sent along a fibre optic cable with high probabilities \(p_{0}\) and \(p_{1}\) that the digits 0 and 1, respectively, are received correctly. If the probability of a digit in the original message being a 1 is \(\alpha,\) find the probability that the entire message is received correctly. Find the probability \(\beta\) that a randomly chosen digit in the message is received as a 1 and show that \(\beta=\alpha\) if, and only if \[ \alpha=\frac{q_{0}}{q_{1}+q_{0}}, \] where \(q_{0}=1-p_{0}\) and \(q_{1}=1-p_{1}.\) If this condition is satisfied and the received message consists entirely of zeros, what is the probability that it is correct? If now \(q_{0}=q_{1}=q\) and \(\alpha=\frac{1}{2},\) find the approximate value of \(q\) which will ensure that a message of one million binary digits has a fifty-fifty chance of being received entirely correctly. The probability of error \(q\) is proportional to the square of the length of the cable. Initially the length is such that the probability of a message of one million binary bits, among which 0 and 1 are equally likely, being received correctly is \(\frac{1}{2}.\) What would this probability become if a booster station were installed at its mid-point, assuming that the booster station re-transmits the received version of the message, and assuming that terms of order \(q^{2}\) may be ignored?
There are 28 colleges in Cambridge, of which two (New Hall and Newnham) are for women only; the others admit both men and women. Seven women, Anya, Betty, Celia, Doreen, Emily, Fariza and Georgina, are all applying to Cambridge. Each has picked three colleges at random to enter on her application form.
Solution:
I have a bag containing \(M\) tokens, \(m\) of which are red. I remove \(n\) tokens from the bag at random without replacement. Let \[ X_{i}=\begin{cases} 1 & \mbox{ if the ith token I remove is red;}\\ 0 & \mbox{ otherwise.} \end{cases} \] Let \(X\) be the total number of red tokens I remove.
Solution:
Each of my \(n\) students has to hand in an essay to me. Let \(T_{i}\) be the time at which the \(i\)th essay is handed in and suppose that \(T_{1},T_{2},\ldots,T_{n}\) are independent, each with probability density function \(\lambda\mathrm{e}^{-\lambda t}\) (\(t\geqslant0\)). Let \(T\) be the time I receive the first essay to be handed in and let \(U\) be the time I receive the last one.
Solution:
Calamity Jane sits down to play the game of craps with Buffalo Bill. In this game she rolls two fair dice. If, on the first throw, the sum of the dice is \(2,3\) or \(12\) she loses, while if it is \(7\) or \(11\) she wins. Otherwise Calamity continues to roll the dice until either the first sum is repeated, in which case she wins, or the sum is \(7\), in which case she loses. Find the probability that she wins on the first throw. Given that she throws more than once, show that the probability that she wins on the \(n\)th throw is \[ \frac{1}{48}\left(\frac{3}{4}\right)^{n-2}+\frac{1}{27}\left(\frac{13}{18}\right)^{n-2}+\frac{25}{432}\left(\frac{25}{36}\right)^{n-2}. \] Given that she throws more than \(m\) times, where \(m>1,\) what is the probability that she wins on the \(n\)th throw?
The makers of Cruncho (`The Cereal Which Cares') are giving away a series of cards depicting \(n\) great mathematicians. Each packet of Cruncho contains one picture chosen at random. Show that when I have collected \(r\) different cards the expected number of packets I must open to find a new card is \(n/(n-r)\) where \(0\leqslant r\leqslant n-1.\) Show by means of a diagram, or otherwise, that \[ \frac{1}{r+1}\leqslant\int_{r}^{r+1}\frac{1}{x}\,\mathrm{d}x\leqslant\frac{1}{r} \] and deduce that \[ \sum_{r=2}^{n}\frac{1}{r}\leqslant\ln n\leqslant\sum_{r=1}^{n-1}\frac{1}{r} \] for all \(n\geqslant2.\) My children will give me no peace until we have the complete set of cards, but I am the only person in our household prepared to eat Cruncho and my spouse will only buy the stuff if I eat it. If \(n\) is large, roughly how many packets must I expect to consume before we have the set?
When Septimus Moneybags throws darts at a dart board they are certain to end on the board (a disc of radius \(a\)) but, it must be admitted, otherwise are uniformly randomly distributed over the board.
Solution:
In certain forms of Tennis two players \(A\) and \(B\) serve alternate games. Player \(A\) has probability \(p\low_{A}\) of winning a game in which she serves and \(p\low_{B}\) of winning a game in which player \(B\) serves. Player \(B\) has probability \(q\low_{B}=1-p\low_{B}\) of winning a game in which she serves and probability \(q\low_{A}=1-p\low_{A}\) of winning a game in which player \(A\) serves. In Shortened Tennis the first player to lead by 2 games wins the match. Find the probability \(P_{\text{short}}\) that \(A\) wins a Shortened Tennis match in which she serves first and show that it is the same as if \(B\) serves first. In Standard Tennis the first player to lead by 2 or more games after 4 or more games have been played wins the match. Show that the probability that the match is decided in 4 games is \[ p^{2}_Ap_{B}^{2}+q_{A}^{2}q_{B}^{2}+2(p\low_{A}p\low_{B}+q\low_{A}q\low_{B})(p\low_{A}q\low_{B}+q\low_{A}p\low_{B}). \] If \(p\low_{A}=p\low_{B}=p\) and \(q\low_{A}=q\low_{B}=q,\) find the probability \(P_{\text{stan}}\) that \(A\) wins a Standard Tennis match in which she serves first. Show that \[ P_{\text{stan}}-P_{\text{short}}=\frac{p^{2}q^{2}(p-q)}{p^{2}+q^{2}}. \]
Three points, \(P,Q\) and \(R\), are independently randomly chosen on the perimeter of a circle. Prove that the probability that at least one of the angles of the triangle \(PQR\) will exceed \(k\pi\) is \(3(1-k)^{2}\) if \(\frac{1}{2}\leqslant k\leqslant1.\) Find the probability if \(\frac{1}{3}\leqslant k\leqslant\frac{1}{2}.\)
When he sets out on a drive Mr Toad selects a speed \(V\) kilometres per minute where \(V\) is a random variable with probability density \[ \alpha v^{-2}\mathrm{e}^{-\alpha v^{-1}} \] and \(\alpha\) is a strictly positive constant. He then drives at constant speed, regardless of other drivers, road conditions and the Highway Code. The traffic lights at the Wild Wood cross-roads change from red to green when Mr Toad is exactly 1 kilometre away in his journey towards them. If the traffic light is green for \(g\) minutes, then red for \(r\) minutes, then green for \(g\) minutes, and so on, show that the probability that he passes them after \(n(g+r)\) minutes but before \(n(g+r)+g\) minutes, where \(n\) is a positive integer, is \[ \mathrm{e}^{-\alpha n(g+r)}-\mathrm{e}^{-\alpha\left(n(g+r)\right)+g}. \] Find the probability \(\mathrm{P}(\alpha)\) that he passes the traffic lights when they are green. Show that \(\mathrm{P}(\alpha)\rightarrow1\) as \(\alpha\rightarrow\infty\) and, by noting that \((\mathrm{e}^{x}-1)/x\rightarrow1\) as \(x\rightarrow0\), or otherwise, show that \[ \mathrm{P}(\alpha)\rightarrow\frac{g}{r+g}\quad\mbox{ as }\alpha\rightarrow0. \] {[}NB: the traffic light show only green and red - not amber.{]}
Two computers, LEP and VOZ are programmed to add numbers after first approximating each number by an integer. LEP approximates the numbers by rounding: that is, it replaces each number by the nearest integer. VOZ approximates by truncation: that is, it replaces each number by the largest integer less than or equal to the number. The fractional parts of the numbers to be added are uniformly and independently distributed. (The fractional part of a number \(a\) is \(a-\left\lfloor a\right\rfloor ,\) where \(\left\lfloor a\right\rfloor \) is the largest integer less than or equal to \(a\).) Both computers approximate and add 1500 numbers. For each computer, find the probability that the magnitude of error in the answer will exceed 15. How many additions can LEP perform before the probability that the magnitude of error is less than 10 drops below 0.9?
The probability of throwing a head with a certain coin is \(p\) and the probability of throwing a tail is \(q=1-p\). The coin is thrown until at least two heads and at least two tails have been thrown; this happens when the coin has been thrown \(N\) times. Write down an expression for the probability that \(N=n\). Show that the expectation of \(N\) is $$ 2\bigg({1\over pq} -1-pq\bigg). $$
Solution: This can either occur via \(N-2\) heads and \(1\) tail in the first \(N-1\) flips, followed by a tail, or \(N-2\) tails and \(1\) head in the first \(N-1\) flips, followed by another head, ie \begin{align*} \mathbb{P}(N = n) &= \underbrace{\binom{n-1}{1}}_{\text{ways to choose when the first tail occurs}}p^{n-2}q^2 + \underbrace{\binom{n-1}{1}}_{\text{ways to choose when the first head occurs}}q^{n-2}p^2 \\ &= (n-1)p^2q^2(p^{n-4}+q^{n-4}) \\ \\ \mathbb{E}(N) &= \sum_{n=4}^{\infty} n \cdot \mathbb{P}(N = n) \\ &= \sum_{n=4}^{\infty} n \cdot (n-1)p^2q^2(p^{n-4}+q^{n-4}) \\ &= \sum_{n=4}^{\infty} n \cdot (n-1)(p^{n-2}q^2+q^{n-2}p^2) \\ &= q^2\sum_{n=4}^{\infty} n(n-1)p^{n-2}+p^2\sum_{n=4}^{\infty} n(n-1)q^{n-2} \\ &= q^2\left ( \sum_{n=2}^{\infty} n(n-1)p^{n-2} -2 \cdot 1 - 3 \cdot 2 \cdot p\right)+p^2\left ( \sum_{n=2}^{\infty} n(n-1)q^{n-2} - 2-6q\right) \\ &= q^2\left ( 2(1-p)^{-3} -2 - 6 p\right)+p^2\left ( 2(1-q)^{-3} - 2-6q\right) \\ &= q^2\left ( 2q^{-3} -2 - 6 p\right)+p^2\left ( 2p^{-3} - 2-6q\right) \\ &= \frac{2}{q} - 2q^2 - 6pq^2+\frac{2}{p} -2p^2-6p^2q \\ &= \frac{2}{q}+\frac2p - 2(p^2+q^2) - 6pq \\ &= \frac{2}{pq} - 2((p+q)^2-2pq) - 6pq \\ &= \frac{2}{pq} - 2 -2pq \\ &= 2 \left (\frac1{pq} - 1 - pq \right) \end{align*}
Trains leave Barchester Station for London at 12 minutes past the hour, taking 60 minutes to complete the journey and at 48 minutes past the hour taking 75 minutes to complete the journey. The arrival times of passengers for London at Barchester Station are uniformly distributed over the day and all passengers take the first available train. Show that their average journey time from arrival at Barchester Station to arrival in London is 84.6 minutes. Suppose that British Rail decide to retime the fast 60 minute train so that it leaves at \(x\) minutes past the hour. What choice of \(x\) will minimise the average journey time?
Solution: If you arrive between 12 to and 12 past, it will take 60 minutes + how many minutes you wait at the station. If you arrive between 12 past and 12 to, it will take 75 minutes plus waiting at the station. Let's say arrival time \(X \sim U(0,60)\) minutes past the hour, then travel time is. Let's say there are two random variables, \(X_{fast} \sim U(0,24)\) \(X_{slow} \sim U(0, 36)\). Then if you wait for a fast train your expected wait time is \(72\), if you wait for a slow time, your expected wait time is \(75 + 18 = 93\). There is a \(\frac{24}{60} = \frac{4}{10}\) chance of being in the first case, and \(\frac{6}{10}\) chance of the second, ie: \(\frac{4}{10} \cdot 72 + \frac{6}{10} \cdot 93 = \frac{846}{10} = 84.6\) expected wait time. Suppose the time the trains so the expected fraction of time waiting for the fast train is \(t\) and the slow train is \(1-t\). Then the expected time is: \begin{align*} t \l 30t + 60 \r + (1-t) \l 30(1-t) + 75 \r &= 60t^2 -75t + 105 \\ &= 60 \l t^2 - \frac{5}{4}t \r + 105 \\ &= 60 \l t - \frac{5}{8} \r^2 - ? + 105 \\ \end{align*} Threfore we should choose \(x\) such that \(t = \frac58\), which is \(~37.5\) minutes after the slower train, \(25.5\) minutes past.