183 problems found
I have two identical dice. When I throw either one of them, the probability of it showing a 6 is \(p\) and the probability of it not showing a 6 is \(q\), where \(p+q=1\). As an experiment to determine \(p\), I throw the dice simultaneously until at least one die shows a 6. If both dice show a six on this throw, I stop. If just one die shows a six, I throw the other die until it shows a 6 and then stop.
Solution:
Given that \(0 < r < n\) and \(r\) is much smaller than \(n\), show that \(\dfrac {n-r}n \approx \e^{-r/n}\). There are \(k\) guests at a party. Assuming that there are exactly 365 days in the year, and that the birthday of any guest is equally likely to fall on any of these days, show that the probability that there are at least two guests with the same birthday is approximately \(1-\e^{-k(k-1)/730}\). Using the approximation \( \frac{253}{365} \approx \ln 2\), find the smallest value of \(k\) such that the probability that at least two guests share the same birthday is at least \(\frac12\). How many guests must there be at the party for the probability that at least one guest has the same birthday as the host to be at least \(\frac12\)?
Solution: Given \(0 < r \ll n\), then \(\frac{r}{n}\) is small and so, \(e^x \approx 1+x\), therefore: \(\displaystyle e^{-r/n} \approx 1 - \frac{r}{n} = \frac{n-r}{n}\). Line everyone in the room up in some order. The first person is always going to have a birthday we haven't seen before. The probability the second person has a new birthday is \(\displaystyle 1 - \frac{1}{365}\) since they can't be born on the same day as the first person. The third person has a \(\displaystyle 1 - \frac{2}{365}\) probability of having a birthday we've not seen before, since they can't share a birthday with either of the first two people. Similarly the \(k\)th person has a \(\displaystyle 1 - \frac{k-1}{365}\) chance of having a unique birthday. \begin{align*} \prod_{i=1}^k \mathbb{P}(\text{the } i \text{th person has a new birthday}) &= \prod_{i=1}^k \l 1 - \frac{i-1}{365}\r \\ &\approx \prod_{i=1}^k \exp \l -\frac{i-1}{365}\r \\ &= \exp\l - \sum_{i=1}^k\frac{i-1}{365}\r \\ &= \exp\l - \frac{k(k-1)}{2\cdot365}\r \\ &= e^{-k(k-1)/730} \end{align*} But this the probability no-one shares a birthday, so the answer we are looking for is \(1-\) this, ie \(1 - e^{-k(k-1)/730}\) Suppose \(1 - e^{-k(k-1)/730} = \frac12\), then \begin{align*} && 1 - e^{-k(k-1)/730} &= \frac12 \\ \Rightarrow && e^{-k(k-1)/730} &= \frac12 \\ \Rightarrow && -k(k-1)/730 &= -\ln 2 \\ \Rightarrow && k(k-1)/730 &\approx \frac{253}{365} \\ \Rightarrow && k(k-1) &\approx 506 \end{align*} Therefore since \(22 \cdot 23 = 506\), we should expect the number to be approximately \(23\). Since \(e^{-r/n} > \frac{n-r}{n}\) we should expect this to be an overestimate, therefore \(23\) should suffice.
The random variable \(X\) has a continuous probability density function \(\f(x)\) given by \begin{equation*} \f(x) = \begin{cases} 0 & \text{for } x \le 1 \\ \ln x & \text{for } 1\le x \le k\\ \ln k & \text{for } k\le x \le 2k\\ a-bx & \text{for } 2k \le x \le 4k \\ 0 & \text{for } x\ge 4k \end{cases} \end{equation*} where \(k\), \(a\) and \(b\) are constants.
Solution:
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.
Oxtown and Camville are connected by three roads, which are at risk of being blocked by flooding. On two of the three roads there are two sections which may be blocked. On the third road there is only one section which may be blocked. The probability that each section is blocked is \(p\). Each section is blocked independently of the other four sections. Show that the probability that Oxtown is cut off from Camville is \(p^3 \l 2-p \r^2\). I want to travel from Oxtown to Camville. I choose one of the three roads at random and find that my road is not blocked. Find the probability that I would not have reached Camville if I had chosen either of the other two roads. You should factorise your answer as fully as possible. Comment briefly on the value of this probability in the limit \(p\to1\).
Solution:
A cricket team has only three bowlers, Arthur, Betty and Cuba, each of whom bowls 30 balls in any match. Past performance reveals that, on average, Arthur takes one wicket for every 36 balls bowled, Betty takes one wicket for every 25 balls bowled, and Cuba takes one wicket for every 41 balls bowled.
Solution:
I know that ice-creams come in \(n\) different sizes, but I don't know what the sizes are. I am offered one of each in succession, in random order. I am certainly going to choose one - the bigger the better - but I am not allowed more than one. My strategy is to reject the first ice-cream I am offered and choose the first one thereafter that is bigger than the first one I was offered; if the first ice-cream offered is in fact the biggest one, then I have to put up with the last one, however small. Let \(\P_n(k)\) be the probability that I choose the \(k\)th biggest ice-cream, where \(k=1\) is the biggest and \(k=n\) is the smallest.
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) \]
Solution:
The random variable \(X\) has mean \(\mu\) and standard deviation \(\sigma\). The distribution of \(X\) is symmetrical about \(\mu\) and satisfies: \[\P \l X \le \mu + \sigma \r = a \mbox{ and } \P \l X \le \mu + \tfrac{1}{ 2}\sigma \r = b\,,\] where \(a\) and \(b\) are fixed numbers. Do not assume that \(X\) is Normally distributed.
Solution:
The random variable \(X\) can take the value \(X=-1\), and also any value in the range \(0\le X <\infty\,\). The distribution of \(X\) is given by \[ \P(X=-1) =m \,, \ \ \ \ \ \ \ \P(0\le X\le x) = k(1-\e^{-x})\,, \] for any non-negative number \(x\), where \(k\) and \(m\) are constants, and \(m <\frac12\,\).
Solution:
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.
In a certain factory, microchips are made by two machines. Machine A makes a proportion \(\lambda\) of the chips, where \(0 < \lambda < 1\), and machine B makes the rest. A proportion \(p\) of the chips made by machine A are perfect, and a proportion \(q\) of those made by machine B are perfect, where \(0 < p < 1\) and \(0 < q < 1\). The chips are sorted into two groups: group 1 contains those that are perfect and group 2 contains those that are imperfect. In a large random sample taken from group 1, it is found that \(\frac 2 5\) were made by machine A. Show that \(\lambda\) can estimated as \[ {2q \over 3p + 2q}\;. \] Subsequently, it is discovered that the sorting process is faulty: there is a probability of \(\frac 14\) that a perfect chip is assigned to group 2 and a probability of \(\frac 14\) that an imperfect chip is assigned to group 1. Taking into account this additional information, obtain a new estimate of \(\lambda\,\).
Solution: \begin{align*} && \frac25 &= \frac{\lambda p}{\lambda p + (1-\lambda) q} \\ \Rightarrow && 2(1-\lambda)q &= 3\lambda p \\ \Rightarrow && \lambda(3p+2q) &= 2q \\ \Rightarrow && \lambda &= \frac{2q}{3p+2q} \end{align*} \begin{align*} && \frac25 &= \frac{\lambda (p + \frac14(1-p))}{\lambda (p + \frac14(1-p))+(1-\lambda) (q + \frac14(1-q))} \\ &&&= \frac{\lambda(\frac34p + \frac14)}{\lambda(\frac34p + \frac14)+(1-\lambda)(\frac34q + \frac14)} \\ \Rightarrow && \lambda &= \frac{2(\frac34q+\frac14)}{3(\frac34p + \frac14)+2(\frac34q+\frac14)} \\ &&&= \frac{\frac32q + \frac12}{\frac94p + \frac32q + \frac54} \\ &&&= \frac{6q+2}{9p+6q+5} \end{align*}
Solution: \begin{align*} \P(X \leq 0.8) &= \P(X_1 \leq 0.8,X_2 \leq 0.8,X_3 \leq 0.8) \\ &= 0.8^3 \\ &= 0.512 \end{align*} \begin{align*} && \P(X < c) &= c^3 \\ \Rightarrow && f_X(x) &= 3x^2 \\ \Rightarrow && \E[X] &= \int_0^1 x \cdot (3x^2) \, dx \\ && &= \left [ \frac{3}{4}x^4 \right]_0^1 \\ &&&= \frac{3}{4} \end{align*} \(X\) is distributed the maximum of \(N\) numbers on \([0,a]\). \begin{align*} H_0 : & x= 1 \\ H_1 : & x < 1 \end{align*} \begin{align*} &&\P(X < c) &= c^N \\ &&&= \frac1{20} \\ \Rightarrow && N &= -\frac{\log(20)}{\log(c)} \end{align*} where \(c = 0.8\), we have \begin{align*} N &= \frac{\log(20)}{\log(5/4)} \\ &= \frac{\log(5)+\log(4)}{\log(5)-\log(4)} \\ &= \frac{ \frac{\log(5)}{\log(4)}+1}{\frac{\log(5)}{\log(4)} - 1} \end{align*} \begin{align*} && 2^{10} &\approx 10^{3} \\ && 10\log(2) &\approx 3 (\log(5) + \log(2)) \\ && 7\log(2) &\approx 3 \log(5) \\ && \frac{\log(5)}{2\log(2)} &\approx \frac{7}{6} \end{align*} \begin{align*} &= \frac{ \frac{\log(5)}{\log(4)}+1}{\frac{\log(5)}{\log(4)} - 1} &= \frac{\frac{7}{6} + 1}{\frac{7}{6} -1} \\ &= 13 \end{align*} Since \(2^{10} > 10^3\) then \(N=14\) is the value we seek. \(\P(X < 0.8 | a= 0.8) = 1\) \(\P(X < 0.8 | a= 0.9, N=14) = \frac{8^{14}}{9^{14}}\)