Hank’s Gold Mine has a very long vertical shaft of height . A light chain of length passes over a small smooth light ﬁxed pulley at the top of the shaft. To one end of the chain is attached a bucket of negligible mass and to the other a bucket of mass .
The system is used to raise ore from the mine as follows. When bucket is at the top it is ﬁlled with mass of water and bucket is ﬁlled with mass of ore, where . The buckets are then released, so that bucket descends and bucket ascends. When bucket reaches the top both buckets are emptied and released, so that bucket descends and bucket ascends. The time to ﬁll and empty the buckets is negligible. Find the time taken from the moment bucket is released at the top until the ﬁrst time it reaches the top again.
This process goes on for a very long time. Show that, if the greatest amount of ore is to be raised in that time, then must satisfy the condition where
One way of working out the acceleration of a system of two masses connected by a light string passing over a pulley is to write down the equation of motion of each mass, bearing in mind that the force due to tension will be the same for each mass (it cannot vary along the string, because then the acceleration of some portion of the massless string would be inﬁnite). Then you eliminate the tension.
Alternatively, you can use the equation of motion of the system of two joined masses. The system has inertial mass equal to the sum of the masses (because both masses must accelerate equally) but gravitational mass equal to the difference of the masses (because the gravitational force on one mass cancels, partially, the gravitational force on the other), so the equation of motion is just (Newton’s law of motion)
Solution to problem 55
When bucket ascends, the acceleration is .
For bucket ’s downward journey, at acceleration , the equations of motion for bucket and bucket , respectively, are
where is the tension in the rope. Eliminating gives so .
The time of descent (using ) is and the time of ascent is . The total time required for one complete cycle is therefore
Call this . The number of round trips in a long time is so the amount of ore lifted in time is .
To maximise this, we have to maximise with respect to , and is exactly the given. Note that (which makes sense because no ore is raised if ), and (which also makes sense because the buckets don’t move on the raising stage if ). That means the greatest value of must occur at a value of in the range at which .
You may have wondered why, in the last part, the question says that the process goes on for a very long time. The reason for this is that when you maximise what I have called the result may not correspond to a complete number of cycles. If you stop in mid-cycle, you raise no ore from that cycle so a calculus maximisation of a continuous function is not the right method. However, if the process continues for many cycles, the contribution from the last cycle becomes negligible, and a calculus maximisation becomes appropriate.
You may also wonder why you were not asked to ﬁnd the maximising value of . If you are feeling exceptionally energetic, you could try to solve . This will eventually lead you to the rather discouraging quartic equation
You will have done a lot of tedious work to obtain an equation that cannot be solved without either a formula for the solutions of a general quartic equation or a computer. There are in fact two real solutions of this equation, and .