If a , b , c , d , e , f are positive real numbers which satisfy
a + b + c + d + e + f = 7 ,
find the minimum value of
a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 .
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.
How do we know that equality can be achieved?
Log in to reply
Brilliant wikis :P
i did same
Hey swapnil can u please give conditions for equality...
Log in to reply
By Cauchy-Schwarz, equality is attained when a 1 = b 2 = c 3 = . . . , implying that a = 3 1 .
Surely, meet me in slack.
Did the same way
Did the same way
Use the concept W e i g h t e d A . M ≥ W e i g h t e d H . M , to get :
2 1 1 ( a ) + 2 ( 2 b ) + 3 ( 3 c ) + 4 ( 4 d ) + 5 ( 5 e ) + 6 ( 6 f ) ≥ 1 ( a 1 ) + 2 ( b 2 ) + 3 ( c 3 ) + 4 ( d 4 ) + 5 ( e 5 ) + 6 ( f 6 ) 2 1
⇒ 2 1 a + b + c + d + e + f ≥ a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 2 1
⇒ a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 ≥ 6 3
another way is by Titu's Lemma
Let the given expression be equal to x
We will use Power Mean (QAGH) .
Applying A . M . ≥ H . M . on the numbers a , 2 b , 2 b , 3 c , 3 c , 3 c , 4 d , 4 d , 4 d , 4 d , 5 e , 5 e , 5 e , 5 e , 5 e , 6 f , 6 f , 6 f , 6 f , 6 f , 6 f
2 1 7 ≥ x 2 1
x ≥ 6 3
Nice approach :)
Define in R n Let u = ( a , b , c , d , e , f ) v = ( a 1 , b 2 , c 3 , d 4 , e 5 , f 6 )
By Cauchy-Schwarz Inequality:
∥ u ∥ ⋅ ∥ v ∥ ≥ u ⋅ v ( a ) 2 + ( b ) 2 + ( c ) 2 + ( d ) 2 + ( e ) 2 + ( f ) 2 ( a 1 ) 2 + ( b 2 ) 2 + ( c 3 ) 2 + ( d 4 ) 2 + ( e 5 ) 2 + ( f 6 ) 2 ≥ ( a ) ( a 1 ) + ( b ) ( b 2 ) + ( c ) ( c 3 ) + ( d ) ( d 4 ) + ( e ) ( e 5 ) + ( f ) ( f 6 ) a + b + c + d + e + f a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 ≥ 1 + 2 + 3 + 4 + 5 + 6 7 a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 ≥ 2 1 a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 ≥ 7 2 1 2 = 6 3
Equality holds when
1 a = 2 b = 3 c = 4 d = 5 e = 6 f = k , k ϵ R a = k , b = 2 k , c = 3 k , d = 4 k , e = 5 k , f = 6 k a + b + c + d + e + f = 2 1 k = 7 ⇒ k = 1 / 3
Therefore the minimum value is 63, and it occurs when a = 1/3, b = 2/3, c = 1, d = 4/3, e = 5/3, f = 2.
Liked this one :)
Using Lagrange's multipliers, one obtains a = 2 b = 3 c = 4 d = 5 e = 6 f .
Note that the denominator is nothing but the square root of the numerator of the respective terms.
This gives the value of a as 3 1 . Substitute and simplify.
Can you elaborate? Thanks.
Log in to reply
Yeah.
Lets define a function, f ( x , σ ) = a 1 + b 4 + c 9 + d 1 6 + e 2 5 + f 3 6 + σ ( a + b + c + d + e + f = 7 ) .
Now differentiate repeatedly with respect to all the variables. You shall observe a relation between the variables according to the one I have stated in the solution.
Putting these values in the equation summing up to 7, we obtain the values for which the function attains a minimum.
Can Lagranges multipliers be used in any problem that can be otherwise solved using titu's lemma?
Log in to reply
Mostly, Lagrange Multipliers serve as the short-cut for Inequalities, that's why their use in Olympiads isn't encouraged. Instead learn Muirhead's Inequality.
One could use AM-HM on the numbers used by @Aditya Chauhan
Problem Loading...
Note Loading...
Set Loading...
Using Titu's Lemma ,
a 1 2 + b 2 2 + c 3 2 + d 4 2 + e 5 2 + f 6 2 ≥ a + b + c + d + e + f ( 1 + 2 + 3 + 4 + 5 + 6 ) 2 = 7 2 1 × 2 1 = 6 3 .