At noon, aircraft carrier Alpha is 100 kilometers due east of destroyer Beta. Alpha is sailing due west at 12 kilometers per hour. Beta is sailing south at 10 kilometers per hour. In how many hours will the distance between the ships be at a minimum?
Answers
Let's define the coordinates in this space, assuming the Earth is large enough for this problem to follow Euclidean geometry (to take into account spherical shape of our planet would significantly complicate the issue, but, in theory, might be considered).
We will assign East as the positive direction of the X-axis and North as the positive direction of the Y-axis.
The origin of coordinates we put at the initial location at noon of destroyer Beta. So, at noon Beta is at position
In our case the square of a distance between the ships at moment
t equals: d 2 = ( 100 -12 t ) 2 + ( 10 t ) 2 = 244 t 2 − 2400 t + 10000
Graphically, it is a parabola that tends to positive infinity as
t
increases to infinity. It intersects the Y-axis at point
Y
=
10000
at time
t
=
0
, as it should.
Obviously, the minimum of a square of a distance is reached at the same point as the minimum of a distance.
Therefore, to minimize the distance, we will find a moment in time
t
that minimizes the square of a distance expressed by the above formula.
For a general quadratic function
a x 2 + b x + c
the extreme (minimum or maximum) is reached when
x = − b 2
a since the first derivative of this function is 2 a x + b and it's equal to zero atx =− b 2 a
The square of a distance is a quadratic polynomial with negative discriminant
d =2400− 4⋅ 244 ⋅ 10000 = − 4000000
. It means, it never equal to zero and remains always positive (as at t = 0 ). It's minimum is reached at point t = 2400 2 ⋅ 244 ≅ 4.918 .
So, the minimum distance will be achieved after approximately 4.918 (almost 5 ) hours into the trip. The square of a distance at t = 4.918 hours equals to 244 ⋅ 4.918 2 2400 ⋅ 4.918 + 10000 ≅ 4098.36
And the minimum distance d ≅ √
4098.36 ≅ 64 km.