There are four points on the plane, .Choose a point and so the sum of the distances is minimized. Of course,now point is at .
If we add one more point ,and choose a point so the sum of the distances is minimized. When is at different places,point will change its position,too.
So,what is the maximum distance from to the origin?
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.
I expect a better solution will come but here's what I did. I was surprised that P had a maximum, but it does. My solution also uses calculus, so unless this can be solved without calculus, the category should be changed.
Importantly, I was able to convince myself using Geometer's Sketchpad, but I do not have a proof, P is maximized when E is on the X-axis and P will also be on the X-axis. So this solution should not be considered complete.
E = ( a , 0 ) where a > 1 and P = ( x , 0 )
P A = ( x − 1 ) , P B = ( x + 1 ) , P C = x 2 + 1 2 , P D = x 2 + ( − 1 ) 2 , P E = ( a − x )
Sum of distances as a function of x is T ( x ) = a + 2 − x + 2 x 2 + 1 . Check graphically there is a mimimum around x = 0 . 5 8
T ′ ( x ) = − 1 + x 2 + 1 2 x
Surprisingly the a is gone, implying this minimum doesn't depend on a (I had expected a limiting value for P )
Solving T ′ ( x ) = 0 gives x 2 = 3 1 and since x is the distance from the origin P = 3 1 ≈ 0 . 5 7 7 3 5