Problems

Filters
Clear Filters

8 problems found

2020 Paper 2 Q11
D: 1500.0 B: 1500.0

A coin is tossed repeatedly. The probability that a head appears is \(p\) and the probability that a tail appears is \(q = 1 - p\).

  1. A and B play a game. The game ends if two successive heads appear, in which case A wins, or if two successive tails appear, in which case B wins. Show that the probability that the game never ends is \(0\). Given that the first toss is a head, show that the probability that A wins is \(\dfrac{p}{1 - pq}\). Find and simplify an expression for the probability that A wins.
  2. A and B play another game. The game ends if three successive heads appear, in which case A wins, or if three successive tails appear, in which case B wins. Show that \[\mathrm{P}(\text{A wins} \mid \text{the first toss is a head}) = p^2 + (q + pq)\,\mathrm{P}(\text{A wins} \mid \text{the first toss is a tail})\] and give a similar result for \(\mathrm{P}(\text{A wins} \mid \text{the first toss is a tail})\). Show that \[\mathrm{P}(\text{A wins}) = \frac{p^2(1-q^3)}{1-(1-p^2)(1-q^2)}.\]
  3. A and B play a third game. The game ends if \(a\) successive heads appear, in which case A wins, or if \(b\) successive tails appear, in which case B wins, where \(a\) and \(b\) are integers greater than \(1\). Find the probability that A wins this game. Verify that your result agrees with part (i) when \(a = b = 2\).

2019 Paper 1 Q11
D: 1500.0 B: 1500.0

  1. Two people adopt the following procedure for deciding where to go for a cup of tea: either to a hotel or to a tea shop. Each person has a coin which has a probability \(p\) of showing heads and \(q\) of showing tails (where \(p+q = 1\)). In each round of the procedure, both people toss their coins once. If both coins show heads, then both people go to the hotel; if both coins show tails, then both people go to the tea shop; otherwise, they continue to the next round. This process is repeated until a decision is made. Show that the probability that they make a decision on the \(n\)th round is $$(q^2 + p^2)(2qp)^{n-1}.$$ Show also that the probability that they make a decision on or before the \(n\)th round is at least $$1 - \frac{1}{2^n}$$ whatever the value of \(p\).
  2. Three people adopt the following procedure for deciding where to go for a cup of tea: either to a hotel or to a tea shop. Each person has a coin which has a probability \(p\) of showing heads and \(q\) of showing tails (where \(p + q = 1\)). In the first round of the procedure, all three people toss their coins once. If all three coins show heads, then all three people go to the hotel; if all three coins show tails, then all three people go to the tea shop; otherwise, they continue to the next round. In the next round the two people whose coins showed the same face toss again, but the third person just turns over his or her coin. If all three coins show heads, then all three people go to the hotel; if all three coins show tails, then all three people go to the tea shop; otherwise, they go to the third round. Show that the probability that they make a decision on or before the second round is at least \(\frac{7}{16}\), whatever the value of \(p\).


Solution:

  1. The probability they don't make a decision in a round is \(qp + pq = 2qp\) (TH and HT). The probability they make a decision in a round is \(q^2+p^2\) (TT and HH). Therefore the probability they make a decision in the \(n\)th round is: \[ (q^2+p^2)(2qp)^{n-1} \] by having \(n-1\) failures and one success. The probability they make a decision on or before the \(n\)th round is the \(1-\) the probability they don't, ie \(1 - (2qp)^n\). Notice that \(\sqrt{qp} \leq \frac{p+1}{2} = \frac12 \Rightarrow qp \leq \frac14\) so \(1-(2pq)^n \leq 1 - \frac1{2^n}\)
  2. The probability it's decided in the first round is \(p^3 + q^3\) (HHH, TTT). The probability it's decided in the second round is \(3p^2q \cdot p^2 + 3qq^2 \cdot q^2 = 3pq(p^3+q^3)\) (HHT -> HHH) and (TTH -> TTT) with reorderings). Therefore the probability of making a decision in the first or second round is \((p^3+q^3)(1 + 3pq)\) which is minimised when \(p = q\) by Muirhead (or whatever your favourite inequality is). So \(\frac{2}{8} \cdot \left ( 1 + \frac{3}{4} \right) = \frac{7}{16}\)

