In the coordinate system, an ellipsoid surface is defined by the following equation:
There is a test point at . Define a tangent line segment as a finite line segment which has one end at the test point , with the other end at a point on the surface, and which is perpendicular to the surface normal vector at the point of intersection.
Find the sum of the lengths of the longest and shortest possible tangent line segments (to 3 decimal places).
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.
A normal to the ellipsoid f ( x , y , z ) = 1 0 0 1 x 2 + 2 5 1 y 2 + ! 6 9 1 z 2 = 1 at the point r = ⎝ ⎛ x y z ⎠ ⎞ is n = 2 1 ∇ f = ⎝ ⎛ 1 0 0 1 x 2 5 1 y 1 6 9 1 z ⎠ ⎞ and so the condition for the point r to be the position vector of an end of a tangent segment is n ⋅ ⎣ ⎡ ⎝ ⎛ 7 1 1 2 0 ⎠ ⎞ − r ⎦ ⎤ = 0 and hence that 1 0 0 7 x + 2 5 1 1 y + 1 6 9 2 0 z = 1 Thus we need to maximize and minimize ( x − 7 ) 2 + ( y − 1 1 ) 2 + ( z − 2 0 ) 2 subject to the pair of constraints 1 0 0 1 x 2 + 2 5 1 y 2 + 1 6 9 1 z 2 = 1 0 0 7 x + 2 5 1 1 y + 1 6 9 2 0 z = 1 Solving these problems numerically, we see that the maximum value is M = 2 8 . 8 4 6 1 , occurring at ( 0 . 8 8 9 2 4 2 , 4 . 1 0 4 0 8 , − 7 . 3 3 4 9 6 ) , while the minimum value is m = 1 5 . 3 5 8 1 , occurring at ( 2 . 9 0 9 8 1 , − 1 . 3 9 0 8 8 , 1 1 . 9 0 0 1 ) .
Thus the answer is M + m = 4 4 . 2 0 4 to 3 decimal places.