The helicopter of your enemy is flying along the trajectory of the curve y = x 2 + 7 . If a soldier standing at ( 3 , 7 ) wants to shoot the helicopter when it is nearest to him, find square of the nearest distance.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great solution. Thanks!
I think it should be ( x − 1 ) ( 2 x 2 + 2 x + 3 ) instead of ( x − 1 ) ( x 2 + 2 x + 3 ) .
By translating the problem by ( 0 , − 7 ) , it is equivalent to minimize the distance between the points ( x , x 2 ) and ( 3 , 0 ) . Then, the minimum euclidian distance squared between these points is : min x ∈ R ( x − 3 ) 2 + x 4 .
By denoting g ( x ) = ( x − 3 ) 2 + x 4 , its derivative is :
d x d g ( x ) = ( 4 x 3 + 2 x − 6 ) = ( x − 1 ) ( 4 x 2 + 4 x + 6 ) , which has only one root at x = 1 . Consequently, since g is strictly convex (the derivative of g is positive), the minimum distance squared is given by :
( 3 − 1 ) 2 + 1 4 = 2 2 + 1 = 5 .
Problem Loading...
Note Loading...
Set Loading...
The closest distance between the helicopter and the soldier is when the normal to the curve passes ( 3 , 7 ) .
Equation of normal to any point ( x , y ) on the curve passing through ( 3 , 7 ) is:
d x d y ( y ) + ( x ) = d x d y ( 7 ) + ( 3 )
But for a point on the curve, y = x 2 + 7 , substituting this and solving for x :
⇒ 2 x ( x 2 + 7 ) + ( x ) = 2 x ( 7 ) + ( 3 )
⇒ 2 x 3 + x − 3 = 0
⇒ ( x − 1 ) ( 2 x 2 + 2 x + 3 ) = 0
The quadratic equation has no real roots, so x = 1 is the only solution.
Hence, ( 1 , 8 ) is the point where the helicopter is closest to the soldier and the square of the distance between them is:
⇒ ( 8 − 7 ) 2 + ( 1 − 3 ) 2 = 5