Given $n_1 ge d_1 ge 0$, $n_2 ge d_2 ge 0$ and $d_1 + d_2 gt 0$, how do I show that…











up vote
0
down vote

favorite












Given $n_1 ge d_1 ge 0$, $n_2 ge d_2 ge 0$ and $d_1 + d_2 gt 0$, how do I show that
$$Big( frac{n_1}{d_1} Big)^{d_1} Big( frac{n_2 }{d_2} Big)^{d_2} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$$



I have managed to split this into 3 cases:



Case 1: $n_1d_2 = d_1n_2$



This leads to $Big( frac{n_1}{d_1} Big)^{d_1} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which satisfies the expression above.



My problem here is with cases 2 and 3.



For example,
Case 2: $n_1d_2 le n_2d_1$



This leads to $Big( frac{n_1}{d_1} Big)^{d_1} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} ge Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which's where I am conflicted.



How can I show that this conflict works itself out to satisfy th main expression?



Thank you.










share|cite|improve this question




























    up vote
    0
    down vote

    favorite












    Given $n_1 ge d_1 ge 0$, $n_2 ge d_2 ge 0$ and $d_1 + d_2 gt 0$, how do I show that
    $$Big( frac{n_1}{d_1} Big)^{d_1} Big( frac{n_2 }{d_2} Big)^{d_2} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$$



    I have managed to split this into 3 cases:



    Case 1: $n_1d_2 = d_1n_2$



    This leads to $Big( frac{n_1}{d_1} Big)^{d_1} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which satisfies the expression above.



    My problem here is with cases 2 and 3.



    For example,
    Case 2: $n_1d_2 le n_2d_1$



    This leads to $Big( frac{n_1}{d_1} Big)^{d_1} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} ge Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which's where I am conflicted.



    How can I show that this conflict works itself out to satisfy th main expression?



    Thank you.










    share|cite|improve this question


























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      Given $n_1 ge d_1 ge 0$, $n_2 ge d_2 ge 0$ and $d_1 + d_2 gt 0$, how do I show that
      $$Big( frac{n_1}{d_1} Big)^{d_1} Big( frac{n_2 }{d_2} Big)^{d_2} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$$



      I have managed to split this into 3 cases:



      Case 1: $n_1d_2 = d_1n_2$



      This leads to $Big( frac{n_1}{d_1} Big)^{d_1} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which satisfies the expression above.



      My problem here is with cases 2 and 3.



      For example,
      Case 2: $n_1d_2 le n_2d_1$



      This leads to $Big( frac{n_1}{d_1} Big)^{d_1} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} ge Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which's where I am conflicted.



      How can I show that this conflict works itself out to satisfy th main expression?



      Thank you.










      share|cite|improve this question















      Given $n_1 ge d_1 ge 0$, $n_2 ge d_2 ge 0$ and $d_1 + d_2 gt 0$, how do I show that
      $$Big( frac{n_1}{d_1} Big)^{d_1} Big( frac{n_2 }{d_2} Big)^{d_2} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$$



      I have managed to split this into 3 cases:



      Case 1: $n_1d_2 = d_1n_2$



      This leads to $Big( frac{n_1}{d_1} Big)^{d_1} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} = Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which satisfies the expression above.



      My problem here is with cases 2 and 3.



      For example,
      Case 2: $n_1d_2 le n_2d_1$



      This leads to $Big( frac{n_1}{d_1} Big)^{d_1} le Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_1}$, and also leads to $Big( frac{n_2}{d_2} Big)^{d_2} ge Big(frac{(n_1 + n_2)}{d_1 + d_2}Big)^{d_2}$, which's where I am conflicted.



      How can I show that this conflict works itself out to satisfy th main expression?



      Thank you.







      combinatorics algebra-precalculus discrete-mathematics






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 18 at 12:39

























      asked Nov 18 at 9:43









      user617040

      32




      32






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote



          accepted










          You can show your inequality by taking the logarithm and using the concavity of $log$:





          • $log(lambda x + (1-lambda)y) geq lambda log x + (1-lambda) log y$ for $lambda in [0,1]$


          Set




          • $lambda = frac{d_1}{d_1+d_2} Rightarrow 1-lambda = frac{d_2}{d_1+d_2}$

          • $x= frac{n_1}{d_1}$

          • $y= frac{n_2}{d_2}$


          Taking the logarithm on the right side of your inequality gives



          $$d_1 log frac{n_1}{d_1} + d_2 log frac{n_2}{d_2} le (d_1+d_2) log left( frac{n_1}{d_1+d_2} + frac{n_2}{d_1+d_2}right)$$



          Can you take it from here?






          share|cite|improve this answer























          • I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
            – user617040
            Nov 18 at 10:53











          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: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          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%2f3003319%2fgiven-n-1-ge-d-1-ge-0-n-2-ge-d-2-ge-0-and-d-1-d-2-gt-0-how-do-i-s%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          0
          down vote



          accepted










          You can show your inequality by taking the logarithm and using the concavity of $log$:





          • $log(lambda x + (1-lambda)y) geq lambda log x + (1-lambda) log y$ for $lambda in [0,1]$


          Set




          • $lambda = frac{d_1}{d_1+d_2} Rightarrow 1-lambda = frac{d_2}{d_1+d_2}$

          • $x= frac{n_1}{d_1}$

          • $y= frac{n_2}{d_2}$


          Taking the logarithm on the right side of your inequality gives



          $$d_1 log frac{n_1}{d_1} + d_2 log frac{n_2}{d_2} le (d_1+d_2) log left( frac{n_1}{d_1+d_2} + frac{n_2}{d_1+d_2}right)$$



          Can you take it from here?






          share|cite|improve this answer























          • I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
            – user617040
            Nov 18 at 10:53















          up vote
          0
          down vote



          accepted










          You can show your inequality by taking the logarithm and using the concavity of $log$:





          • $log(lambda x + (1-lambda)y) geq lambda log x + (1-lambda) log y$ for $lambda in [0,1]$


          Set




          • $lambda = frac{d_1}{d_1+d_2} Rightarrow 1-lambda = frac{d_2}{d_1+d_2}$

          • $x= frac{n_1}{d_1}$

          • $y= frac{n_2}{d_2}$


          Taking the logarithm on the right side of your inequality gives



          $$d_1 log frac{n_1}{d_1} + d_2 log frac{n_2}{d_2} le (d_1+d_2) log left( frac{n_1}{d_1+d_2} + frac{n_2}{d_1+d_2}right)$$



          Can you take it from here?






          share|cite|improve this answer























          • I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
            – user617040
            Nov 18 at 10:53













          up vote
          0
          down vote



          accepted







          up vote
          0
          down vote



          accepted






          You can show your inequality by taking the logarithm and using the concavity of $log$:





          • $log(lambda x + (1-lambda)y) geq lambda log x + (1-lambda) log y$ for $lambda in [0,1]$


          Set




          • $lambda = frac{d_1}{d_1+d_2} Rightarrow 1-lambda = frac{d_2}{d_1+d_2}$

          • $x= frac{n_1}{d_1}$

          • $y= frac{n_2}{d_2}$


          Taking the logarithm on the right side of your inequality gives



          $$d_1 log frac{n_1}{d_1} + d_2 log frac{n_2}{d_2} le (d_1+d_2) log left( frac{n_1}{d_1+d_2} + frac{n_2}{d_1+d_2}right)$$



          Can you take it from here?






          share|cite|improve this answer














          You can show your inequality by taking the logarithm and using the concavity of $log$:





          • $log(lambda x + (1-lambda)y) geq lambda log x + (1-lambda) log y$ for $lambda in [0,1]$


          Set




          • $lambda = frac{d_1}{d_1+d_2} Rightarrow 1-lambda = frac{d_2}{d_1+d_2}$

          • $x= frac{n_1}{d_1}$

          • $y= frac{n_2}{d_2}$


          Taking the logarithm on the right side of your inequality gives



          $$d_1 log frac{n_1}{d_1} + d_2 log frac{n_2}{d_2} le (d_1+d_2) log left( frac{n_1}{d_1+d_2} + frac{n_2}{d_1+d_2}right)$$



          Can you take it from here?







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 18 at 10:24

























          answered Nov 18 at 10:16









          trancelocation

          8,5621520




          8,5621520












          • I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
            – user617040
            Nov 18 at 10:53


















          • I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
            – user617040
            Nov 18 at 10:53
















          I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
          – user617040
          Nov 18 at 10:53




          I can, yes! Thank you for your response! Although I'm wondering if there's any simpler way I could try to reach the same conclusion.
          – user617040
          Nov 18 at 10:53


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3003319%2fgiven-n-1-ge-d-1-ge-0-n-2-ge-d-2-ge-0-and-d-1-d-2-gt-0-how-do-i-s%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          AnyDesk - Fatal Program Failure

          QoS: MAC-Priority for clients behind a repeater

          Актюбинская область