Processing math: 100%

You are here

Thomas Simpson and Maxima and Minima - Ship and boat

Author(s): 
Michel Helfgott

Suppose a ship to sail from a given place A, in a given direction AQ, at the same time that a boat, from another given place B, sets out in order (if possible) to come up with her, and supposing the rate at which each vessel runs to be given; it is required to find in what direction the latter must proceed, so that if it cannot come up with the former, it may, however, approach it as near as possible (problem XV, page 32).

 

Let m be the constant velocity of the ship and n the constant velocity of the boat. If nm, the boat will eventually meet the ship, so we may assume that m>n. After a certain time t, the ship is at D while the cotemporary point for the boat is at F. It is to be noted that all points on the circumference centered at B and radius BF are cotemporary with F, but the boat should follow the path ¯BFD since any other path ¯BFD, with F on the circumference, is longer.

 

We need to minimize DF. Let ¯BC be the perpendicular to ¯AQ. Define AC=a,BC=b,CD=x, and DF=d. Since D and F are cotemporary and time = distance/velocity we can conclude that ADm=BFn.

Thus BF=nm(a+x), and consequently

d(x)=BD=BF=b2+x2na+nxm.

Therefore

d(x)=xb2+x2nm.

Making d(x)=0, we get x=nbm2n2, the value at which d(x) attains its minimum.

 

Remarks: We note that

α=arctannm2n2

while

d(nbm2n2)=bm2n2nam.

So, the problem can be solved provided bm2n2na0. What happens if bm2n2na=0? This equality implies DF=0. In other words, the boat meets the ship if it takes the direction determined by the angle

α=arctannm2n2

and bm2n2na=0. Whenever bm2n2na>0, we can be certain that

bm2n2nam

is the minimum distance that can be achieved.

Editor’s Note: This article was published in 2005.

Michel Helfgott, "Thomas Simpson and Maxima and Minima - Ship and boat," Convergence (August 2010)