a , b , c , d are non-negative real numbers such that a b + b c + c d + d a = 1
The minimum value of f ( a , b , c , d ) = b + c + d a 3 + a + c + d b 3 + a + b + d c 3 + a + b + c d 3 can be expressed in the form q p where p and q are relatively prime positive integers.
Find the value of p + q
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.
In the end: a 2 + b 2 + c 2 + d 2 ≥ ( a + d ) ( b + c ) , how have you proved this?
Log in to reply
( a + d ) ( b + c ) = a b + b c + c d + d a , you misread.
a 2 + b 2 + c 2 + d 2 ≥ a b + b c + c d + d a ⟺ ( a − b ) 2 + ( b − c ) 2 + ( c − d ) 2 + ( d − a ) 2 ≥ 0
This is a classic inequality, you should memorize it.
Problem Loading...
Note Loading...
Set Loading...
Let A = b + c + d , B = a + c + d , C = a + b + d , D = a + b + c . Hence, A + B + C + D = 3 ( a + b + c + d ) .
Note that a , b , c , d and A 1 , B 1 , C 1 , D 1 are similarly ordered.
So by Chebychev's inequality, we have f ( a , b , c , d ) ≥ 4 1 ( a 3 + b 3 + c 3 + d 3 ) ( A 1 + B 1 + C 1 + D 1 ) .
Again, ( A + B + C + D ) ( A 1 + B 1 + C 1 + D 1 ) ≥ 1 6
So, f ( a , b , c , d ) ≥ 3 ( a + b + c + d ) 4 ( a 3 + b 3 + c 3 + d 3 )
Again, by Chebychev's inequality ( a 3 + b 3 + c 3 + d 3 ) ≥ 4 1 ( a + b + c + d ) ( a 2 + b 2 + c 2 + d 2 ) ≥ 4 1 ( a + b + c + d ) ( a b + b c + c d + d a ) = 4 1 ( a + b + c + d )
Hence, the minimum value of f ( a , b , c , d ) is 3 1 .