Given that a 1 , a 2 , a 3 , a 4 > 0 , find the maximum constant N for which the following inequality always holds true:
a 1 a 2 a 3 a 4 a 1 a 2 ( a 3 2 + a 4 2 ) + a 3 a 4 ( a 1 2 + a 2 2 ) ≥ N .
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.
Nice manipulation :)
And indeed, both optimizing equalities can hold simultaneously...i.e. when x=y=1. Anyways x and y are totally independent so here this addition is superfluous!
Log in to reply
Yes, the independence of x and y is crucial to the last step.
I got to a1/a2 + a2/a1 + a3/a4 + a4/a3 >=N And then using logic I just realized that to find the largest number that the sum is lager towards, you need the smallest factors in the sum, and since we are limited to integers greater than zero, but no restrictions on being different from each other, the lowest possible sum is when each a=1. And so 1/1 + 1/1 + 1/1 +1/1 = 4 ^¬^
I understand most of it except the part where b+1/b >= 2. How do you get that from the AM-GM inequality?
i don't understand your solution, especially the b + 1/b <= 2. how about if the b is 100. should'nt it be 100 + 1/100 > 2? what's wrong with my way of thinking here? thanks for any feedback, please help me!
If we expand the denominator, we find that the LHS is equivalent to:
a 1 a 2 a 3 a 4 a 1 a 2 a 3 2 + a 1 a 2 a 4 2 + a 3 a 4 a 1 2 + a 3 a 4 a 2 2
From AM-GM we can find that:
4 a 1 a 2 a 3 2 + a 1 a 2 a 4 2 + a 3 a 4 a 1 2 + a 3 a 4 a 2 2 ≥ 4 a 1 a 2 a 3 2 a 1 a 2 a 4 2 a 3 a 4 a 1 2 a 3 a 4 a 2 2
Which is the same thing as:
4 a 1 a 2 a 3 2 + a 1 a 2 a 4 2 + a 3 a 4 a 1 2 + a 3 a 4 a 2 2 ≥ a 1 a 2 a 3 a 4
To answer our question we can convert this to:
a 1 a 2 a 3 a 4 a 1 a 2 a 3 2 + a 1 a 2 a 4 2 + a 3 a 4 a 1 2 + a 3 a 4 a 2 2 ≥ 4
Therefore, N = 4
The expression on the left can be simplified as a 3 a 4 a 3 2 + a 4 2 + a 1 a 2 a 1 2 + a 2 2 .
Cauchy-Schwarz tells us that for x , y in R , ( x + y ) 2 ≤ 2 ( x 2 + y 2 ) , so 2 x y ≤ x 2 + y 2 ⇒ x y x 2 + y 2 ≥ 2 .
Thus, a 1 a 2 a 1 2 + a 2 2 ≥ 2 , a 3 a 4 a 3 2 + a 4 2 ≥ 2 ⇒ a 3 a 4 a 3 2 + a 4 2 + a 1 a 2 a 1 2 + a 2 2 ≥ 4 .
Perfect !!! I did this too
WLOG, we assume that a 1 = a 2 = a 3 = a 4 = x . Hence, we have,
x 4 x 2 ( 2 x ) + x 2 ( 2 x ) ≥ N \ x 4 4 x ( x 2 ) ≥ N \ x 2 4 x ≥ N \ x 4 ≥ N \
x is a positive integer. N maximized when x = 1 . Therefore, the maximum value of N = 4 .
( a 1 − a 2 ) 2 ≥ 0
∴ a 1 2 + a 2 2 > 2 a 1 a 2 a n d a 3 2 + a 4 2 > 2 a 3 a 4
Therefore a 1 a 2 a 3 a 4 a 1 a 2 ( a 3 2 + a 4 2 ) + a 3 a 4 ( a 1 2 + a 2 2 ) ≥ a 1 a 2 a 3 a 4 a 1 a 2 ( 2 a 3 a 4 ) + a 3 a 4 ( 2 a 1 a 2 )
∴ N = 4
re-writing the inequality gives us:
a 1 a 2 a 3 a 4 a 1 a 2 ( a 3 2 + a 4 2 ) + a 3 a 4 ( a 1 2 + a 2 2 ) = N ⇔ a 4 a 3 + a 3 a 4 + a 1 a 2 + a 2 a 1 = N
And by A M − G M :
a 4 a 3 + a 3 a 4 + a 1 a 2 + a 2 a 1 = N ≥ 4 4 a 4 a 3 ⋅ a 3 a 4 ⋅ a 1 a 2 ⋅ a 2 a 1 = 4
( x − 1 ) 2 = x 2 − 2 x + 1 = x − 2 + x 1 ≥ 0 → x + x 1 ≥ 2 → a 2 a 1 + a 1 a 2 ≥ 2 a n d a 4 a 3 + a 3 a 4 ≥ 2 → N ≥ 4
Just make all values of a = 1
The inequality can be rewritten as
a 3 a 4 a 3 2 + a 4 2 + a 1 a 2 a 1 2 + a 2 2 ≥ N
Observe that ( a 3 + a 4 ) 2 = a 3 2 + 2 a 3 a 4 + a 4 2
and
( a 1 + a 2 ) 2 = a 1 2 + 2 a 1 a 2 + a 2 2
That can be rewritten as:
a 3 2 + a 4 2 = ( a 3 + a 4 ) 2 − 2 a 3 a 4
and
a 1 2 + a 2 2 = ( a 1 + a 2 ) 2 − 2 a 1 a 2
Substituting those values into the inequality
a 3 a 4 ( a 3 + a 4 ) 2 − 2 a 3 a 4 + a 1 a 2 ( a 1 + 1 2 ) 2 − 2 a 1 a 2 ≥ N
This simplifies to
a 3 a 4 ( a 3 + a 4 ) 2 + a 1 a 2 ( a 1 + a 2 ) 2 ≥ N + 4
Thus, the answer is 4.
It doesn't say we can't do it, so why not make a 1 = a 2 = a 3 = a 4 . To make things simpler, let's write all these equal terms as a:
a a a a a a ( a 2 + a 2 ) + a a ( a 2 + a 2 ) ≥ N
The problem is asking for the maximum constant N - how far can we push N? After what value will the inequality stop being true?
So, what we are looking for is the value of N, which makes the expression an equality:
2 [ a 2 ( a 2 + a 2 ) ] = N a 4
2 [ ( a 4 + a 4 ) ] = N a 4
2 [ ( 2 a 4 ) ] = N a 4
4 a 4 = N a 4
The correct answer should be 4
Problem Loading...
Note Loading...
Set Loading...
The inequality can be written as
x + x 1 + y + y 1 ≥ N ,
where x = a 2 a 1 and y = a 4 a 3 .
Now by the AM-GM inequality we know that b + b 1 ≥ 2 for any positive real number b , so N = 2 + 2 = 4 .