2018 Paper 2 Q12
D: 1600.0 B: 1500.0

In a game, I toss a coin repeatedly. The probability, \(p\), that the coin shows Heads on any given toss is given by \[ p= \frac N{N+1} \,, \] where \(N\) is a positive integer. The outcomes of any two tosses are independent. The game has two versions. In each version, I can choose to stop playing after any number of tosses, in which case I win £\(H\), where \(H\) is the number of Heads I have tossed. However, the game may end before that, in which case I win nothing.

  1. In version 1, the game ends when the coin first shows Tails (if I haven't stopped playing before that). I decide from the start to toss the coin until a total of \(h\) Heads have been shown, unless the game ends before then. Find, in terms of \(h\) and \(p\), an expression for my expected winnings and show that I can maximise my expected winnings by choosing \(h=N\).
  2. In version 2, the game ends when the coin shows Tails on two consecutive tosses (if I haven't stopped playing before that). I decide from the start to toss the coin until a total of \(h\) Heads have been shown, unless the game ends before then. Show that my expected winnings are \[ \frac{ hN^h (N+2)^h}{(N+1)^{2h}} \,.\] In the case \(N=2\,\), use the approximation \(\log_3 2 \approx 0.63\) to show that the maximum value of my expected winnings is approximately £3.


Solution:

  1. Since we either win \(h\) or \(0\), to calculate the expected winnings we just need to calculate the probability that we get \(h\) consecutive heads, therefore: \begin{align*} && \mathbb{E}(\text{winnings}) &= E_h \\ &&&= h \cdot \left ( \frac{N}{N+1} \right)^h \\ && \frac{E_{h+1}}{E_h} &= \frac{h+1}{h }\left ( \frac{N}{N+1} \right) \end{align*} Therefore \(E_h\) is increasing if \(h \leq N\), so we can maximise our winnings by taking \(h = N\). (In fact, we could take \(h = N\) or \(h = N+1\), but arguably \(h = N\) is better as we have the same expected value but lower variance).
  2. We can have up to \(h\) tails appearing (if we imagine slots for tails of the form \(\underbrace{\_H\_H\_H\_\cdots\_H}_{h\text{ spaces and }h\, H}\) so, we have \begin{align*} && \mathbb{P}(\text{wins}) &= \sum_{t = 0}^h \mathbb{P}(\text{wins and } t\text{ tails}) \\ &&&= \sum_{t = 0}^h\binom{h}{t} \left ( \frac{N}{N+1} \right)^h\left ( \frac{1}{N+1} \right)^t \\ &&&= \left ( \frac{N}{N+1} \right)^h \sum_{t = 0}^h\binom{h}{t}\left ( \frac{1}{N+1} \right)^t \cdot 1^{h-t} \\ &&&= \left ( \frac{N}{N+1} \right)^h \left ( 1 + \left ( \frac{1}{N+1} \right) \right)^h \\ &&&= \left ( \frac{N}{N+1} \right)^h \left ( \frac{N+2}{N+1}\right)^h \\ &&&= \frac{N^h(N+2)^h}{(N+1)^{2h}} \\ \Rightarrow && \E(\text{winnings}) &= h \cdot \frac{N^h(N+2)^h}{(N+1)^{2h}} \end{align*} If \(N = 2\), we have \begin{align*} && \E(\text{winnings}) &= E_h \\ &&&= h \cdot \frac{2^h\cdot2^{2h}}{3^{2h}}\\ &&&= h \cdot \frac{2^{3h}}{3^{2h}} \\ \Rightarrow && \frac{E_{h+1}}{E_h} &= \frac{h+1}{h} \frac{8}{9} \\ \end{align*} Therefore to maximise the winnings we should take \(h = 8\), and the expected winnings will be: \begin{align*} && E_8 &= 8 \cdot \frac{2^{24}}{3^{16}} \\ \Rightarrow && \log_3 E_8 &= 27 \log_3 2 - 16 \\ &&&\approx 24 \cdot 0.63 - 16 \\ &&&\approx 17 - 16 \\ &&&\approx 1 \\ \Rightarrow && E_8 &\approx 3 \end{align*}

2016 Paper 1 Q12
D: 1516.0 B: 1484.7

  1. Alice tosses a fair coin twice and Bob tosses a fair coin three times. Calculate the probability that Bob gets more heads than Alice.
  2. Alice tosses a fair coin three times and Bob tosses a fair coin four times. Calculate the probability that Bob gets more heads than Alice.
  3. Let \(p_1\) be the probability that Bob gets the same number of heads as Alice, and let~\(p_2\) be the probability that Bob gets more heads than Alice, when Alice and Bob each toss a fair coin \(n\) times. Alice tosses a fair coin \(n\) times and Bob tosses a fair coin \(n+1\) times. Express the probability that Bob gets more heads than Alice in terms of \(p_1\) and \(p_2\), and hence obtain a generalisation of the results of parts (i) and (ii).


Solution:

  1. There are several possibilities \begin{array}{c|c|c} \text{Alice} & \text{Bob} & P \\ \hline 0 & 1 & \frac1{2^2} \cdot 3 \cdot \frac{1}{2^3} = \frac{3}{2^5} \\ 0 & 2 & \frac1{2^2} \cdot 3 \cdot \frac{1}{2^3} = \frac{3}{2^5} \\ 0 & 3 & \frac1{2^2} \cdot \frac{1}{2^3} = \frac{1}{2^5} \\ 1 & 2 & 2 \cdot \frac1{2^2} \cdot 3 \cdot \frac{1}{2^3} = \frac{6}{2^5} \\ 1 & 3 & 2\cdot \frac1{2^2} \cdot \frac{1}{2^3} = \frac{2}{2^5} \\ 2 & 3 & \frac1{2^2} \cdot \frac{1}{2^3} = \frac{1}{2^5} \\ \hline && \frac{1}{2^5}(3+3+1+6+2+1) = \frac{16}{2^5} = \frac12 \end{array}
  2. There are several possibilities \begin{array}{c|c|c} A & B & \text{count} \\ \hline 0 & 1 & 4 \\ 0 & 2 & 6 \\ 0 & 3 & 4 \\ 0 & 4 & 1 \\ 1 & 2 & 3\cdot6 \\ 1 & 3 & 3\cdot4 \\ 1 & 4 & 3 \\ 2 & 3 & 3\cdot4 \\ 2 & 4 & 3 \\ 3 & 4 & 1 \\ \hline && 64 \end{array} Therefore the total probability is \(\frac12\)
  3. \(\mathbb{P}(\text{Bob more than Alice}) = p_1 \cdot \underbrace{\frac12}_{\text{he wins by breaking the tie on his last flip}} + p_2\) If \(p_3\) is the probability that Alice gets more heads than Bob, then by symmetry \(p_3 = p_2\) and \(p_1 + p_2 + p_3 = 1\). Therefore \(p_1 + 2p_2 = 1\). ie \(\frac12 p_1 + p_2 = \frac12\) therefore the answer is always \(\frac12\) for all values of \(n\).

2015 Paper 2 Q12
D: 1600.0 B: 1500.0

Four players \(A\), \(B\), \(C\) and \(D\) play a coin-tossing game with a fair coin. Each player chooses a sequence of heads and tails, as follows: Player A: HHT; Player B: THH; Player C: TTH; Player D: HTT. The coin is then tossed until one of these sequences occurs, in which case the corresponding player is the winner.

  1. Show that, if only \(A\) and \(B\) play, then \(A\) has a probability of \(\frac14\) of winning.
  2. If all four players play together, find the probabilities of each one winning.
  3. Only \(B\) and \(C\) play. What is the probability of \(C\) winning if the first two tosses are TT? Let the probabilities of \(C\) winning if the first two tosses are HT, TH and HH be \(p\), \(q\) and \(r\), respectively. Show that \(p=\frac12 +\frac12q\). Find the probability that \(C\) wins.


Solution:

  1. The only way \(A\) can win is if the sequence starts HH, if it does not start like this, then the only way HHT can appear is after a sequence of THH...H, but then THH has already appeared and \(B\) has won. Therefore the probability is \(\frac14\)
  2. If HH appears before TT then either \(A\) or \(B\) will win. If HH appears first, then \(A\) has a \(\frac14\) probability of winning. So \(A\): \(\frac18\), \(B:\), \(\frac38\), \(C:\), \(\frac18\), \(D: \frac38\)
  3. If the first two tosses are TT then \(C\) will win. If the first two tosses are HT, then either the next toss is T and \(C\) wins, or the next toss is H, and it's as if we started TH. ie \(p = \frac12 + \frac12 q\). If the first two tosses are TH, then either the next toss is H and \(C\) losses or the next toss is T and it's like starting HT. So \(q = \frac12 p\). Therefore \(p = \frac12 + \frac14p \Rightarrow p = \frac13\) If the first two tosses are HH, then eventually a T appears, and it's the same as starting HT. Therefore the probability \(C\) wins is: \(\frac14 + \frac14 \cdot \frac13 + \frac14 \cdot \frac16 + \frac14 \cdot \frac13 = \frac{11}{24}\)

2001 Paper 2 Q14
D: 1600.0 B: 1500.0

Two coins \(A\) and \(B\) are tossed together. \(A\) has probability \(p\) of showing a head, and \(B\) has probability \(2p\), independent of \(A\), of showing a head, where \(0 < p < \frac12\). The random variable \(X\) takes the value 1 if \(A\) shows a head and it takes the value \(0\) if \(A\) shows a tail. The random variable \(Y\) takes the value 1 if \(B\) shows a head and it takes the value \(0\) if \(B\) shows a tail. The random variable \(T\) is defined by \[ T= \lambda X + {\textstyle\frac12} (1-\lambda)Y. \] Show that \(\E(T)=p\) and find an expression for \(\var(T)\) in terms of \(p\) and \(\lambda\). Show that as \(\lambda\) varies, the minimum of \(\var(T)\) occurs when \[ \lambda =\frac{1-2p}{3-4p}\;. \] The two coins are tossed \(n\) times, where \(n>30\), and \(\overline{T}\) is the mean value of \(T\). Let \(b\) be a fixed positive number. Show that the maximum value of \(\P\big(\vert \overline{T}-p\vert < b\big)\) as \(\lambda\) varies is approximately \(2\Phi(b/s)-1\), where \(\Phi\) is the cumulative distribution function of a standard normal variate and \[ s^2= \frac{p(1-p)(1-2p)}{(3-4p)n}\;. \]


Solution: \begin{align*} && \E[T] &= \E[\lambda X + \tfrac12(1-\lambda)Y] \\ &&&= \lambda \E[X] + \tfrac12(1-\lambda) \E[Y] \\ &&&= \lambda p + \tfrac12 (1-\lambda) 2p \\ &&&= p \\ \\ && \var[T] &= \var[\lambda X + \tfrac12(1-\lambda)Y] \\ &&&= \lambda^2 \var[X] + \tfrac14(1-\lambda)^2 \var[Y] \\ &&&= \lambda^2 p(1-p) + \tfrac14(1-\lambda)^22p(1-2p) \\ &&&= p(\lambda^2 + \tfrac12(1-\lambda)^2) -p^2(\lambda^2+(1-\lambda)^2)\\ &&&= p(\tfrac32\lambda^2 - \lambda + \tfrac12) -p^2(2\lambda^2 -2\lambda + 2) \end{align*} Differentiating \(\var[T]\) with respect to \(\lambda\), and noting it is a quadratic with positive leading coefficient, we get \begin{align*} && \frac{\d \var[T]}{\d \lambda} &= p(2\lambda -(1-\lambda)) - p^2(2 \lambda -2(1-\lambda)) \\ &&&= p(3\lambda - 1)-p^2(4\lambda - 2) \\ \Rightarrow && \lambda(4p-3) &= 2p-1 \\ \Rightarrow && \lambda &= \frac{1-2p}{3-4p} \end{align*} By the central limit theorem \(\overline{T} \sim N(p, \frac{\sigma^2}{n})\) in particular, \(\mathbb{P}(|\overline{T} - p| < b) = \mathbb{P}(\left \lvert |\frac{\overline{T}-p}{\frac{\sigma}{\sqrt{n}}} \right \lvert < \frac{b}{\frac{\sigma}{\sqrt{n}}}) = \mathbb{P}(|Z| < \frac{b\sqrt{n}}{\sigma}) = 2\Phi(b/s) - 1\) where \(s = \frac{\sigma}{\sqrt{n}}\) so \begin{align*} && s^2 &= \frac1n \sigma^2 \\ &&&= \frac1n \left ( \left (\left ( \frac{1-2p}{3-4p} \right)^2 + \tfrac12 \left (1-\frac{1-2p}{3-4p} \right)^2 \right)p - \left ( \left ( \frac{1-2p}{3-4p} \right)^2 + \left (1-\frac{1-2p}{3-4p} \right)^2\right)p^2 \right) \\ &&&= \frac1n \left ( \left (\left ( \frac{1-2p}{3-4p} \right)^2 + \tfrac12 \left (\frac{2-2p}{3-4p} \right)^2 \right)p - \left ( \left ( \frac{1-2p}{3-4p} \right)^2 + \left (\frac{2-2p}{3-4p} \right)^2\right)p^2 \right) \\ &&&= \frac{p}{n(3-4p)^2} \left ( (1 -4p + 4p^2 + 2-4p+2p^2) - (1-4p+4p^2+4-8p+4p^2)p \right) \\ &&&= \frac{p}{n(3-4p)^2} \left (3-13p+18p^2-8p^3 \right) \\ &&&= \frac{p}{n(3-4p)^2} (3-4p)(1-2p)(1-p) \\ &&&= \frac{p(1-p)(1-2p)}{(3-4p)n} \end{align*}

1993 Paper 3 Q15
D: 1700.0 B: 1501.5

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*}

1990 Paper 1 Q15
D: 1500.0 B: 1591.4

A coin has probability \(p\) (\(0 < p < 1\)) of showing a head when tossed. Give a careful argument to show that the \(k\)th head in a series of consecutive tosses is achieved after exactly \(n\) tosses with probability \[ \binom{n-1}{k-1}p^{k}(1-p)^{n-k}\qquad(n\geqslant k). \] Given that it took an even number of tosses to achieve exactly \(k-1\) heads, find the probability that exactly \(k\) heads are achieved after an even number of tosses. If this coin is tossed until exactly 3 heads are obtained, what is the probability that exactly 2 of the heads occur on even-numbered tosses?


Solution: We must have a sequence consisting of \(\underbrace{HTT\cdots TH}_{k-1\text{ heads and }n-k\text{ tails}}\underbrace{H}_{k\text{th head}}\). There are \(\binom{n-1}{k-1}\) ways to chose how to place the \(k-1\) heads in the first \(n-1\) flips, and each sequence has probability \(p^{k-1}(1-p)^{n-k}p\) which gives a probability of \(\displaystyle \binom{n-1}{k-1} p^k (1-p)^{n-k}\). Given that it took an even number of tosses to achieve \(k-1\) heads, this is equivalent to the problem of what is the probability that the first head occurs on an even flip, ie \begin{align*} \mathbb{P}(\text{even flip}) &= \mathbb{P}(2\text{nd flip}) +\mathbb{P}(4\text{th flip}) +\mathbb{P}(6\text{th flip}) + \cdots \\ &= (1-p)p + (1-p)^3p + (1-p)^5p + \cdots \\ &= (1-p)p \left ( \sum_{r=0}^\infty (1-p)^{2r}\right) \\ &= \frac{p(1-p)}{1-(1-p)^2} \\ &= \frac{p(1-p)}{2p-p^2} \\ &= \frac{1-p}{2-p} \end{align*} The ways to achieve \(2\) heads on even tosses are \(EEO\), \(EOE\), \(OEE\). The probability of going from \(O\) to \(E\) is the same as the initial probability of an \(O\) flip, etc. Therefore \begin{align*} \mathbb{P}(EEO) &=\left( \frac{1-p}{2-p} \right)^2 \left ( 1- \frac{1-p}{2-p} \right) \\ &= \left( \frac{1-p}{2-p} \right)^2 \left ( \frac{1}{2-p} \right) \\ \mathbb{P}(EOE) &= \left( \frac{1-p}{2-p} \right) \left ( \frac{1}{2-p} \right)^2 \\ \mathbb{P}(OEE) &= \left ( \frac{1}{2-p} \right)^2 \left( \frac{1-p}{2-p} \right)\\ \mathbb{P}(2 \text{ heads on even tosses}) &= \frac{(1-p)^2 + 2(1-p)}{(2-p)^3} \\ &= \frac{(1-p)(2-p)}{(2-p)^3} \\ &= \frac{1-p}{(2-p)^2} \end{align*}