Can we prove this inequality $1+sqrt2+cdots+sqrtn<frac4n+36sqrtn$ using integrals by parts?

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











up vote
5
down vote

favorite












Can we prove this inequality $1+sqrt2+cdots+sqrtn<dfrac4n+36sqrtn$ using integrals by parts?



I need to prove this inequality, and I tried this way:



$$beginsplit
int_0^nsqrtx ,dx &=sumlimits_k=1^n int_k-1^k sqrtx, dx\
&=sumlimits_k=1^n int_0^1 sqrtt+k-1 , dt\
&=sumlimits_k=1^n sqrtk-sumlimits_k=1^n int_0^1dfract2sqrtt+k-1,dt
endsplit$$



Thus
$$sumlimits_k=1^n sqrtk=int_0^n sqrtx, dx+sumlimits_k=1^n int_0^1 dfract2sqrtt+k-1, dt$$.



But maybe I didn't find some inequality trick, I cannot find a proper approxmation of the sum of the integrals.










share|cite|improve this question



























    up vote
    5
    down vote

    favorite












    Can we prove this inequality $1+sqrt2+cdots+sqrtn<dfrac4n+36sqrtn$ using integrals by parts?



    I need to prove this inequality, and I tried this way:



    $$beginsplit
    int_0^nsqrtx ,dx &=sumlimits_k=1^n int_k-1^k sqrtx, dx\
    &=sumlimits_k=1^n int_0^1 sqrtt+k-1 , dt\
    &=sumlimits_k=1^n sqrtk-sumlimits_k=1^n int_0^1dfract2sqrtt+k-1,dt
    endsplit$$



    Thus
    $$sumlimits_k=1^n sqrtk=int_0^n sqrtx, dx+sumlimits_k=1^n int_0^1 dfract2sqrtt+k-1, dt$$.



    But maybe I didn't find some inequality trick, I cannot find a proper approxmation of the sum of the integrals.










    share|cite|improve this question

























      up vote
      5
      down vote

      favorite









      up vote
      5
      down vote

      favorite











      Can we prove this inequality $1+sqrt2+cdots+sqrtn<dfrac4n+36sqrtn$ using integrals by parts?



      I need to prove this inequality, and I tried this way:



      $$beginsplit
      int_0^nsqrtx ,dx &=sumlimits_k=1^n int_k-1^k sqrtx, dx\
      &=sumlimits_k=1^n int_0^1 sqrtt+k-1 , dt\
      &=sumlimits_k=1^n sqrtk-sumlimits_k=1^n int_0^1dfract2sqrtt+k-1,dt
      endsplit$$



      Thus
      $$sumlimits_k=1^n sqrtk=int_0^n sqrtx, dx+sumlimits_k=1^n int_0^1 dfract2sqrtt+k-1, dt$$.



      But maybe I didn't find some inequality trick, I cannot find a proper approxmation of the sum of the integrals.










      share|cite|improve this question















      Can we prove this inequality $1+sqrt2+cdots+sqrtn<dfrac4n+36sqrtn$ using integrals by parts?



      I need to prove this inequality, and I tried this way:



      $$beginsplit
      int_0^nsqrtx ,dx &=sumlimits_k=1^n int_k-1^k sqrtx, dx\
      &=sumlimits_k=1^n int_0^1 sqrtt+k-1 , dt\
      &=sumlimits_k=1^n sqrtk-sumlimits_k=1^n int_0^1dfract2sqrtt+k-1,dt
      endsplit$$



      Thus
      $$sumlimits_k=1^n sqrtk=int_0^n sqrtx, dx+sumlimits_k=1^n int_0^1 dfract2sqrtt+k-1, dt$$.



      But maybe I didn't find some inequality trick, I cannot find a proper approxmation of the sum of the integrals.







      calculus inequality summation






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Sep 13 at 15:07









      Martin Sleziak

      43.7k6113261




      43.7k6113261










      asked Sep 10 at 18:53









      闫嘉琦

      636111




      636111




















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          First, see that we have



          $$
          int_0^n sqrtx ;dx = frac4n6sqrtn
          $$



          which gives us a "part" of the demanded result. Moreover, it suggests that we should try to prove the following:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt < frac36sqrtn = frac12sqrtn
          $$



          Evaluating the integral we get:



          beginalign
          int_0^1 fract2sqrtt+k-1 ;dt &=
          int_k-1^k fracx-k+12sqrtx ;dx =
          frac12 int_k-1^k sqrtx ;dx - (k-1)
          int_k-1^k frac12sqrtx ;dx \
          &=
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right)
          endalign



          However, for all $k geq 1$, you can prove that:



          $$
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) <
          frac12 left(sqrtk-sqrtk-1right)
          $$



          So we end up with a telescoping sum and the result we wanted:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt <
          frac12 sum_k=1^n left(sqrtk-sqrtk-1right) =
          frac12 sqrtn
          $$






          share|cite|improve this answer






















          • I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
            – é—«å˜‰ç¦
            Sep 11 at 15:15










          • This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
            – mwt
            Sep 11 at 18:18

















          up vote
          2
          down vote













          Hint: Prove that $$int_k-1^ksqrtxdx>dfracsqrtk+sqrtk-12$$ and then sum up to get your desired conclusion. You can just do this manually or generally this follows from a very well-known fact that the trapeziodal rule underestimates integral if the function is concave down. ($f(x) = sqrtx$) is concave down)






          share|cite|improve this answer




















          • With the reverse inequality of f(x) is concave up.
            – marty cohen
            Sep 13 at 20:16










          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%2f2912228%2fcan-we-prove-this-inequality-1-sqrt2-cdots-sqrtn-frac4n36-sqrtn%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
          2
          down vote



          accepted










          First, see that we have



          $$
          int_0^n sqrtx ;dx = frac4n6sqrtn
          $$



          which gives us a "part" of the demanded result. Moreover, it suggests that we should try to prove the following:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt < frac36sqrtn = frac12sqrtn
          $$



          Evaluating the integral we get:



          beginalign
          int_0^1 fract2sqrtt+k-1 ;dt &=
          int_k-1^k fracx-k+12sqrtx ;dx =
          frac12 int_k-1^k sqrtx ;dx - (k-1)
          int_k-1^k frac12sqrtx ;dx \
          &=
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right)
          endalign



          However, for all $k geq 1$, you can prove that:



          $$
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) <
          frac12 left(sqrtk-sqrtk-1right)
          $$



          So we end up with a telescoping sum and the result we wanted:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt <
          frac12 sum_k=1^n left(sqrtk-sqrtk-1right) =
          frac12 sqrtn
          $$






          share|cite|improve this answer






















          • I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
            – é—«å˜‰ç¦
            Sep 11 at 15:15










          • This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
            – mwt
            Sep 11 at 18:18














          up vote
          2
          down vote



          accepted










          First, see that we have



          $$
          int_0^n sqrtx ;dx = frac4n6sqrtn
          $$



          which gives us a "part" of the demanded result. Moreover, it suggests that we should try to prove the following:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt < frac36sqrtn = frac12sqrtn
          $$



          Evaluating the integral we get:



          beginalign
          int_0^1 fract2sqrtt+k-1 ;dt &=
          int_k-1^k fracx-k+12sqrtx ;dx =
          frac12 int_k-1^k sqrtx ;dx - (k-1)
          int_k-1^k frac12sqrtx ;dx \
          &=
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right)
          endalign



          However, for all $k geq 1$, you can prove that:



          $$
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) <
          frac12 left(sqrtk-sqrtk-1right)
          $$



          So we end up with a telescoping sum and the result we wanted:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt <
          frac12 sum_k=1^n left(sqrtk-sqrtk-1right) =
          frac12 sqrtn
          $$






          share|cite|improve this answer






















          • I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
            – é—«å˜‰ç¦
            Sep 11 at 15:15










          • This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
            – mwt
            Sep 11 at 18:18












          up vote
          2
          down vote



          accepted







          up vote
          2
          down vote



          accepted






          First, see that we have



          $$
          int_0^n sqrtx ;dx = frac4n6sqrtn
          $$



          which gives us a "part" of the demanded result. Moreover, it suggests that we should try to prove the following:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt < frac36sqrtn = frac12sqrtn
          $$



          Evaluating the integral we get:



          beginalign
          int_0^1 fract2sqrtt+k-1 ;dt &=
          int_k-1^k fracx-k+12sqrtx ;dx =
          frac12 int_k-1^k sqrtx ;dx - (k-1)
          int_k-1^k frac12sqrtx ;dx \
          &=
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right)
          endalign



          However, for all $k geq 1$, you can prove that:



          $$
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) <
          frac12 left(sqrtk-sqrtk-1right)
          $$



          So we end up with a telescoping sum and the result we wanted:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt <
          frac12 sum_k=1^n left(sqrtk-sqrtk-1right) =
          frac12 sqrtn
          $$






          share|cite|improve this answer














          First, see that we have



          $$
          int_0^n sqrtx ;dx = frac4n6sqrtn
          $$



          which gives us a "part" of the demanded result. Moreover, it suggests that we should try to prove the following:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt < frac36sqrtn = frac12sqrtn
          $$



          Evaluating the integral we get:



          beginalign
          int_0^1 fract2sqrtt+k-1 ;dt &=
          int_k-1^k fracx-k+12sqrtx ;dx =
          frac12 int_k-1^k sqrtx ;dx - (k-1)
          int_k-1^k frac12sqrtx ;dx \
          &=
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right)
          endalign



          However, for all $k geq 1$, you can prove that:



          $$
          frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) <
          frac12 left(sqrtk-sqrtk-1right)
          $$



          So we end up with a telescoping sum and the result we wanted:



          $$
          sum_k=1^n int_0^1 fract2sqrtt+k-1 ;dt <
          frac12 sum_k=1^n left(sqrtk-sqrtk-1right) =
          frac12 sqrtn
          $$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Sep 11 at 6:25

























          answered Sep 10 at 20:43









          mwt

          546113




          546113











          • I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
            – é—«å˜‰ç¦
            Sep 11 at 15:15










          • This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
            – mwt
            Sep 11 at 18:18
















          • I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
            – é—«å˜‰ç¦
            Sep 11 at 15:15










          • This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
            – mwt
            Sep 11 at 18:18















          I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
          – é—«å˜‰ç¦
          Sep 11 at 15:15




          I can prove the inequality $frac13 left(-2ksqrtk + 2ksqrtk-1 + 3sqrtk - 2sqrtk-1right) < frac12 left(sqrtk-sqrtk-1right)$ by induction, but how can we prove it more strictly?
          – é—«å˜‰ç¦
          Sep 11 at 15:15












          This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
          – mwt
          Sep 11 at 18:18




          This inequality is equivalent to $(4k-1)sqrtk-1 < (4k-3)sqrtk$. Try to square it (both sides are $geq 0$ for $kgeq 1$).
          – mwt
          Sep 11 at 18:18










          up vote
          2
          down vote













          Hint: Prove that $$int_k-1^ksqrtxdx>dfracsqrtk+sqrtk-12$$ and then sum up to get your desired conclusion. You can just do this manually or generally this follows from a very well-known fact that the trapeziodal rule underestimates integral if the function is concave down. ($f(x) = sqrtx$) is concave down)






          share|cite|improve this answer




















          • With the reverse inequality of f(x) is concave up.
            – marty cohen
            Sep 13 at 20:16














          up vote
          2
          down vote













          Hint: Prove that $$int_k-1^ksqrtxdx>dfracsqrtk+sqrtk-12$$ and then sum up to get your desired conclusion. You can just do this manually or generally this follows from a very well-known fact that the trapeziodal rule underestimates integral if the function is concave down. ($f(x) = sqrtx$) is concave down)






          share|cite|improve this answer




















          • With the reverse inequality of f(x) is concave up.
            – marty cohen
            Sep 13 at 20:16












          up vote
          2
          down vote










          up vote
          2
          down vote









          Hint: Prove that $$int_k-1^ksqrtxdx>dfracsqrtk+sqrtk-12$$ and then sum up to get your desired conclusion. You can just do this manually or generally this follows from a very well-known fact that the trapeziodal rule underestimates integral if the function is concave down. ($f(x) = sqrtx$) is concave down)






          share|cite|improve this answer












          Hint: Prove that $$int_k-1^ksqrtxdx>dfracsqrtk+sqrtk-12$$ and then sum up to get your desired conclusion. You can just do this manually or generally this follows from a very well-known fact that the trapeziodal rule underestimates integral if the function is concave down. ($f(x) = sqrtx$) is concave down)







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Sep 10 at 20:06









          dezdichado

          5,5651828




          5,5651828











          • With the reverse inequality of f(x) is concave up.
            – marty cohen
            Sep 13 at 20:16
















          • With the reverse inequality of f(x) is concave up.
            – marty cohen
            Sep 13 at 20:16















          With the reverse inequality of f(x) is concave up.
          – marty cohen
          Sep 13 at 20:16




          With the reverse inequality of f(x) is concave up.
          – marty cohen
          Sep 13 at 20:16

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2912228%2fcan-we-prove-this-inequality-1-sqrt2-cdots-sqrtn-frac4n36-sqrtn%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          How to combine Bézier curves to a surface?

          Why am i infinitely getting the same tweet with the Twitter Search API?

          Carbon dioxide