A function f : R 2 → R is defined as follows: f ( x , y ) = x 2 + y 2 − 1 2 x − 1 4 y + 8 5 Another function g : R 2 → R is defined as follows: g ( x , y ) = x 2 + y 2 − 1 0 x − 1 6 y + 8 9 As a , b , c , d range over all reals (not necessarily positive) such that ⎩ ⎪ ⎨ ⎪ ⎧ f ( a , b ) g ( a , b ) f ( c , d ) g ( c , d ) a + b c + d = 0 < 1 3 > 1 3 , let M be the minimum value of a 2 + b 2 + c 2 + d 2 − 2 a b − 2 c d f ( a , b ) g ( c , d ) + f ( c , d ) g ( a , b ) . Find M 2 .
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.
Outline : completing squares shows that f ( x , y ) is the distance between points ( x , y ) and ( 6 , 7 ) , and g ( x , y ) is the distance between points ( x , y ) and ( 5 , 8 ) . Plot points ( a , b ) , ( c , d ) , ( 6 , 7 ) , ( 5 , 8 ) and apply Ptolemy's inequality.
Problem Loading...
Note Loading...
Set Loading...
The problem asks us to minimize a 2 + b 2 + c 2 + d 2 − 2 a b − 2 c d f ( a , b ) f ( c , d ) + f ( c , d ) g ( a , b ) .
Let ϵ > 0 , and set a = 6 − ϵ , b = 7 − ϵ , c = 6 + ϵ , and d = 7 + ϵ . Then all the conditions in the problem are satisfied. Also, as ϵ → 0 + , the numerator goes to 0 and the denominator is always 2 , so the minimum (or more precisely, infimum) of the expression is 0.