Given the ellipsoid
1 0 2 x 2 + 1 5 2 y 2 + 2 0 2 z 2 = 1
and a plane whose equation is given by x + y + z = 4 5 , we want to find the minimum distance d ∗ , between a point P = ( x 1 , y 1 , z 1 ) on the plane and a point Q = ( x 2 , y 2 , z 2 ) on the ellipsoid. If the minimum occurs with P ∗ = ( x 1 ∗ , y 1 ∗ , z 1 ∗ ) , and Q ∗ = ( x 2 ∗ , y 2 ∗ , z 2 ∗ ) , then report the value of ⌊ 1 0 0 ( x 1 ∗ + y 1 ∗ + z 1 ∗ + x 2 ∗ + y 2 ∗ + z 2 ∗ + d ∗ ) ⌋ , where ⌊ ⋅ ⌋ is the floor function, for example, ⌊ 7 . 6 ⌋ = 7 .
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.
Problem Loading...
Note Loading...
Set Loading...
First, let's analyze what is being asked in the problem. Notice that x 1 ∗ + y 1 ∗ + z 1 ∗ = 4 5 regardless of the values, and that d ∗ can be obtained from the values of x 2 ∗ , y 2 ∗ , z 2 ∗ by using the formula that computes the distance between a point and a plane. Thus, I will focus only on finding the values of x 2 ∗ , y 2 ∗ . z 2 ∗ . The rest is a trivial computation.
Let's say that the points in the ellipse are ( x , y , z ) and the points in the plane are ( a , b , c ) . We want to minimize the squared distance function F ( x , y , z , a , b , c ) = ( x − a ) 2 + ( y − b ) 2 + ( z − c ) 2 . We know from Lagrange Multipliers that extreme values occur at points such that ∇ F = μ ∇ ( a + b + c − 4 5 ) + λ ∇ ( 1 0 2 x 2 + 1 5 2 y 2 + 2 0 2 z 2 − 1 ) .
Let's now carefully analyze this. We notice that F x = F a = 2 ( x − a ) . And the equation says that 2 ( x − a ) = λ 1 0 2 2 x and 2 ( x − a ) = μ . But we can combine both of these expressions to get λ μ = 1 0 2 2 x . Division by λ is valid because if λ = 0 we would have 2 ( x − a ) = 0 ⟹ x = a . But then we would have also y = b , z = c which would imply an intersection between the surfaces exist. No such intersection exists (but notice that if it did, then this would give the solution with distance 0). So we can conclude that λ μ = 1 0 2 2 x . But what we did with x , a we can also do with y , b and z , c . So what we actually have is that λ μ = 1 0 2 2 x = 1 5 2 2 y = 2 0 2 2 z .
Using the previous result, with some algebra we can write 1 0 2 x 2 + 1 5 2 y 2 + 2 0 2 z 2 = x 2 ( 1 0 2 1 + 1 0 4 1 5 2 + 1 0 4 2 0 2 ) . But this implies that x 2 ( 1 0 2 1 + 1 0 4 1 5 2 + 1 0 4 2 0 2 ) = 1 ⟹ x 2 = 2 9 4 0 0 ⟹ x = ± 2 9 2 0 . Then ( x 2 ∗ , y 2 ∗ , z 2 ∗ ) = 2 9 ± ( 2 0 , 4 5 , 8 0 ) .
To find which sign we have to use, just compute the distance for both. If we pick the positive sign, we get d ≈ 1 0 while the negative sign gives d ≈ 4 0 . Thus the values we want are 2 9 1 ( 2 0 , 4 5 , 8 0 ) .