Prove that $frac6(a^2 + b^2 + c^2)a + b + c geq frac(a + b)^2b + c + frac(b + c)^2c + a + frac(a + c)^2a + b$

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite
1












Prove that if $a,b,c$ are the lengths of the edges of a given triangle, then the following inequality holds:



$frac6(a^2 + b^2 + c^2)a + b + c geq frac(a + b)^2b + c + frac(b + c)^2c + a + frac(a + c)^2a + b$.



I have tried so far using the Ravi substitution, but the expression got even uglier. I have also tried making the substitutions: $x = a + b$, $y = b + c$, $z = a + c$, and after using $3(a^2 + b^2 + c^2) geq (a + b + c)^2$, this resulted in showing that: $x + y + z geq fracx^2y + fracy^2z + fracz^2x$, where we also know (from triangle inequality) that: $z geq fracx+y3$ and the other 2 analogues, but at this point I got stuck.




inequality a.m.-g.m.-inequality cauchy-schwarz-inequality geometric-inequalities




share|cite|improve this question



















  • This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
    – Carl Mummert
    Aug 7 at 17:35














up vote
1
down vote

favorite
1












Prove that if $a,b,c$ are the lengths of the edges of a given triangle, then the following inequality holds:



$frac6(a^2 + b^2 + c^2)a + b + c geq frac(a + b)^2b + c + frac(b + c)^2c + a + frac(a + c)^2a + b$.



I have tried so far using the Ravi substitution, but the expression got even uglier. I have also tried making the substitutions: $x = a + b$, $y = b + c$, $z = a + c$, and after using $3(a^2 + b^2 + c^2) geq (a + b + c)^2$, this resulted in showing that: $x + y + z geq fracx^2y + fracy^2z + fracz^2x$, where we also know (from triangle inequality) that: $z geq fracx+y3$ and the other 2 analogues, but at this point I got stuck.




inequality a.m.-g.m.-inequality cauchy-schwarz-inequality geometric-inequalities




share|cite|improve this question



















  • This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
    – Carl Mummert
    Aug 7 at 17:35












up vote
1
down vote

favorite
1









up vote
1
down vote

favorite
1






1





Prove that if $a,b,c$ are the lengths of the edges of a given triangle, then the following inequality holds:



$frac6(a^2 + b^2 + c^2)a + b + c geq frac(a + b)^2b + c + frac(b + c)^2c + a + frac(a + c)^2a + b$.



I have tried so far using the Ravi substitution, but the expression got even uglier. I have also tried making the substitutions: $x = a + b$, $y = b + c$, $z = a + c$, and after using $3(a^2 + b^2 + c^2) geq (a + b + c)^2$, this resulted in showing that: $x + y + z geq fracx^2y + fracy^2z + fracz^2x$, where we also know (from triangle inequality) that: $z geq fracx+y3$ and the other 2 analogues, but at this point I got stuck.




inequality a.m.-g.m.-inequality cauchy-schwarz-inequality geometric-inequalities




share|cite|improve this question











Prove that if $a,b,c$ are the lengths of the edges of a given triangle, then the following inequality holds:



$frac6(a^2 + b^2 + c^2)a + b + c geq frac(a + b)^2b + c + frac(b + c)^2c + a + frac(a + c)^2a + b$.



I have tried so far using the Ravi substitution, but the expression got even uglier. I have also tried making the substitutions: $x = a + b$, $y = b + c$, $z = a + c$, and after using $3(a^2 + b^2 + c^2) geq (a + b + c)^2$, this resulted in showing that: $x + y + z geq fracx^2y + fracy^2z + fracz^2x$, where we also know (from triangle inequality) that: $z geq fracx+y3$ and the other 2 analogues, but at this point I got stuck.





inequality a.m.-g.m.-inequality cauchy-schwarz-inequality geometric-inequalities





share|cite|improve this question










share|cite|improve this question




share|cite|improve this question









asked Aug 6 at 19:21









Sandel

263




263











  • This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
    – Carl Mummert
    Aug 7 at 17:35
















  • This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
    – Carl Mummert
    Aug 7 at 17:35















This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
– Carl Mummert
Aug 7 at 17:35




This question is missing important information: the source and motivation of the problem. You can edit the post to add additional information. For advice on writing a good question, see math.meta.stackexchange.com/questions/9959/…
– Carl Mummert
Aug 7 at 17:35










2 Answers
2






active

oldest

votes

















up vote
0
down vote













Computer assisted proof.



