Minimizing Sum Of Roots

Algebra Level 5

x 2 + 4 + ( x 2 ) 2 + ( y 2 ) 2 + 4 + ( 3 y ) 2 \sqrt{x^2+4}+\sqrt{(x-2)^2+(y-2)^2}+\sqrt{4+(3-y)^2}

Let x x and y y be real numbers . And Let s s be the minimum value of the above expression. Find the value of 1000 s \lfloor 1000s\rfloor .


The answer is 5064.

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.

3 solutions

Calvin Lin Staff
Jun 9, 2016

This solution completes @Chan Lye Lee's solution.

Construct the points O = ( 0 , 0 ) , A = ( X , 2 ) , B = ( 2 , Y ) , C = ( 4 , 3 ) O = (0,0), A = (X,2) , B = (2,Y), C = (4,3) . Observe that the algebraic expression is equivalent to O A + A B + B C OA + AB + BC , where A A is a point on the line y = 2 y = 2 and B B is a point on the line x = 2 x = 2 . Normally, we would conclude that this is O C \geq OC , but this lower bound cannot be achieved, since the points O , A , B , C O, A, B, C will not lie in order. (This is why it's important to verify that the lower bound can be achieved in order to conclude that it is indeed a minimum.)

Instead, we proceed as such:

  1. Clearly, we may assume that 0 X 4 0 \leq X \leq 4 since otherwise we could reduce the distance by setting X = 0 X =0 or X = 4 X = 4 . Similarly, we may assume that 0 Y 3 0 \leq Y \leq 3 . Thus, the domain of the continuous function is compact , hence a minimum exists.
  2. Suppose that we know the value of X X , so point A A has been fixed. Then, we want to minimize A B + B C AB + BC which clearly happens when A , B , C A, B, C are points on a line.
  3. Suppose that we know the value of Y Y , so point B B has been fixed. Then, we want to minimize O A + A B OA + AB , which clearly happens when O , A , B O, A, B are points on a line.
  4. Hence, the minimum occurs when A B C ABC and O A B OAB are straight lines with points in that order. This is only possible when A = B = ( 2 , 2 ) A = B = (2, 2) . We thus obtain O A + A B + B C = 8 + 0 + 5 5.0645 OA + AB + BC = \sqrt{8} + \sqrt{0} + \sqrt{5} \approx 5.0645 .

[@Calvin Lin] There is a typo in the first line. complete should be completes and then in the next line O = ( 0 , 1 ) O=(0,1) should be O = ( 0 , 0 ) O=(0,0)

Bob Kadylo - 4 years, 4 months ago

Log in to reply

Thanks! I've fixed those typos.

Calvin Lin Staff - 4 years, 4 months ago
Chan Lye Lee
May 29, 2016

Relevant wiki: Inequalities - Geometric Interpretation - Intermediate

Partial Solution... Let O ( 0 , 0 ) , A ( x , 2 ) , B ( 2 , y ) O(0,0), A(x,2), B(2,y) and C ( 4 , 3 ) C(4,3) . Then the expression means O A + A B + B C |OA|+|AB|+|BC| , which at least O C = 5 |OC|=5 . However, O C = 5 |OC|=5 is not achievable. It is because O C = 5 |OC|=5 if O , A , B , C O, A, B, C (in this order) on a straight segment, which is not possible.

The way to continue this argument is assume that y y is fixed and determine the value of x x , and vice versa.
If y y (ie point B) is fixed, then the minimum clearly occurs when OAB is a straight line. This is a necessary condition.
If x x (ie point A) is fixed, then the minimum clearly occurs when ABC is a straight line. This is a necessary condition.

(For completeness, since we can restrict our attention to a compact set, hence a minimum exists.)

Hence, this implies that the only possible configuration is when A = B = ( 2 , 2 ) A = B = ( 2, 2) . We thus obtain 8 + 0 + 5 5.0645 \sqrt{ 8} + \sqrt{0} + \sqrt{5} \approx 5.0645 .

Calvin Lin Staff - 5 years ago

I used brute force method. It is obvious that x x and y y will not be very large, so some bounds can be placed.

Code:

alist = []
for a in range(-100,100):
    for b in range(-100,100):
    x=a/10
        y=b/10
    alist.append((x**2+4)**0.5+((x-2)**2+(y-2)**2)**0.5+(4+(3-y)**2)**0.5)
print(min(alist))

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...