Let a , b , c , d ∈ [ 2 1 , 2 ] . Suppose a b c d = 1 . Find the maximum possible value of ( a + b 1 ) ( b + c 1 ) ( c + d 1 ) ( d + a 1 ) .
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'm lost on the reasoning at the beginning of case 1. Max of a, b is 2 but why is min of a, b x/2?
Log in to reply
We have a b = x . So if a ≤ 2 then we have x ≤ 2 b , so therefore b ≥ 2 x . (and similarly if b ≤ 2 then a ≥ 2 x ).
I think where you mention 4 1 ≤ x ≤ 4 , you meant 1 ≤ x ≤ 4 not only because of the restriction you set on this specific case, but also the fact that f ( x , 4 x ) = 2 5 for x = 4 1 .
I completely understand your solution, how ever I have an another way of solving it, Could you please point out where my assumptions are wrong
a, 1/a, b,1/b....1/d >=0
AM >= GM >= HM
for those 8 terms, GM = 1; and AM and HM are same
so AM = HM = 1
which implies a +1/a + b + 1/b .....+ 1/d = 8
Now taking AM>=GM where my terms are (a+1/b), (b+1/c)...
from this I will get GM<=AM = (a+1/a+b+...1/d)/4
which gives GM <= 2 implying the result to be less than 16
Log in to reply
I don't see how you got AM = HM = 1. Suppose a = b = c = d = 2 , the arithmetic mean of the 8 numbers is 1 . 2 5 , and the harmonic mean is 0 . 8 .
How could we directly see that the Maxima is not 1 6 as it is the first which strikes with A.M-G.M at a = b = c = d = 1
if we hav a=1, c=1, b=2, d=1/2 we get ans =81!
So you need calculus for the solution?
a , b , c , d , a 1 , b 1 , c 1 , d 1 > 0 . so, ( a + a 1 ) + ( b + b 1 ) + ( a + b 1 ) + ( a + b 1 ) ≥ 2 × ( a + b 1 ) ( b + c 1 ) ( c + d 1 ) ( d + a 1 ) . ( A M − G M ) O t h e r w i s e , f ( x ) = x + x 1 . x ∈ [ 2 1 , 2 ] f ′ ( x ) = 1 − x 2 1 In this domain, 2 . 5 ≥ f ( x ) . 1 0 ≥ ( a + a 1 ) + ( b + b 1 ) + ( a + b 1 ) + ( a + b 1 ) ≥ 2 × ( a + b 1 ) ( b + c 1 ) ( c + d 1 ) ( d + a 1 ) . so 2 5 ≥ ( a + b 1 ) ( b + c 1 ) ( c + d 1 ) ( d + a 1 ) .
Since you are applying AM-GM to 4 terms, shouldn't it be
≥ 4 4 ( a + b 1 ) … ?
I completely understand your solution, how ever I have an another way of solving it, Could you please point out where my assumptions are wrong
a, 1/a, b,1/b....1/d >=0
AM >= GM >= HM
for those 8 terms, GM = 1; and AM and HM are same
so AM = HM = 1
which implies a +1/a + b + 1/b .....+ 1/d = 8
Now taking AM>=GM where my terms are (a+1/b), (b+1/c)...
from this I will get GM<=AM = (a+1/a+b+...1/d)/4
which gives GM <= 2 implying the result to be less than 16
Note several properties of this function:
The function is preserved on cyclic permutations of (a, b, c, d)
The function can be manipulated to ( b + a 1 ) ( c + b 1 ) ( d + c 1 ) ( a + d 1 ) by dividing by ( a b c d ) 2 . This means that f ( a , b , c , d ) = f ( a 1 , b 1 , c 1 , d 1 ) .
The function is unchanged if ( a , b , c , d ) is transformed into ( ϵ a , ϵ b , ϵ c , ϵ d )
The constraint a b c d = 1 along with property 3 means that of the 4 variables, only 2 are free, which will be denoted by x , y . By properties 1 and 2, only two unique orderings exist: ( x , y , x 1 , y 1 ) and ( x , x 1 , y , y 1 ) .
f ( x , x 1 , y , y 1 ) = 4 ( x + y ) ( x 1 + y 1 )
f ( x , y , x 1 , y 1 ) = ( x + y 1 ) ( y + x 1 ) ( x + y ) ( x 1 + y 1 )
The second value is greater than the first if ( x + y 1 ) ( y + x 1 ) = 2 + x y + x y 1 > 4 ⟹ x y + x y 1 > 2 . Furthermore, x y + x y 1 can be maximized by choosing x y = 4 or 4 1 by virtue of g ( z ) = z + z 1 having a U shape on ( 0 , ∞ )
Therefore the max value is 25.
You only have 2 possible values for the expression. Either you alternate 2 and 1/2 (2, 1/2, 2, 1/2) or you have them by twos (2, 2, 1/2, 1/2)
Note that (1/2, 2, 1/2, 2) will give you the same values as (2, 1/2, 2, 1/2). Likewise (1/2, 1/2, 2, 2), (2, 1/2, 1/2, 2) and (1/2, 2, 2, 1/2) will give you the same value as (2, 2, 1/2, 1/2)
The possible values would be 16 and 25. Therefore 25 would be the maximum.
The notation " a , b , c , d ∈ [ 2 1 , 2 ] " does not mean there are only two possible values. It means a , b , c , d can be any real numbers such that 2 1 ≤ a , b , c , d ≤ 2
Log in to reply
I think he is right a,b,c,d € [ \ frac{1}{2} ,2] and abcd=1 then we have only three possibilities (regarding the arrangement ) (1,1,1,1),(1,1,2, \frac{1}{2} ) or (2,2, \frac{1}{2} , \frac{1}{2} ) As we want the maximum we will use the third possibility
Log in to reply
We have many more possibilities than that. For example, we have ( 1 . 1 , 1 . 1 , 1 . 1 , 1 . 3 3 1 1 .
what logic did you used to get this approach.??
Thinking in terms of symmetry, as a,b,c,d are completely interchangeables. Having a optimization problem of a continuos function, the min-max will be in the "extreme values". The "extreme values" of a,b,c,d are 1/2, 1 & 2, so taking into account abcd=1 and symmetry, the "extreme points" would be (1,1,1,1) and any order of (2,2,1/2,1/2). If we evaluate both we get 16 and 25, and if we evaluate any other bi-symmetric & medium point such (3/2,3/2,2/3,2/3) [or any reordering] we will have an intermediate value as 17+1/3 in this case. We can discard any "not bi-symmetric point" intuitively, I don't find the reason right now, but it seems clear to me.
That's is not formal enough, but I think is absolutely right. Please, correct me if you see any fail
Log in to reply
That claim is not true.
Suppose that x + y = 1 0 . What is the minimum of ( x − a ) 2 ( y − b ) 2 ? How are the points ( a , 1 0 − a ) , ( 1 0 − b , b ) considered an "extreme value", given that a , b can be any constants?
Generally when maximizing a function, you do need to check extreme values of the domain. However, maximum values can also lie in the interior (Think about maximizing − x 2 in the unit disk), so we must also check interior points - generally with calculus or by observing a symmetry in the function we are maximizing.
Problem Loading...
Note Loading...
Set Loading...
Multiplying by a b c d , which does not change the expression, we get ( a b + 1 ) ( b c + 1 ) ( c d + 1 ) ( d a + 1 ) . Now let x = a b and y = b c . Then our expression becomes: ( x + 1 ) ( y + 1 ) ( x 1 + 1 ) ( y 1 + 1 ) = ( 2 + x + x 1 ) ( 2 + y + y 1 ) = f ( x , y ) Now suppose we have a given value of x and we want to find the value of y which maximizes f ( x , y ) for that x -value. Let's consider 2 cases:
(Case 1): x ≥ 1
Then, since the maximum of a , b is 2 and since a b = x , then the minimum of a , b must be 2 x . Now c d = x 1 . Since the minimum of c , d is 2 1 , then the maximum of c , d is x 2 . Hence, the minimum of y = b c is 4 x and the maximum of y is x 4 . In other words we have 4 x ≤ y ≤ x 4 .
Now since ( 2 + y + y 1 ) is concave upward, the maximum must occur at one of the endpoints (actually both of them, as it turns out). We get f ( x , x 4 ) = f ( x , 4 x ) = 4 x 2 ( x + 1 ) 2 ( x + 4 ) 2 . Once again this function is concave upward so the maximum will occur at the endpoints.
So what are the endpoints for x ? Well, since 2 1 ≤ a , b ≤ 2 , then 4 1 ≤ x ≤ 4 . At both of these endpoints, we get f ( x , 4 x ) = 2 5 .
Therefore the maximum in Case 1 is 2 5 . I won't bother writing out Case 2 (where x < 1 ) since it is very similar and you get the same maximum.