A uniform ladder of length \(l\) and mass \(m\) rests with one end in contact with a smooth ramp inclined at an angle of \(\pi/6\) to the vertical. The foot of the ladder rests, on horizontal ground, at a distance \(l/\sqrt{3}\) from the foot of the ramp, and the coefficient of friction between the ladder and the ground is \(\mu.\) The ladder is inclined at an angle \(\pi/6\) to the horizontal, in the vertical plane containing a line of greatest slope of the ramp. A labourer of mass \(m\) intends to climb slowly to the top of the ladder.
Solution:
A smooth billiard ball moving on a smooth horizontal table strikes another identical ball which is at rest. The coefficient of restitution between the balls is \(e(<1)\). Show that after the collision the angle between the velocities of the balls is less than \(\frac{1}{2}\pi.\) Show also that the maximum angle of deflection of the first ball is \[ \sin^{-1}\left(\frac{1+e}{3-e}\right). \]
Solution:
A goalkeeper stands on the goal-line and kicks the football directly into the wind, at an angle \(\alpha\) to the horizontal. The ball has mass \(m\) and is kicked with velocity \(\mathbf{v}_{0}.\) The wind blows horizontally with constant velocity \(\mathbf{w}\) and the air resistance on the ball is \(mk\) times its velocity relative to the wind velocity, where \(k\) is a positive constant. Show that the equation of motion of the ball can be written in the form \[ \frac{\mathrm{d}\mathbf{v}}{\mathrm{d}t}+k\mathbf{v}=\mathbf{g}+k\mathbf{w}, \] where \(\mathbf{v}\) is the ball's velocity relative to the ground, and \(\mathbf{g}\) is the acceleration due to gravity. By writing down horizontal and vertical equations of motion for the ball, or otherwise, find its position at time \(t\) after it was kicked. On the assumption that the goalkeeper moves out of the way, show that if \(\tan\alpha=\left|\mathbf{g}\right|/(k\left|\mathbf{w}\right|),\) then the goalkeeper scores an own goal.
Solution: Applying \(\mathbf{F} = m\mathbf{a} = m \frac{\d \mathbf{v}}{dt}\) we have: \begin{align*} && m \frac{\d \mathbf{v}}{d t} &= m\mathbf{g} - mk(\mathbf{v} - \mathbf{w}) \\ \Rightarrow && \frac{\d \mathbf{v}}{d t} +k \mathbf{v} &= \mathbf{g} + k \mathbf{w} \\ \\ \Rightarrow && e^{k t} \l \frac{\d \mathbf{v}}{d t} +k \mathbf{v} \r &= e^{kt} ( \mathbf{g} + k \mathbf{w}) \\ \Rightarrow && \frac{\d}{\d t} \l e^{kt} \mathbf{v} \r &= e^{kt}( \mathbf{g} + k \mathbf{w}) \\ \Rightarrow && e^{kt} \mathbf{v} &= \frac{1}ke^{kt}( \mathbf{g} + k \mathbf{w}) + c \\ \Rightarrow && \mathbf{v}_0 &= \frac{1}{k} ( \mathbf{g} + k \mathbf{w})+c \\ \Rightarrow && \mathbf{v} &= e^{-kt} \l \mathbf{v_0} - \frac{1}{k}\mathbf{g} - \mathbf{w} \r + \frac{1}{k} \mathbf{g} + \mathbf{w} \\ \Rightarrow && \mathbf{x} &= -\frac{1}{k}e^{-kt} \l \mathbf{v_0} - \frac{1}{k}\mathbf{g} - \mathbf{w} \r + \frac{1}{k} \mathbf{g}t + \mathbf{w}t+C \\ \Rightarrow && \mathbf{0} &= -\frac{1}{k} \l \mathbf{v_0} - \frac{1}{k}\mathbf{g} - \mathbf{w} \r + C \\ \Rightarrow && \mathbf{x} &= \frac1{k}\l 1- e^{-kt} \r\l \mathbf{v_0} - \frac{1}{k}\mathbf{g} - \mathbf{w} \r + \frac{1}{k} \mathbf{g}t + \mathbf{w}t \end{align*} Position at time \(t\) is: \begin{align*} && x_x &= \frac1{k} ( 1-e^{-kt})(u_x - w)+wt \\ && x_y &= \frac1{k} ( 1-e^{-kt})(u_x \frac{g}{kw} - \frac{g}{k})+\frac{1}{k}gt \\ &&&= \frac{g}{kw} \left ( ( 1-e^{-kt})(u_x - w)+wt \right) \\ &&&= \frac{g}{kw} x_x \end{align*} Therefore if \(x_x\) is ever \(0\) then \(x_y\) will also be zero. But the ball must eventually hit the ground, and when it does, it will be in the process of scoring an own goal.
A small heavy bead can slide smoothly in a vertical plane on a fixed wire with equation \[ y=x-\frac{x^{2}}{4a}, \] where the \(y\)-axis points vertically upwards and \(a\) is a positive constant. The bead is projected from the origin with initial speed \(V\) along the wire.
Solution:
Each day, books returned to a library are placed on a shelf in order of arrival, and left there. When a book arrives for which there is no room on the shelf, that book and all books subsequently returned are put on a trolley. At the end of each day, the shelf and trolley are cleared. There are just two-sizes of book: thick, requiring two units of shelf space; and thin, requiring one unit. The probability that a returned book is thick is \(p\), and the probability that it is thin is \(q=1-p.\) Let \(M(n)\) be the expected number of books that will be put on the shelf, when the length of the shelf is \(n\) units and \(n\) is an integer, on the assumption that more books will be returned each day than can be placed on the shelf. Show, giving reasoning, that
Solution:
Balls are chosen at random without replacement from an urn originally containing \(m\) red balls and \(M-m\) green balls. Find the probability that exactly \(k\) red balls will be chosen in \(n\) choices \((0\leqslant k\leqslant m,0\leqslant n\leqslant M).\) The random variables \(X_{i}\) \((i=1,2,\ldots,n)\) are defined for \(n\leqslant M\) by \[ X_{i}=\begin{cases} 0 & \mbox{ if the \(i\)th ball chosen is green}\\ 1 & \mbox{ if the \(i\)th ball chosen is red. } \end{cases} \] Show that
Solution: There are \(\displaystyle \binom{m}{k} \binom{M-m}{n-k}\) ways to choose \(k\) red and and \(n-k\) green balls out of a total \(\displaystyle \binom{M}{n}\) ways to choose balls. Therefore the probability is: \[ \mathbb{P}(\text{exactly }k\text{ red balls in }n\text{ choices}) = \frac{\binom{m}{k} \binom{M-m}{n-k}}{ \binom{M}{n}}\]