If the minimum distance of the point from the cone is , where and are prime numbers, find .
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.
Let's focus on the upper-half cone ( z ≥ 0 ) for the purpose of this minimization problem. Taking a point P ( x 0 , y 0 , x 0 2 + y 0 2 ) on the cone's surface, let the distance from P to ( 1 , 2 , 0 ) be the function:
l ( x 0 , y 0 ) = ( x 0 − 1 ) 2 + ( y 0 − 2 ) 2 + ( x 0 2 + y 0 2 ) = 2 x 0 2 − 2 x 0 + 2 y 0 2 − 4 y 0 + 5 (i).
Taking ∇ l ( x 0 , y 0 ) = 0 yields:
∂ x 0 ∂ l = 2 2 x 0 2 − 2 x 0 + 2 y 0 2 − 4 y 0 + 5 4 x 0 − 2 = 0 ⇒ x 0 = 2 1 ,
∂ y 0 ∂ l = 2 2 x 0 2 − 2 x 0 + 2 y 0 2 − 4 y 0 + 5 4 y 0 − 4 = 0 ⇒ y 0 = 1
Finally, calculating the Hessian matrix of l at the critical point Q ( 2 1 , 1 ) yields:
L ( 2 1 , 1 ) = [ l x 0 x 0 l y 0 x 0 l x 0 y 0 l y 0 y 0 ] = [ 5 4 0 0 5 4 ] = 5 4 ⋅ I 2 x 2
which is positive-definite at Q . Hence, the minimum distance from P to ( 1 , 2 , 0 ) computes to l ( 2 1 , 1 ) = 2 5 .