What is the largest real number K (to 2 decimal places), such that for all triangles with sides a , b and c , the following inequality is always true:
a 2 + b 2 + c 2 ≥ K ( a 2 + a + b + c 2 a b c ) .
Note that this inequality is neither symmetric nor cyclic.
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.
What if you take an equilateral triangle..? or RHS with 3,4,5 the value of K is much greater than 1.2
Log in to reply
ya if we take 3,4,5 we get 2.63 as max value !
Log in to reply
The question asked for the largest real number K such that for ALL triangles. For 1,1,2, the value is 1.2, but as you said, for 3,4,5 that value is 2.63. Because the question asks for the value that works for all triangles, and 2.63 does not fit the equation for 1,1,2, then 1.2 must be the correct answer
I see a misprint, right before "Thus". (I couldn't figure out what you were trying to say there, for a minute, then I realized it makes sense if you add parentheses.)
Still, good write-up.
I'm not quite clear how you got b c ≥ a + b + c 2 a b c . An explanation would be helpful, other than that, seems like a great solution.
@Mohammad Al Ali : He multiplied both sides of a + b + c ≥ 2 a by b c , then divided by a + b + c .
Since it is symmetric with respect to b and c, and b and c are restrained, it makes sense that b = c . Let b = c = 1 . Now plugging this into the given statement, we have that ( a 3 + 2 a 2 + 2 a ) ( a 3 + 2 a 2 + 2 a + 4 ) ≥ K . This function is clearly decreasing, thus the maximum value of K is attained at the greatest value of a. Since a < 2 b from the triangle inequality, we can plug in a = 2 to get K = 1 . 2 0
Problem Loading...
Note Loading...
Set Loading...
The answer is 1 . 2 . The equality case happens when we have a (degenerate) triangle with side lengths of a = 2 , b = 1 , c = 1 (and constant multiples). Note: If we want only non-degenerate triangles, then we do get strict inequality, though the largest K value will still be 1.2. I didn't want to deal with such edge cases, hence set it up with an equality sign.
First, notice that with a = 2 , b = 1 , c = 1 , we get that K ≤ 5 6 . We will show that the largest possible value is 5 6 . The inequalities that will be used are b + c ≥ a (triangle inequality) and ( b − c ) 2 ≥ 0 (trivial inequality). It is clear that the equality case listed above satisfies both of these conditions.
First, since b + c ≥ a hence a + b + c ≥ 2 a and so b c ≥ a + b + c 2 a b c .
Second, we have a 2 ≤ ( b + c ) 2 = b 2 + 2 b c + c 2 ≤ 2 b 2 + 2 c 2 .
Thus, it suffices to show that
a 2 + b 2 + c 2 ≥ 5 6 ( a 2 + b c ) ( which is ≥ 5 6 ( a 2 + a + b + c 2 a b c ) ) .
This is equivalent to
5 b 2 + 5 c 2 ≥ a 2 + 6 b c ⇔ 3 ( b − c ) 2 + 2 ( b 2 + c 2 ) ≥ a 2 ,
which is true because 3 ( b − c ) 2 ≥ 0 and 2 ( b 2 + c 2 ) ≥ a 2 .