x 2 + 4 + ( x − 2 ) 2 + ( y − 2 ) 2 + 4 + ( 3 − y ) 2
Let x and y be real numbers . And Let s be the minimum value of the above expression. Find the value of ⌊ 1 0 0 0 s ⌋ .
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.
[@Calvin Lin] There is a typo in the first line. complete should be completes and then in the next line O = ( 0 , 1 ) should be O = ( 0 , 0 )
Relevant wiki: Inequalities - Geometric Interpretation - Intermediate
Partial Solution...
Let
O
(
0
,
0
)
,
A
(
x
,
2
)
,
B
(
2
,
y
)
and
C
(
4
,
3
)
. Then the expression means
∣
O
A
∣
+
∣
A
B
∣
+
∣
B
C
∣
, which at least
∣
O
C
∣
=
5
. However,
∣
O
C
∣
=
5
is not achievable. It is because
∣
O
C
∣
=
5
if
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
is fixed and determine the value of
x
, and vice versa.
If
y
(ie point B) is fixed, then the minimum clearly occurs when OAB is a straight line. This is a necessary condition.
If
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 ) . We thus obtain 8 + 0 + 5 ≈ 5 . 0 6 4 5 .
I used brute force method. It is obvious that x and 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))
Problem Loading...
Note Loading...
Set Loading...
This solution completes @Chan Lye Lee's solution.
Construct the points 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 , where A is a point on the line y = 2 and B is a point on the line x = 2 . Normally, we would conclude that this is ≥ O C , but this lower bound cannot be achieved, since the points 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: