How to evaluate $lim_{n to infty} sum_{k=1}^n frac{n+k}{n^3+k}$?











up vote
0
down vote

favorite













How to evaluate the following limit?
$$lim_{n to infty} sum_{k=1}^n frac{n+k}{n^3+k}$$




I think that every term of the sum is greater than the first one and smaller than the last one and then from the squeeze theorem the limit is $0$. However, I can't prove that inequality.






calculus sequences-and-series limits







share|cite|improve this question




















  • 1




    What are you asking?
    – Will M.
    Nov 19 at 18:31






  • 1




    The sum is less than $n frac{n +n}{n^3+1}$
    – RRL
    Nov 19 at 18:33

















up vote
0
down vote

favorite













How to evaluate the following limit?
$$lim_{n to infty} sum_{k=1}^n frac{n+k}{n^3+k}$$




I think that every term of the sum is greater than the first one and smaller than the last one and then from the squeeze theorem the limit is $0$. However, I can't prove that inequality.






calculus sequences-and-series limits







share|cite|improve this question




















  • 1




    What are you asking?
    – Will M.
    Nov 19 at 18:31






  • 1




    The sum is less than $n frac{n +n}{n^3+1}$
    – RRL
    Nov 19 at 18:33















up vote
0
down vote

favorite









up vote
0
down vote

favorite












How to evaluate the following limit?
$$lim_{n to infty} sum_{k=1}^n frac{n+k}{n^3+k}$$




I think that every term of the sum is greater than the first one and smaller than the last one and then from the squeeze theorem the limit is $0$. However, I can't prove that inequality.






calculus sequences-and-series limits







share|cite|improve this question
















How to evaluate the following limit?
$$lim_{n to infty} sum_{k=1}^n frac{n+k}{n^3+k}$$




I think that every term of the sum is greater than the first one and smaller than the last one and then from the squeeze theorem the limit is $0$. However, I can't prove that inequality.






calculus sequences-and-series limits




calculus sequences-and-series limits






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 2 days ago









user587192

1,21810




1,21810










asked Nov 19 at 18:27









user69503

486




486








  • 1




    What are you asking?
    – Will M.
    Nov 19 at 18:31






  • 1




    The sum is less than $n frac{n +n}{n^3+1}$
    – RRL
    Nov 19 at 18:33
















  • 1




    What are you asking?
    – Will M.
    Nov 19 at 18:31






  • 1




    The sum is less than $n frac{n +n}{n^3+1}$
    – RRL
    Nov 19 at 18:33










1




1




What are you asking?
– Will M.
Nov 19 at 18:31




What are you asking?
– Will M.
Nov 19 at 18:31




1




1




The sum is less than $n frac{n +n}{n^3+1}$
– RRL
Nov 19 at 18:33






The sum is less than $n frac{n +n}{n^3+1}$
– RRL
Nov 19 at 18:33












2 Answers
2






active

oldest

votes

















up vote
5
down vote



accepted










This should work:
$$sum_{k=1}^nfrac{n+k}{n^3+k}leqsum_{k=1}^nfrac{n+k}{n^3}leqsum_{k=1}^nfrac{n+n}{n^3}=frac{2n^2}{n^3}=frac{2}{n}to0$$



Also, every term is $geq 0$ so $0$ is also a lower bound.






