Let x , y > 0 be different real numbers satisfying x y = y x .
Find the infimum value of x + y .
Give your answer to 3 decimal places.
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.
But the question says x and y are "different". The minimum is attained when they are equal. Doesn't it lead to a contradiction?
Log in to reply
Theoretically yes, since this condition of x + y = 2 e will never actually be achieved. But it is the limiting case. The minimum is an infinitesimal away from it.
Log in to reply
It will never actually be achieved with distinct x and y , to be precise. :)
We are intended to find two solutions of equation f ( x ) = x l n ( x ) = r , r < e 1 . That is possible for all x > 1 and not for any x ≤ 1 . As the maximum value of f ( x ) is e 1 .
Now, looking at the graph of f ( x ) = x l n ( x ) we see that the curve less steep on positive side of x = e , the maximum point. Which means for some x = e , and y ( the companion of x , or f ( x ) = f ( y ) x < y ), y − e > e − x ⇒ x + y > 2 e . Hence the x for which x + y is minimum is e .
So, the answer is 2 ∗ e = 5 . 4 3 7 .
The curve of the function f ( x ) = ( x ) x 1 is positively skewed. So, with growth of x the average of two values of x where f ( x ) assumes the same value shifts towards right. Hence this average is minimum when f ( x ) attains it's peak value of ( e ) e 1 at x = e . Therefore the minimum value of x + y is 2 e
Problem Loading...
Note Loading...
Set Loading...
Without loss of generality, let y = t x , where t is a real number. Then:
x t x = ( t x ) x
x = ( t x ) t 1
x = t t 1 ⋅ x t 1
x 1 − t 1 = t t 1
x = t t − 1 1
y = t x = t t − 1 t
This is a family of solutions based in a parametric parameter t . So we're looking to minimize:
S = t t − 1 1 + t t − 1 t
Differtiating and making it equal to zero:
d t d S = t t − 1 1 ( ( t − 1 ) 2 t 1 ( t − 1 ) − ln ( t ) ) + t t − 1 t ( ( t − 1 ) 2 ( 1 + ln ( t ) ) ( t − 1 ) − t ln ( t ) ) = 0
Multiplying the first term above and below by t :
d t d S = t t − 1 t t 1 ( ( t − 1 ) 2 t 1 ( t − 1 ) − ln ( t ) ) + t t − 1 t ( ( t − 1 ) 2 ( 1 + ln ( t ) ) ( t − 1 ) − t ln ( t ) ) = 0
Multiplying above and below by t t − 1 t ( t − 1 ) 2 (which implies t = 0 and t = 1 → x = y , as the problem states):
t 1 ( t t − 1 − ln ( t ) ) + ( t − 1 ) ( 1 + ln ( t ) ) − t ln ( t ) = 0
Multiplying above and below by t 2 :
t 3 − t 2 − t 2 ln ( t ) + t − t ln ( t ) − 1 = 0
The only solution to this is t = 1 , which is forbidden by the steps above and by the problem itself ( x = y ). This means we're looking for a limiting condition, that's never achieved. I.e., the minimum M never is attained, but is tends to the following value:
M = t → 1 lim S
M = t → 1 lim [ t t − 1 1 + t t − 1 t ]
M = t → 1 lim [ t t − 1 t ( t 1 + 1 ) ]
ln ( M ) = t → 1 lim [ ln ( t 1 + 1 ) + t − 1 t ln ( t ) ]
ln ( M ) = ln ( 2 ) + t → 1 lim [ t − 1 t ln ( t ) ]
L'Hôpital's rule applies:
ln ( M ) = ln ( 2 ) + t → 1 lim [ 1 1 + ln ( t ) ]
ln ( M ) = ln ( 2 ) + 1
M = 2 e ≈ 5 . 4 3 6 6