The sides of the triangle can be cyclically rearranged, so that $a$ is the smallest side. Then the other two sides are of the shape $a+s$, $a+s+t$ with $0le s$ and $0le t<a$. (The last inequality, $t< a$, insures that the biggest side, $a+s+t$, is $< a+(a+s)$.



We have then to consider the two cases, where $a+s$, and $a+s+t$ are either $b,c$, or $c,b$.



We compute the difference of the quantities in the OP:



sage: var('a,b,c,s,t');
sage: f(a,b,c) = (a+b)^2 / (b+c)
sage: E(a,b,c) = 6*(a^2+b^2+c^2)/(a+b+c) - f(a,b,c) - f(b,c,a) - f(c,a,b)
sage: G(a,b,c) = E(a,b,c).numerator()

sage: G(a,a+s,a+s+t).expand()
8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
+ 36*a^2*s^2*t + 34*a*s^3*t + 9*s^4*t + 8*a^3*t^2 + 30*a^2*s*t^2
+ 33*a*s^2*t^2 + 10*s^3*t^2 + 6*a^2*t^3 + 10*a*s*t^3 + 3*s^2*t^3
- a*t^4 - 2*s*t^4 - t^5

sage: G(a,a+s+t,a+s).expand()
8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
+ 18*a^2*s^2*t + 10*a*s^3*t + s^4*t + 8*a^3*t^2 + 12*a^2*s*t^2 
- 3*a*s^2*t^2 - 6*s^3*t^2 
+ 6*a^2*t^3
- 2*a*s*t^3 - 7*s^2*t^3 - a*t^4 - 4*s*t^4 - t^5


(Sage code was inserted. Slightly rearranged to fit in the window.)



So we have to dominate the minus terms by using the plus terms.



In the first case things are simple, we have for instance $8a^3t^2 -at^4-t^5>0$, and $8a^3st-2st^4>0$.



In the second case we have more to type, there is no intelligence involved more than matching the degrees of $s$ while covering the minus terms with the plus terms:
$$
beginaligned
8 , a^3 s^2 + 18 , a^2 s^2 t - 3 , a s^2 t^2 - 7 , s^2 t^3 &ge 0 ,\
18 , a^2 s^3 - 6 , s^3 t^2 &ge 0 ,\
8 , a^3 s t - 2 , a s t^3 - 4 , s t^4 &ge 0 ,\
8 , a^3 t^2 + 6 , a^2 t^3 - a t^4 - t^5 &>0 .
endaligned
$$
$square$



Personal note: The given proof misses by intention any beauty, since the author of the problem also tried desperately to offer an inequality without symmetry, without a visual possibility of a Chebyshev rearrangement, and with the $ge$ sign on the side that does not allow an application of a Cauchy inequality, so that things may become symmetric after some steps. I hope (s)he may enjoy this proof, at least as i enjoyed typing it.






share|cite|improve this answer




























    up vote
    0
    down vote













    Let $c=maxa,b,c$, $a=x+u$, $b=x+v$ and $c=x+u+v$, where $x>0$, $ugeq0$ and $vgeq0.$



    Thus, we need to prove that
    $$8(u^2-uv+v^2)x^3+6(3u^3-2u^2v+uv^2+3v^3)x^2+$$
    $$+(11u^4+2u^3v-15u^2v^2+26uv^3+11v^4)x+2(u^5+u^4v-3u^3v^2+u^2v^2+5uv^4+v^5)geq0,$$
    which is obvious.



    Also, the $uvw$'s technique helps, but it's very complicated here.






    share|cite|improve this answer























      Your Answer




      StackExchange.ifUsing("editor", function ()
      return StackExchange.using("mathjaxEditing", function ()
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      );
      );
      , "mathjax-editing");

      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "69"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      convertImagesToLinks: true,
      noModals: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: 10,
      bindNavPrevention: true,
      postfix: "",
      noCode: true, onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );








       

      draft saved


      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2874232%2fprove-that-frac6a2-b2-c2a-b-c-geq-fraca-b2b-c%23new-answer', 'question_page');

      );

      Post as a guest

















      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      0
      down vote













      Computer assisted proof.



      The sides of the triangle can be cyclically rearranged, so that $a$ is the smallest side. Then the other two sides are of the shape $a+s$, $a+s+t$ with $0le s$ and $0le t<a$. (The last inequality, $t< a$, insures that the biggest side, $a+s+t$, is $< a+(a+s)$.



      We have then to consider the two cases, where $a+s$, and $a+s+t$ are either $b,c$, or $c,b$.



      We compute the difference of the quantities in the OP:



      sage: var('a,b,c,s,t');
      sage: f(a,b,c) = (a+b)^2 / (b+c)
      sage: E(a,b,c) = 6*(a^2+b^2+c^2)/(a+b+c) - f(a,b,c) - f(b,c,a) - f(c,a,b)
      sage: G(a,b,c) = E(a,b,c).numerator()

      sage: G(a,a+s,a+s+t).expand()
      8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
      + 36*a^2*s^2*t + 34*a*s^3*t + 9*s^4*t + 8*a^3*t^2 + 30*a^2*s*t^2
      + 33*a*s^2*t^2 + 10*s^3*t^2 + 6*a^2*t^3 + 10*a*s*t^3 + 3*s^2*t^3
      - a*t^4 - 2*s*t^4 - t^5

      sage: G(a,a+s+t,a+s).expand()
      8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
      + 18*a^2*s^2*t + 10*a*s^3*t + s^4*t + 8*a^3*t^2 + 12*a^2*s*t^2 
      - 3*a*s^2*t^2 - 6*s^3*t^2 
      + 6*a^2*t^3
      - 2*a*s*t^3 - 7*s^2*t^3 - a*t^4 - 4*s*t^4 - t^5


      (Sage code was inserted. Slightly rearranged to fit in the window.)



      So we have to dominate the minus terms by using the plus terms.



      In the first case things are simple, we have for instance $8a^3t^2 -at^4-t^5>0$, and $8a^3st-2st^4>0$.



      In the second case we have more to type, there is no intelligence involved more than matching the degrees of $s$ while covering the minus terms with the plus terms:
      $$
      beginaligned
      8 , a^3 s^2 + 18 , a^2 s^2 t - 3 , a s^2 t^2 - 7 , s^2 t^3 &ge 0 ,\
      18 , a^2 s^3 - 6 , s^3 t^2 &ge 0 ,\
      8 , a^3 s t - 2 , a s t^3 - 4 , s t^4 &ge 0 ,\
      8 , a^3 t^2 + 6 , a^2 t^3 - a t^4 - t^5 &>0 .
      endaligned
      $$
      $square$



      Personal note: The given proof misses by intention any beauty, since the author of the problem also tried desperately to offer an inequality without symmetry, without a visual possibility of a Chebyshev rearrangement, and with the $ge$ sign on the side that does not allow an application of a Cauchy inequality, so that things may become symmetric after some steps. I hope (s)he may enjoy this proof, at least as i enjoyed typing it.






      share|cite|improve this answer

























        up vote
        0
        down vote













        Computer assisted proof.



        The sides of the triangle can be cyclically rearranged, so that $a$ is the smallest side. Then the other two sides are of the shape $a+s$, $a+s+t$ with $0le s$ and $0le t<a$. (The last inequality, $t< a$, insures that the biggest side, $a+s+t$, is $< a+(a+s)$.



        We have then to consider the two cases, where $a+s$, and $a+s+t$ are either $b,c$, or $c,b$.



        We compute the difference of the quantities in the OP:



        sage: var('a,b,c,s,t');
        sage: f(a,b,c) = (a+b)^2 / (b+c)
        sage: E(a,b,c) = 6*(a^2+b^2+c^2)/(a+b+c) - f(a,b,c) - f(b,c,a) - f(c,a,b)
        sage: G(a,b,c) = E(a,b,c).numerator()

        sage: G(a,a+s,a+s+t).expand()
        8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
        + 36*a^2*s^2*t + 34*a*s^3*t + 9*s^4*t + 8*a^3*t^2 + 30*a^2*s*t^2
        + 33*a*s^2*t^2 + 10*s^3*t^2 + 6*a^2*t^3 + 10*a*s*t^3 + 3*s^2*t^3
        - a*t^4 - 2*s*t^4 - t^5

        sage: G(a,a+s+t,a+s).expand()
        8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
        + 18*a^2*s^2*t + 10*a*s^3*t + s^4*t + 8*a^3*t^2 + 12*a^2*s*t^2 
        - 3*a*s^2*t^2 - 6*s^3*t^2 
        + 6*a^2*t^3
        - 2*a*s*t^3 - 7*s^2*t^3 - a*t^4 - 4*s*t^4 - t^5


        (Sage code was inserted. Slightly rearranged to fit in the window.)



        So we have to dominate the minus terms by using the plus terms.



        In the first case things are simple, we have for instance $8a^3t^2 -at^4-t^5>0$, and $8a^3st-2st^4>0$.



        In the second case we have more to type, there is no intelligence involved more than matching the degrees of $s$ while covering the minus terms with the plus terms:
        $$
        beginaligned
        8 , a^3 s^2 + 18 , a^2 s^2 t - 3 , a s^2 t^2 - 7 , s^2 t^3 &ge 0 ,\
        18 , a^2 s^3 - 6 , s^3 t^2 &ge 0 ,\
        8 , a^3 s t - 2 , a s t^3 - 4 , s t^4 &ge 0 ,\
        8 , a^3 t^2 + 6 , a^2 t^3 - a t^4 - t^5 &>0 .
        endaligned
        $$
        $square$



        Personal note: The given proof misses by intention any beauty, since the author of the problem also tried desperately to offer an inequality without symmetry, without a visual possibility of a Chebyshev rearrangement, and with the $ge$ sign on the side that does not allow an application of a Cauchy inequality, so that things may become symmetric after some steps. I hope (s)he may enjoy this proof, at least as i enjoyed typing it.






        share|cite|improve this answer























          up vote
          0
          down vote










          up vote
          0
          down vote









          Computer assisted proof.



          The sides of the triangle can be cyclically rearranged, so that $a$ is the smallest side. Then the other two sides are of the shape $a+s$, $a+s+t$ with $0le s$ and $0le t<a$. (The last inequality, $t< a$, insures that the biggest side, $a+s+t$, is $< a+(a+s)$.



          We have then to consider the two cases, where $a+s$, and $a+s+t$ are either $b,c$, or $c,b$.



          We compute the difference of the quantities in the OP:



          sage: var('a,b,c,s,t');
          sage: f(a,b,c) = (a+b)^2 / (b+c)
          sage: E(a,b,c) = 6*(a^2+b^2+c^2)/(a+b+c) - f(a,b,c) - f(b,c,a) - f(c,a,b)
          sage: G(a,b,c) = E(a,b,c).numerator()

          sage: G(a,a+s,a+s+t).expand()
          8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
          + 36*a^2*s^2*t + 34*a*s^3*t + 9*s^4*t + 8*a^3*t^2 + 30*a^2*s*t^2
          + 33*a*s^2*t^2 + 10*s^3*t^2 + 6*a^2*t^3 + 10*a*s*t^3 + 3*s^2*t^3
          - a*t^4 - 2*s*t^4 - t^5

          sage: G(a,a+s+t,a+s).expand()
          8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
          + 18*a^2*s^2*t + 10*a*s^3*t + s^4*t + 8*a^3*t^2 + 12*a^2*s*t^2 
          - 3*a*s^2*t^2 - 6*s^3*t^2 
          + 6*a^2*t^3
          - 2*a*s*t^3 - 7*s^2*t^3 - a*t^4 - 4*s*t^4 - t^5


          (Sage code was inserted. Slightly rearranged to fit in the window.)



          So we have to dominate the minus terms by using the plus terms.



          In the first case things are simple, we have for instance $8a^3t^2 -at^4-t^5>0$, and $8a^3st-2st^4>0$.



          In the second case we have more to type, there is no intelligence involved more than matching the degrees of $s$ while covering the minus terms with the plus terms:
          $$
          beginaligned
          8 , a^3 s^2 + 18 , a^2 s^2 t - 3 , a s^2 t^2 - 7 , s^2 t^3 &ge 0 ,\
          18 , a^2 s^3 - 6 , s^3 t^2 &ge 0 ,\
          8 , a^3 s t - 2 , a s t^3 - 4 , s t^4 &ge 0 ,\
          8 , a^3 t^2 + 6 , a^2 t^3 - a t^4 - t^5 &>0 .
          endaligned
          $$
          $square$



          Personal note: The given proof misses by intention any beauty, since the author of the problem also tried desperately to offer an inequality without symmetry, without a visual possibility of a Chebyshev rearrangement, and with the $ge$ sign on the side that does not allow an application of a Cauchy inequality, so that things may become symmetric after some steps. I hope (s)he may enjoy this proof, at least as i enjoyed typing it.






          share|cite|improve this answer













          Computer assisted proof.



          The sides of the triangle can be cyclically rearranged, so that $a$ is the smallest side. Then the other two sides are of the shape $a+s$, $a+s+t$ with $0le s$ and $0le t<a$. (The last inequality, $t< a$, insures that the biggest side, $a+s+t$, is $< a+(a+s)$.



          We have then to consider the two cases, where $a+s$, and $a+s+t$ are either $b,c$, or $c,b$.



          We compute the difference of the quantities in the OP:



          sage: var('a,b,c,s,t');
          sage: f(a,b,c) = (a+b)^2 / (b+c)
          sage: E(a,b,c) = 6*(a^2+b^2+c^2)/(a+b+c) - f(a,b,c) - f(b,c,a) - f(c,a,b)
          sage: G(a,b,c) = E(a,b,c).numerator()

          sage: G(a,a+s,a+s+t).expand()
          8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
          + 36*a^2*s^2*t + 34*a*s^3*t + 9*s^4*t + 8*a^3*t^2 + 30*a^2*s*t^2
          + 33*a*s^2*t^2 + 10*s^3*t^2 + 6*a^2*t^3 + 10*a*s*t^3 + 3*s^2*t^3
          - a*t^4 - 2*s*t^4 - t^5

          sage: G(a,a+s+t,a+s).expand()
          8*a^3*s^2 + 18*a^2*s^3 + 11*a*s^4 + 2*s^5 + 8*a^3*s*t 
          + 18*a^2*s^2*t + 10*a*s^3*t + s^4*t + 8*a^3*t^2 + 12*a^2*s*t^2 
          - 3*a*s^2*t^2 - 6*s^3*t^2 
          + 6*a^2*t^3
          - 2*a*s*t^3 - 7*s^2*t^3 - a*t^4 - 4*s*t^4 - t^5


          (Sage code was inserted. Slightly rearranged to fit in the window.)



          So we have to dominate the minus terms by using the plus terms.



          In the first case things are simple, we have for instance $8a^3t^2 -at^4-t^5>0$, and $8a^3st-2st^4>0$.



          In the second case we have more to type, there is no intelligence involved more than matching the degrees of $s$ while covering the minus terms with the plus terms:
          $$
          beginaligned
          8 , a^3 s^2 + 18 , a^2 s^2 t - 3 , a s^2 t^2 - 7 , s^2 t^3 &ge 0 ,\
          18 , a^2 s^3 - 6 , s^3 t^2 &ge 0 ,\
          8 , a^3 s t - 2 , a s t^3 - 4 , s t^4 &ge 0 ,\
          8 , a^3 t^2 + 6 , a^2 t^3 - a t^4 - t^5 &>0 .
          endaligned
          $$
          $square$



          Personal note: The given proof misses by intention any beauty, since the author of the problem also tried desperately to offer an inequality without symmetry, without a visual possibility of a Chebyshev rearrangement, and with the $ge$ sign on the side that does not allow an application of a Cauchy inequality, so that things may become symmetric after some steps. I hope (s)he may enjoy this proof, at least as i enjoyed typing it.







          share|cite|improve this answer













          share|cite|improve this answer



          share|cite|improve this answer











          answered Aug 6 at 20:29









          dan_fulea

          4,2171211




          4,2171211




















              up vote
              0
              down vote













              Let $c=maxa,b,c$, $a=x+u$, $b=x+v$ and $c=x+u+v$, where $x>0$, $ugeq0$ and $vgeq0.$



              Thus, we need to prove that
              $$8(u^2-uv+v^2)x^3+6(3u^3-2u^2v+uv^2+3v^3)x^2+$$
              $$+(11u^4+2u^3v-15u^2v^2+26uv^3+11v^4)x+2(u^5+u^4v-3u^3v^2+u^2v^2+5uv^4+v^5)geq0,$$
              which is obvious.



              Also, the $uvw$'s technique helps, but it's very complicated here.






              share|cite|improve this answer



























                up vote
                0
                down vote













                Let $c=maxa,b,c$, $a=x+u$, $b=x+v$ and $c=x+u+v$, where $x>0$, $ugeq0$ and $vgeq0.$



                Thus, we need to prove that
                $$8(u^2-uv+v^2)x^3+6(3u^3-2u^2v+uv^2+3v^3)x^2+$$
                $$+(11u^4+2u^3v-15u^2v^2+26uv^3+11v^4)x+2(u^5+u^4v-3u^3v^2+u^2v^2+5uv^4+v^5)geq0,$$
                which is obvious.



                Also, the $uvw$'s technique helps, but it's very complicated here.






                share|cite|improve this answer

























                  up vote
                  0
                  down vote










                  up vote
                  0
                  down vote









                  Let $c=maxa,b,c$, $a=x+u$, $b=x+v$ and $c=x+u+v$, where $x>0$, $ugeq0$ and $vgeq0.$



                  Thus, we need to prove that
                  $$8(u^2-uv+v^2)x^3+6(3u^3-2u^2v+uv^2+3v^3)x^2+$$
                  $$+(11u^4+2u^3v-15u^2v^2+26uv^3+11v^4)x+2(u^5+u^4v-3u^3v^2+u^2v^2+5uv^4+v^5)geq0,$$
                  which is obvious.



                  Also, the $uvw$'s technique helps, but it's very complicated here.






                  share|cite|improve this answer















                  Let $c=maxa,b,c$, $a=x+u$, $b=x+v$ and $c=x+u+v$, where $x>0$, $ugeq0$ and $vgeq0.$



                  Thus, we need to prove that
                  $$8(u^2-uv+v^2)x^3+6(3u^3-2u^2v+uv^2+3v^3)x^2+$$
                  $$+(11u^4+2u^3v-15u^2v^2+26uv^3+11v^4)x+2(u^5+u^4v-3u^3v^2+u^2v^2+5uv^4+v^5)geq0,$$
                  which is obvious.



                  Also, the $uvw$'s technique helps, but it's very complicated here.







                  share|cite|improve this answer















                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Aug 7 at 7:08


























                  answered Aug 7 at 3:09









                  Michael Rozenberg

                  88.2k1579180




                  88.2k1579180






















                       

                      draft saved


                      draft discarded


























                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2874232%2fprove-that-frac6a2-b2-c2a-b-c-geq-fraca-b2b-c%23new-answer', 'question_page');

                      );

                      Post as a guest
































































                      Comments

                      Post a Comment

                      Popular posts from this blog

                      What is the equation of a 3D cone with generalised tilt?

                      Image
                      Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite What is the equation of a 3D cone with generalized tilt? I've noticed that in most equations given to represent a cone, there is no parameter which defines the tilt of the cone in 3D space and that most of them have their point at the origin $(0,0,0)$ - I was wondering if anyone could give me a more generalized cone equation for a cone in any position in 3D space 3d share | cite | improve this question edited Jul 25 '16 at 0:05 ervx 9,425 3 13 36 asked Jul 24 '16 at 15:38 Charlene 11 2 2 Welcome to Math.SE! Could you please explain a few things to help people give an answer useful to you: 1. What do you mean by "generalized tilt"? 2. Are you asking about a right circular cone? Does the angle at the vertex matter? 3. What form of answer (implicit, parametric...?) are you looking for? 4. If this is homework, what tools do you have available, an...
                      Read more

                      Relationship between determinant of matrix and determinant of adjoint?

                      Image
                      Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite We are studying adjoints in class, and I was curious if there is a relationship between the determinant of matrix A, and the determinant of the adjoint of matrix A? I assume there would be a relationship because finding the adjoint requires creating a cofactor matrix and then transposing it. linear-algebra determinant adjoint-operators share | cite | improve this question asked Nov 17 '17 at 17:32 CluelessCoder 32 5 For a square matrix $A$ of order $n$, we have $A(operatornameadj A)=(operatornameadj A)A=|A|I_n$ where $I_n$ is the identity matrix of order $n$. This should tell you about the determinant of the adjoint in terms of that of $A$ (use multiplicative property and other elementary properties of determinants). – Prasun Biswas Nov 17 '17 at 17:35 1 @CluelessCoder: see here: math.stackexchange.com/questions/516127/…...
                      Read more

                      Color the edges and diagonals of a regular polygon

                      Image
                      Clash Royale CLAN TAG #URR8PPP up vote 5 down vote favorite 1 Here is the problem: For what $n$ is it possible to color the edges and diagonals of an $n$-side regular polygon with $dfracbinomn23$ colors, such that you use every color exactly three times and for every color the three segments (edges or diagonals) with that color form a triangle? Trivially $nequiv 0 text or 1 pmod3$. I can also prove that if the statement is true for $k$ than it is true for $3k$ as well. How to finish? Please help! Thanks combinatorial-geometry share | cite | improve this question edited Aug 6 at 21:57 alcana 118 4 asked Aug 6 at 21:15 Leo Gardner 356 11 Even assuming "polyhpn" in the title is a typo for polygon , it is unclear what you mean by "the edges and sides". Aren't the side of a regular polygon the same as the edges? A regular $n$-sided polygon has $n$ edges. – hardmath Aug 6 at 21:20 3 $n$ ne...
                      Read more