As part of a firework display a shell is fired vertically upwards with velocity \(v\) from a point on a level stretch of ground. When it reaches the top of its trajectory an explosion it splits into two equal fragments each travelling at speed \(u\) but (since momentum is conserved) in exactly opposite (not necessarily horizontal) directions. Show, neglecting air resistance, that the greatest possible distance between the points where the two fragments hit the ground is \(2uv/g\) if \(u\leqslant v\) and \((u^{2}+v^{2})/g\) if \(v\leqslant u.\)
Solution: Since \(v^2 - u^2 = 2as\) we have the initial height reached is \(\frac{v^2}{2g}\). At the point of explosion, the velocities are \(\pm \binom{u \cos \theta}{u \sin \theta}\) where \(0 \leq \theta < \frac{\pi}{2}\). Looking vertically: \begin{align*} && -\frac{v^2}{2g} &= \pm u \sin \theta t - \frac12gt^2 \\ \Rightarrow && t &= \frac{\mp u \sin \theta \pm \sqrt{u^2 \sin^2 \theta - 4 \cdot \left (-\frac12 g \right) \cdot (\frac{v^2}{2g})}}{2(-\frac12g)} \\ &&&= \frac{\pm u \sin \theta \mp \sqrt{u^2 \sin^2 \theta+v^2}}{g}\\ &&&= \frac{\pm u \sin \theta +\sqrt{u^2 \sin^2 \theta+v^2}}{g} \end{align*} Since we always want the positive \(t\). Then the horizontal distance travelled will be \begin{align*} && s &= u \cos \theta (t_1 + t_2) \\ &&&= u \cos \theta \frac{2\sqrt{u^2 \sin^2 \theta+v^2}}{g} \\ &&&= \frac{2u \cos \theta \sqrt{u^2 \sin^2 \theta + v^2}}{g} \\ &&s^2 &= \frac{4u^2}{g^2} \cos^2 \theta ({u^2 \sin^2 \theta + v^2}) \\ &&&= \frac{4u^2}{g^2} \left (-u^2\cos^4 \theta + (v^2+u^2)\cos^2 \theta \right) \\ &&&= \frac{4u^2}{g^2} \left (-u^2\left ( \cos^2 \theta - \frac{v^2+u^2}{2u^2}\right)^2 + \frac{(v^2+u^2)^2}{4u^2} \right) \\ &&&= \frac{(v^2+u^2)^2}{g^2} - \frac{4u^4}{g^2}\left ( \cos^2 \theta - \frac{v^2+u^2}{2u^2}\right)^2 \end{align*} If \(u \geq v\) then such a \(\theta\) exists such that we can achieve the maximum, ie \(s = \frac{v^2+u^2}{g}\). If not, then we will achieve our maximum when \(\cos \theta = 1\), ie \(\sin \theta = 0\) and \(s = \frac{2uv}{g}\)
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: