a 4 + 1 1 + b 4 + 1 1 + c 4 + 1 1 + d 4 + 1 1 = 1
Let a , b , c and d be positive reals satisfying the equation above, find the minimum value of 2 0 a b c d .
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.
Bhaiya somewhere I believe you have made an weaker inequality because
c y c ∑ a 4 ≥ ⎝ ⎜ ⎜ ⎛ c y c ∏ a 4 ⎠ ⎟ ⎟ ⎞ 4 1
And,
c y c ∑ a 4 ≥ 1 2
But you cannot say anything like
1 2 ≥ ⎝ ⎜ ⎜ ⎛ c y c ∏ a 4 ⎠ ⎟ ⎟ ⎞ 4 1 o r ⎝ ⎜ ⎜ ⎛ c y c ∏ a 4 ⎠ ⎟ ⎟ ⎞ 4 1 ≥ 1 2
Log in to reply
Since minimum value of ∑ c y c a 4 i s 1 2 which ∏ c y c a 4 cannot exceed, hence maximum value of ∏ c y c a 4 must be 3. What was the way you adopted to solve this problem??
Log in to reply
I solved the same way, maybe @Harsh Shrivastava , can explain
Log in to reply
@Department 8 – Simply substitute a = 1/p, b=1/q ... I will try to post a complete solution by tmmrw.
Log in to reply
@Harsh Shrivastava – From where do you learn such gr8 things
From the condition we have c y c ∑ a , b , c , d 1 + a 4 1 a 4 1 = 1 Now by Cauchy-Schwarz Inequality we have 1 = c y c ∑ a , b , c , d 1 + a 4 1 a 4 1 ≥ 4 + c y c ∑ a , b , c , d a 4 1 ( c y c ∑ a , b , c , d a 2 1 ) 2 Therefore c y c ∑ a , b , c , d a 4 1 + 4 ≥ ( c y c ∑ a , b , c , d a 2 1 ) 2 ⇔ c y c ∑ a , b , c , d a b 2 ≤ 4 By AM-GM we have L H S ≥ a b c d 1 2 , so finally a b c d ≥ 3 ⇒ 2 0 a b c d ≥ 6 0 The equality holds when a = b = c = d = 4 3
∑ ( b 4 + 1 ) ( c 4 + 1 ) ( d 4 + 1 ) = ( a 4 + 1 ) ( b 4 + 1 ) ( c 4 + 1 ) ( d 4 + 1 ) L e f t = ∑ ( b 4 c 4 d 4 + ∑ b 4 c 4 + ∑ b 4 + 1 ) = ∑ a 4 b 4 c 4 + 2 ∑ a 4 b 4 + 3 ∑ a 4 + 4 = a 4 b 4 c 4 d 4 + ∑ a 4 b 4 c 4 + ∑ a 4 b 4 + ∑ a 4 + 1 ⇒ a 4 b 4 c 4 d 4 = ∑ a 4 b 4 + 2 ∑ a 4 + 3 ≥ 6 a 2 b 2 c 2 d 2 + 8 a b c d + 3 In fact,we can conclude that a b c d ≥ 3 .But I 'd like to point out why only 3: Let t = a b c d then t 4 − 6 t 2 − 8 t − 3 ≥ 0 Let f ( t ) = t 4 − 6 t 2 − 8 t − 3 f ( 3 ) = 0 , f ( 2 ) < 0 , f ( 0 ) < 0
f ′ ( t ) = 4 t 3 − 1 2 t − 8 = 4 ( t 3 − 3 t − 2 ) Find that f ′ ( 2 ) = 0 , f ′ ( 1 ) < 0 , f ′ ( 0 ) < 0 and f ′ ′ ( t ) = 1 2 ( t 2 − 1 ) hence t = 3 is the only positive solution to f ( t ) = 0
Opps...latex is exhausting.
Problem Loading...
Note Loading...
Set Loading...
Applying AM ≥ HM 4 ( a 4 + 1 ) + ( b 4 + 1 ) + ( c 4 + 1 ) + ( d 4 + 1 ) ≥ a 4 + 1 1 + b 4 + 1 1 + c 4 + 1 1 + d 4 + 1 1 4 = 4 ⇒ c y c ∑ a 4 ≥ 1 2 Now applying AM ≥ GM ⇒ c y c ∑ a 4 ≥ 1 2 ≥ 4 ( c y c ∏ a 4 ) 4 1 ⇒ c y c ∏ a ≤ 3 Hence 2 0 × 3 = 6 0 Equality occurs when a = b = c = d = ( 3 ) 4 1