A chain of mass \(m\) and length \(l\) is composed of \(n\) small smooth links. It is suspended vertically over a horizontal table with its end just touching the table, and released so that it collapses inelastically onto the table. Calculate the change in momentum of the \((k+1)\)th link from the bottom of the chain as it falls onto the table. Write down an expression for the total impulse sustained by the table in this way from the whole chain. By approximating the sum by an integral, show that this total impulse is approximately \[ {\textstyle \frac23} m \surd(2gl) \] when \(n\) is large.
Calculate the moment of inertia of a uniform thin circular hoop of mass \(m\) and radius \(a\) about an axis perpendicular to the plane of the hoop through a point on its circumference. The hoop, which is rough, rolls with speed \(v\) on a rough horizontal table straight towards the edge and rolls over the edge without initially losing contact with the edge. Show that the hoop will lose contact with the edge when it has rotated about the edge of the table through an angle \(\theta\), where \[ \cos\theta = \frac 12 +\frac {v^2}{2ag}. \] %Give the corresponding result for a smooth hoop and table.
In the game of endless cricket the scores \(X\) and \(Y\) of the two sides are such that \[ \P (X=j,\ Y=k)=\e^{-1}\frac{(j+k)\lambda^{j+k}}{j!k!},\] for some positive constant \(\lambda\), where \(j,k = 0\), \(1\), \(2\), \(\ldots\).
Solution:
The cakes in our canteen each contain exactly four currants, each currant being randomly placed in the cake. I take a proportion \(X\) of a cake where \(X\) is a random variable with density function \[{\mathrm f}(x)=Ax\] for \(0\leqslant x\leqslant 1\) where \(A\) is a constant.
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}. $$
How many integers between \(10\,000\) and \(100\,000\) (inclusive) contain exactly two different digits? (\(23\,332\) contains exactly two different digits but neither of \(33\,333\) and \(12\,331\) does.)
Solution: First consider \(5\) digit numbers containing at most \(2\) non-zero digits. Then there are \(\binom{9}{2}\) ways to choose the two digits, and \(2^{5}-2\) different ways to arrange them, removing the ones which are all the same. Considering all the pairs including zero, there are \(9\) ways to choose the non-zero (first) digit. There are \(2^4-1\) remaining digits where not all the numbers are the same. Finally we must not forget \(100\,000\). Therefore there are \(\binom{9}{2}(2^5-2) +9\cdot(2^4-1) + 1 = 1216\)
Show, by means of a suitable change of variable, or otherwise, that \[ \int_{0}^{\infty}\mathrm{f}((x^{2}+1)^{1/2}+x)\,{\mathrm d}x =\frac{1}{2} \int_{1}^{\infty}(1+t^{-2})\mathrm{f}(t)\,{\mathrm d}t. \] Hence, or otherwise, show that \[ \int_{0}^{\infty}((x^{2}+1)^{1/2}+x)^{-3}\,{\mathrm d}x =\frac{3}{8}. \]
Solution: \begin{align*} && t &= (x^2+1)^{1/2}+x \\ && 1&=t^2-2tx \\ && x &= \frac{t^2-1}{2t} = \frac12 \left (t - \frac1t\right) \\ && \frac{\d x}{\d t} &= \frac12 \left ( 1+ \frac{1}{t^2} \right) \\ \Rightarrow && \int_0^{\infty} f((x^2+1)^{1/2}+x) \d x &= \int_{t=1}^{t = \infty}f(t) \frac12(1 + t^{-2}) \d t\\ &&&= \frac12 \int_1^{\infty}(1+t^{-2})f(t) \d t \end{align*} \begin{align*} \int_{0}^{\infty}((x^{2}+1)^{1/2}+x)^{-3}\,{\mathrm d}x &= \frac12 \int_1^{\infty}(1+t^{-2})t^{-3} \d t \\ &= \frac12 \left [\frac{-1}{2}t^{-2}-\frac{1}{4}t^{-4} \right]_{1}^{\infty} \\ &= \frac12 \left ( \frac12 + \frac14\right) = \frac38 \end{align*}
Which of the following statements are true and which are false? Justify your answers.
Solution:
Prove that the rectangle of greatest perimeter which can be inscribed in a given circle is a square. The result changes if, instead of maximising the sum of lengths of sides of the rectangle, we seek to maximise the sum of \(n\)th powers of the lengths of those sides for \(n\geqslant 2\). What happens if \(n=2\)? What happens if \(n=3\)? Justify your answers.
Solution: We can always rotate the circle so that sides are parallel to the \(x\) and \(y\) axes. Therefore if one corner is \((a,b)\) the other coordinates are \((-a,b), (a,-b), (-a,-b)\) and the perimeter will be \(4(a+b)\). Therefore we wish to maximise \(4(a+b)\) subject to \(a^2+b^2 = \text{some constant}\). Notice that \(\frac{a+b}{2} \leq \sqrt{\frac{a^2+b^2}{2}}\) with equality when \(a = b\), therefore the maximum is a square. If \(n = 2\) then we are looking at \(2((2a)^2+(2b)^2) = 8(a^2+b^2)\) which is constant for all rectangles. If \(n=3\) we are maximising \(16(a^3+b^3) = 16(a^3+(c^2-a^2)^{3/2})\) which is maximised when \(a = 0, c\)
Solution: