a 4 1 + b 4 1 + c 4 1 = 1
Given the above equation for positive numbers a , b , c .
Find the minimum value of
a 3 b 2 c 3 a 4 b 4 + a 4 c 4 + b 4 c 4
If the minimum value of the above is x , input your answer as ⌊ 1 0 0 x ⌋ .
This is part of the set Trevor's Ten
Details and Assumptions
The answer is not 3 0 0 .
It is indeed a 3 b 2 c 3 and not a 3 b 3 c 3
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 did it in a basically equivalent way:
Note that the condition is a 4 b 4 + b 4 c 4 + c 4 a 4 = a 4 b 4 c 4 so we just want to find the minimum of a 3 b 2 c 3 a 4 b 4 c 4 = a b 2 c
Now by GM-HM inequality, 4 4 a 4 b 8 c 4 ≥ a 4 1 + 2 b 4 1 + 2 b 4 1 + c 4 1 4 = 4 so a b 2 c ≥ 4 4 4 = 2 2
Log in to reply
Wow, nice alternative. So many solutions, all relatively the same but all with their own unique twist.
I did the same
i did same!
Why is this rated as level 5 with 350 points? Is it that hard? Also, why did it get an official rating after I solved it. Why am I so unlucky?
I don't know what to mention now , since my method has been pretty much covered with what Daniel and Prasun have posted .
Btw your question is indeed genuine , why isn't it B 3 ?
@Calvin Lin sir , is there any reason for it ? Sorry for the trouble though .
Log in to reply
I'm not sure what u mean. U mean brilliant cubed? Lol
Log in to reply
Yes , why did the staff choose B^2 ! Just curious now that you have asked it as a question
Log in to reply
@A Former Brilliant Member – Let B denote the actions we make on this site. Then B 2 can be considered as the effect it produces on the community. Now, there are people who produce negative actions on this site (example: people like me). But as you can see, B 2 always remains non-negative. That is the reason.
Log in to reply
@Prasun Biswas – Yeah , the smallest even natural number with that property . Nice explanation :)
Is the given condition necessary? I solved it like this which didn't really need the given condition. Here it goes:
The given expression (say ( X ) ) simplifies to,
X = ( c 3 a b 2 + b 2 a c + a 3 b 2 c ) = b 2 ( c 3 a + a 3 c ) + b 2 a c
Applying AM-GM, we have,
c 3 a + a 3 c ≥ a c 2 ⟹ X ≥ a c 2 b 2 + b 2 a c
Note that RHS of the last inequality will be the tightest lower bound when it is minimized. Minimizing it using AM-GM inequality, we have,
a c 2 b 2 + b 2 a c ≥ 2 2
Comparing the bounds of the inequalities we obtained, we have,
X ≥ 2 2
Hence follows the answer.
Just in case anyone wonders, equality occurs at a = 4 1 / 4 = c , b = 2 1 / 4 for all the three inequalities (verification for equality case in AM-GM) and as such, the value we found in the end is indeed the minimum since the equality cases are matched.
Log in to reply
Yes, the condition was not necessary. Note that the inequality we are trying to prove is homogenous.
Log in to reply
Yes, I see that. But I don't get what you're trying to imply by that. Does homogeneity have any special kind of impact on inequalities?
Log in to reply
@Prasun Biswas – Because the inequality is homogenous (both sides have degree 0) we can let a ′ = k a , b ′ = k b , and c ′ = k c for any non-zero real number k and yield an identical inequality in a ′ , b ′ , c ′ . However, the condition itself, because it is non-homogeneous, turns into a 4 1 + b 4 1 + c 4 1 = k 4 1
But k 4 1 can equal any non-zero real, so we essentially just got rid of the condition.
I think the conditions are necessary. Because refer to my solution, if I had ( X ) = 2 then the minimum would double
Log in to reply
Check again! It remains the same. When the given condition is 2 , you are also minimizing the double of what you're minimizing now.
Log in to reply
@Prasun Biswas – Oh, that's what you meant. I was talking about it changing the answer, not remaining as it is.
Same method
Nice solution! But all inequalities are not proven without the equality case :) although it is quite clear that there must be an equality case.
Log in to reply
A general result for the problem:
If a 4 1 + b 4 1 + c 4 1 = k , k ∈ R + , then equality holds iff,
a = c = α , b = 2 − 1 / 4 α , α = k 1 / 4 2
This problem had been discussed long time ago, but I didn't find solution similar to mine, so below is my solution:
a 3 b 2 c 3 a 4 b 4 + b 4 c 4 + c 4 a 4 = c 3 a b 2 + a 3 b 2 c + 2 1 b 2 a c + 2 1 b 2 a c ≥ 4 4 c 3 a b 2 ⋅ a 3 b 2 c ⋅ 2 1 b 2 a c ⋅ 2 1 b 2 a c = 2 2
I'm surprised that I didn't use the constraint stated in the problem, but I found that the constraint is just narrow down the solution range, this minimum can achieve when a = c = 2 , b = 4 2 otherwise we just need a = c = 4 2 b so I think there is no need to provide the constraint.
I don't know why. but I assumed a^4 = c^4 = 4, and b^4 = 2. And solved from there. There was symmetry between a and c, but not b because of b^2 in the denominator. 32/(8*√2) * 100 = 282.
We need to find minimum value of ab^2c. Now use GM>=HM taking numbers as a^4,2 times 2*b^4 and c^4
Problem Loading...
Note Loading...
Set Loading...
Solution
Simplifying our semi gigantic fraction.
a 3 b 2 c 3 a 4 b 4 + a 4 c 4 + b 4 c 4 = c 3 a b 2 + b 2 a c + a 3 b 2 c
c 3 a b 2 + b 2 a c + a 3 b 2 c = a b 2 c ( a 4 1 + b 4 1 + c 4 1 )
Remember that a 4 1 + b 4 1 + c 4 1 = 1 . Thus the above can be simplified to a b 2 c .
Thus we are simply trying to minimize a b 2 c . By G.M. ≤ A.M.
4 4 a 4 b 8 c 4 1 ≤ 4 a 4 1 + 2 b 4 1 + 2 b 4 1 + c 4 1
Simple algrbra yields.
2 2 ≤ a b 2 c
Thus our answer is
⌊ 2 2 ⋅ 1 0 0 ⌋ = 2 8 2