share|cite|improve this answer




























    up vote
    1
    down vote













    HINT:



    Note that $n+1le n+kle 2n$ and $n^3+1le n^3 +kle n^3+n$.






    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: 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%2f3005314%2fhow-to-evaluate-lim-n-to-infty-sum-k-1n-fracnkn3k%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      5
      down vote



      accepted










      This should work:
      $$sum_{k=1}^nfrac{n+k}{n^3+k}leqsum_{k=1}^nfrac{n+k}{n^3}leqsum_{k=1}^nfrac{n+n}{n^3}=frac{2n^2}{n^3}=frac{2}{n}to0$$



      Also, every term is $geq 0$ so $0$ is also a lower bound.






      share|cite|improve this answer

























        up vote
        5
        down vote



        accepted










        This should work:
        $$sum_{k=1}^nfrac{n+k}{n^3+k}leqsum_{k=1}^nfrac{n+k}{n^3}leqsum_{k=1}^nfrac{n+n}{n^3}=frac{2n^2}{n^3}=frac{2}{n}to0$$



        Also, every term is $geq 0$ so $0$ is also a lower bound.






        share|cite|improve this answer























          up vote
          5
          down vote



          accepted







          up vote
          5
          down vote



          accepted






          This should work:
          $$sum_{k=1}^nfrac{n+k}{n^3+k}leqsum_{k=1}^nfrac{n+k}{n^3}leqsum_{k=1}^nfrac{n+n}{n^3}=frac{2n^2}{n^3}=frac{2}{n}to0$$



          Also, every term is $geq 0$ so $0$ is also a lower bound.






          share|cite|improve this answer












          This should work:
          $$sum_{k=1}^nfrac{n+k}{n^3+k}leqsum_{k=1}^nfrac{n+k}{n^3}leqsum_{k=1}^nfrac{n+n}{n^3}=frac{2n^2}{n^3}=frac{2}{n}to0$$



          Also, every term is $geq 0$ so $0$ is also a lower bound.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 19 at 18:33









          Marco

          1909




          1909






















              up vote
              1
              down vote













              HINT:



              Note that $n+1le n+kle 2n$ and $n^3+1le n^3 +kle n^3+n$.






              share|cite|improve this answer

























                up vote
                1
                down vote













                HINT:



                Note that $n+1le n+kle 2n$ and $n^3+1le n^3 +kle n^3+n$.






                share|cite|improve this answer























                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  HINT:



                  Note that $n+1le n+kle 2n$ and $n^3+1le n^3 +kle n^3+n$.






                  share|cite|improve this answer












                  HINT:



                  Note that $n+1le n+kle 2n$ and $n^3+1le n^3 +kle n^3+n$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 19 at 18:35









                  Mark Viola

                  129k1273170




                  129k1273170






























                       

                      draft saved


                      draft discarded



















































                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005314%2fhow-to-evaluate-lim-n-to-infty-sum-k-1n-fracnkn3k%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

                      Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

                      Image
                      28 6 $begingroup$ Per the Font of Magic feature, sorcerer can use Flexible Casting to create 5th-level spell slots at level 7, even though they are not typically available until level 9. You can transform unexpended sorcery points into one spell slot as a bonus action on your turn. The Creating Spell Slots table shows the cost of creating a spell slot of [5th level is 7] If such a sorcerer levels up while still having this 5th-level spell slot, can they choose a 5th-level spell as the spell they gain upon levelling up? The Spellcasting feature states: Additionally, when you gain a level in this class, you can choose one of the sorcerer spells you know and replace it with another spell from the sorcerer spell list, which also must be of a level for which you have spell slots.
                      Read more

                      Does disintegrating a polymorphed enemy still kill it after the 2018 errata?

                      Image
                      up vote 13 down vote favorite 1 After the 2018 errata, the disintegrate spell description now reads: A creature targeted by this spell must make a Dexterity saving throw. On a failed save, the target takes 10d6 + 40 force damage. The target is disintegrated if this damage leaves it with 0 hit points. If you were to polymorph an enemy into a rat and then disintegrate it, would the enemy be disintegrated or would it just return to its original form? I know that for Druids, it’s not an instant kill anymore, but is this the case for polymorph as well? dnd-5e spells polymorph errata share | improve this question edited 18 hours ago
                      Read more

                      A Topological Invariant for $pi_3(U(n))$

                      Image
                      3 3 $begingroup$ Recently, I saw a construction of topological invariant for $pi_3(U(n))$ with $ngeq 2$ : $$ N=frac{1}{24pi^2}int_{S^3} d^3x epsilon^{ijk} Tr[(U^{-1}partial_{x_i}U)(U^{-1}partial_{x_j}U)(U^{-1}partial_{x_k}U)] , $$ where $Uin U(n)$ depends on $boldsymbol{x}=(x_1,x_2,x_3)in S^3$ , $epsilon^{ijk}$ is the Levi-Civita symbol, $i,j,k=1,2,3$ , and the duplicated indexes are summed over. It is claimed that $N$ is an integer, but why? Update 02/02/2019 I think I got an argument for $n=2$ . In this case, $U=e^{i varphi} q$ with $qin SU(2)$ . Due to the trace and the Levi-Civita symbol in $N$ , $varphi$ does not contribute to $N$ . As $Tr[q^{dagger}partial_i q]=0$ and $(q^{dagger}partial_i q)^{dagger}=-q^{dagger}partial_i q$ , $q^{dagger}partial_i q$ in geneeral has the form $q^{dagger}partia
                      Read more