a , b , c have perimeter 2 . What is the maximum value of k such that b 1 − a + c 1 − b + a 1 − c ≥ k is always true? Prove your claim.
Let a triangle with sides of length
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.
But how do you know that the minimum of the expression occurs at x=1??
Log in to reply
I don't understand your comment; I never claim that the minimum occurs only when x = 1 .
If you are asking why I set x = 1 to show that the expression can come arbitrarily close to 1, it's just a nice value to work with. I could have set x to any value, and the argument would still work.
Sir how do approached for such a nice solution?
IGNORE THIS SOLUTION. IT IS INCORRECT.LOOK AT JON HAUSSMAN'S SOLUTION.
Because a , b , c are the side lengths of the triangle, we use the well-known substitution a = x + y , b = y + z , and c = z + x (draw a triangle and its incircle to understand why this substitution works).
Thus, we have 2 x + 2 y + 2 z = 2 or x + y + z = 1 for positive reals x , y , z . Also, we have c y c ∑ b 1 − a = c y c ∑ y + z 1 − x − y = c y c ∑ y + z z . Thus we just need to find the minimum of c y c ∑ x + y y
By Cauchy, we have ( c y c ∑ x + y y ) ( c y c ∑ y ( x + y ) ) ≥ ( x + y + z ) 2 = 1
Thus, c y c ∑ x + y y ≥ c y c ∑ y ( x + y ) 1 = x 2 + y 2 + z 2 + x y + y z + z x 1
But x 2 + y 2 + z 2 + x y + y z + z x = ( x + y + z ) 2 − ( x y + y z + z x ) = 1 − ( x y + y z + z x ) so x 2 + y 2 + z 2 + x y + y z + z x 1 = 1 − ( x y + y z + z x ) 1
But x y + y z + z x ≤ 3 ( x + y + z ) 2 because when expanded and rearranged it becomes x 2 + y 2 + z 2 − x y − y z − z x ≥ 0 which factors into 2 1 ( ( x − y ) 2 + ( y − z ) 2 + ( z − x ) 2 ) ≥ 0 which is always true. Thus, x y + y z + z x ≤ 3 1 so 1 − ( x y + y z + z x ) 1 ≥ 1 − 3 1 1 = 2 3
Thus, b 1 − a + c 1 − b + a 1 − c ≥ 2 3 = 1 . 5 and we are done.
Although I successfully guessed "correct" answer, unfortunately 1.5 is a wrong answer. It is easy to come up with a counterexample (actually any successful example will lead to a counter one as minimum value + maximum value is 3). For example, choose a=0.8, b=0.9 and c=0.3. You can calculate the value of the expression is 103/72, which is less than 1.5.
It is easy to find out where your logic is wrong. I leave it as an exercise to you:-).
I do not know correct answer at this moment, though.
Log in to reply
Indeed, since
( b 1 − a + c 1 − b + a 1 − c ) + ( c 1 − a + a 1 − b + b 1 − a ) = 3
this tells us that there is at least one ordering of the lengths which produces an expression that is at most 2 3 .
Log in to reply
Could anyone tell me what the problem with Daniel's solution is? Where is his logic wrong?
I'd like to know how many people legitimately solved the question and how many people just assumed a = b = c .
See, this is the one thing I don't like about making inequality problems on Brilliant. One can just assume a = b = c ; and for me it is too hard to create a nice inequality without that as the equality case.
Log in to reply
That happens, you should get used to it. Most of the people who solve my geometry problems usually get some crucial observations from the accurate diagrams. :P
But anyways, you shouldn't care. If someone guessed a problem and got it right, he cheated himself from the joy of solving that problem.
I liked this question because the solution set isn't a = b = c . Your logic is wrong, and the correct value of k is 1 (which will not be achieved).
Do we really need the condition that a , b , c are sides of a triangle? Note that you never used the fact that x , y , z are positive.
I saw one of the tags named 'Nesbitt's Inequality'. Can you please explain it by posting a note on the site?:)
Log in to reply
It states that given any three positive reals a , b , c , b + c a + c + a b + a + b c ≥ 2 3 .
Log in to reply
Thanks a lot!!!
Isn't this what the question is asking?
Log in to reply
@Avineil Jain – Nope. Read the question more carefully.
We can also do it by AM,GM and HM inequality.i
this is the correct answer ..... my ans is also 1.5
I found 1 too.
A Note, The substitution used here that
a
=
x
+
y
and similar things is called Ravi substitution. Also
@Daniel Liu
, If only u wanted to get greater than
2
3
, then u could also use AM-HM (Hint:let
1
=
s
i.e. semiperimeter. Then write all
a
1
−
b
=
a
s
−
a
b
, Move the semiperimeter terms in one side, the remaining side cancels out by AM-GM, then put semiperimeter common, apply AM-HM, and u get result 1.5 Actually, I got it wrong forst time, But when I used Ravi Substitution method, I got answer as 1
It is not reduced generalization, assume that: a ≥ b ≥ c , k = b 1 − a + c 1 − b + a 1 − c . Having: ⇔ c 2 b − c ( b + a ( 1 − a ) + k a b ) − a b ( 1 − b ) = 0 ⇒ d = ( b + a ( 1 − a ) + k a b ) 2 + 4 a b 2 ( 1 − b ) ⇒ 0 ≤ 2 b ( b + a ( 1 − a ) + k a b ) 2 + 4 a b 2 ( 1 − b ) + ( b + a ( 1 − a ) + k a b ) ≤ 1 ⇒ ( b + a ( 1 − a ) + k a b ) 2 + 4 a b 2 ( 1 − b ) ≤ b − ( a ( 1 − a ) + k a b ) ⇒ b ( 1 − k a ) > 0 ⇒ k < a 1 When a → 1 ⇒ k → 1 ⇔ a → 1 lim k = 1 k m a x = 1
As in Daniel's solution, we make the substitution a = x + y , b = y + z , c = z + x , with the reverse substitution given by x = 2 b + c − a , y = 2 c + a − b , z = 2 a + b − c . The given condition transforms to 2 ( x + y + z ) = 2 ⟹ x + y + z = 1 , and hence b 1 − a + c 1 − b + a 1 − c = z + x x + x + y y + y + z z . Since the inequality is cyclic, WLOG assume x ≥ y ≥ z , so y + z 1 ≥ z + x 1 ≥ x + y 1 . By rearrangement, z + x x + x + y y + y + z z ≥ x + y x + y + z y + z + x z .
Note that ( z + x x + x + y y + y + z z ) + ( z + x z + x + y x + y + z y ) = x + z x + z + y + z y + z + z + x z + x = 3 , so it follows that z + x x + x + y y + y + z z ≥ 2 3 .
Equality holds for a = b = c = 3 2 .
Rearrangement doesn't work that way. The minimum is actually 1.
Log in to reply
Oh yeah, right. I messed up. So sorry for the mistake.
Problem Loading...
Note Loading...
Set Loading...
The best bound is actually given by b 1 − a + c 1 − b + a 1 − c > 1 .
Since a , b , and c are the sides of a triangle, there exist positive real numbers such that a = y + z , b = x + z , and c = x + y . Then 2 x + 2 y + 2 z = a + b + c = 2 , so x + y + z = 1 , and b 1 − a + c 1 − b + a 1 − c = x + z 1 − y − z + x + y 1 − x − z + y + z 1 − x − y = z + x x + x + y y + y + z z . Note that this expression is homogeneous in x , y , and z , so we can discard the condition x + y + z = 1 .
We see that z + x x + x + y y + y + z z > x + y + z x + x + y + z y + x + y + z z = 1 .
Now, let x = 1 , y = ϵ , and z = ϵ 2 , where ϵ is a positive real number. As ϵ → 0 + , z + x x + x + y y + y + z z = ϵ 2 + 1 1 + 1 + ϵ ϵ + ϵ + ϵ 2 ϵ 2 = ϵ 2 + 1 1 + 1 + ϵ ϵ + 1 + ϵ ϵ → 1 , so the bound of 1 cannot be replaced by a larger number.