Difficulty Understanding Tom Apostol's Method of Exhaustion Proof

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











up vote
3
down vote

favorite












In Tom Apostol's Calculus Vol 1 book, Apostol presents the following equation:
$$3[1^2+2^2+...+(n-1)^2]+ 3[1 + 2+ . . . + (n - 1)] + (n - 1)=n^3-1^3$$



He then states that the second sum on the left, which is $[1 + 2+ . . . + (n - 1)]$, is a sum of terms in an arithmetic progression, so that part will simplify to $fracn(n-1)2$, thus the final equation becomes this:
$$1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$$
What I cannot understand is how Apostol simplified $[1 + 2+ . . . + (n - 1)]$ to $fracn(n-1)2$. As far as I understand, a sum of terms of an arithmetic progression has the following format: $fracn(a+b)2$, with $a$ and $b$ representing the initial and $b$th term of the sequence, respectively. Where does he get $n-1$? Furthermore, how does he simplify the final formula to $1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$?










share|cite|improve this question



























    up vote
    3
    down vote

    favorite












    In Tom Apostol's Calculus Vol 1 book, Apostol presents the following equation:
    $$3[1^2+2^2+...+(n-1)^2]+ 3[1 + 2+ . . . + (n - 1)] + (n - 1)=n^3-1^3$$



    He then states that the second sum on the left, which is $[1 + 2+ . . . + (n - 1)]$, is a sum of terms in an arithmetic progression, so that part will simplify to $fracn(n-1)2$, thus the final equation becomes this:
    $$1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$$
    What I cannot understand is how Apostol simplified $[1 + 2+ . . . + (n - 1)]$ to $fracn(n-1)2$. As far as I understand, a sum of terms of an arithmetic progression has the following format: $fracn(a+b)2$, with $a$ and $b$ representing the initial and $b$th term of the sequence, respectively. Where does he get $n-1$? Furthermore, how does he simplify the final formula to $1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$?










    share|cite|improve this question

























      up vote
      3
      down vote

      favorite









      up vote
      3
      down vote

      favorite











      In Tom Apostol's Calculus Vol 1 book, Apostol presents the following equation:
      $$3[1^2+2^2+...+(n-1)^2]+ 3[1 + 2+ . . . + (n - 1)] + (n - 1)=n^3-1^3$$



      He then states that the second sum on the left, which is $[1 + 2+ . . . + (n - 1)]$, is a sum of terms in an arithmetic progression, so that part will simplify to $fracn(n-1)2$, thus the final equation becomes this:
      $$1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$$
      What I cannot understand is how Apostol simplified $[1 + 2+ . . . + (n - 1)]$ to $fracn(n-1)2$. As far as I understand, a sum of terms of an arithmetic progression has the following format: $fracn(a+b)2$, with $a$ and $b$ representing the initial and $b$th term of the sequence, respectively. Where does he get $n-1$? Furthermore, how does he simplify the final formula to $1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$?










      share|cite|improve this question















      In Tom Apostol's Calculus Vol 1 book, Apostol presents the following equation:
      $$3[1^2+2^2+...+(n-1)^2]+ 3[1 + 2+ . . . + (n - 1)] + (n - 1)=n^3-1^3$$



      He then states that the second sum on the left, which is $[1 + 2+ . . . + (n - 1)]$, is a sum of terms in an arithmetic progression, so that part will simplify to $fracn(n-1)2$, thus the final equation becomes this:
      $$1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$$
      What I cannot understand is how Apostol simplified $[1 + 2+ . . . + (n - 1)]$ to $fracn(n-1)2$. As far as I understand, a sum of terms of an arithmetic progression has the following format: $fracn(a+b)2$, with $a$ and $b$ representing the initial and $b$th term of the sequence, respectively. Where does he get $n-1$? Furthermore, how does he simplify the final formula to $1^2+2^2+...+(n-1)^2=fracn^33-fracn^22+fracn6$?







      calculus sequences-and-series






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Sep 1 at 0:24









      Ethan Bolker

      36.4k54299




      36.4k54299










      asked Sep 1 at 0:20









      user22333

      161




      161




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          0
          down vote













          Note that you have $n-1$ terms, not $n$. Thus the sum will be of the form $frac(n-1)(a+b)2$. Now it makes sense.



          After substituting this in the equation you get:



          $$3sum_k=1^n-1 k^2 = n^3 - 1 - (n-1) - 3fracn(n-1)2 = n^3 - n - frac3n^22 + frac3n2 = n^3 - frac3n^22 + fracn2$$



          $$sum_k=1^n-1 k^2 = fracn^33 - fracn^22 + frac n6$$






          share|cite|improve this answer






















          • Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
            – user22333
            Sep 1 at 0:32










          • @user22333 I just updated my answer
            – Stefan4024
            Sep 1 at 1:01










          • @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
            – user22333
            Sep 1 at 1:10










          • @user22333 I guess I couldn't make it more simple than this.
            – Stefan4024
            Sep 1 at 1:28










          • @Stefan4042 I understand it now after your edit. Thank you.
            – user22333
            Sep 1 at 1:36










          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%2f2901243%2fdifficulty-understanding-tom-apostols-method-of-exhaustion-proof%23new-answer', 'question_page');

          );

          Post as a guest






























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          0
          down vote













          Note that you have $n-1$ terms, not $n$. Thus the sum will be of the form $frac(n-1)(a+b)2$. Now it makes sense.



          After substituting this in the equation you get:



          $$3sum_k=1^n-1 k^2 = n^3 - 1 - (n-1) - 3fracn(n-1)2 = n^3 - n - frac3n^22 + frac3n2 = n^3 - frac3n^22 + fracn2$$



          $$sum_k=1^n-1 k^2 = fracn^33 - fracn^22 + frac n6$$






          share|cite|improve this answer






















          • Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
            – user22333
            Sep 1 at 0:32










          • @user22333 I just updated my answer
            – Stefan4024
            Sep 1 at 1:01










          • @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
            – user22333
            Sep 1 at 1:10










          • @user22333 I guess I couldn't make it more simple than this.
            – Stefan4024
            Sep 1 at 1:28










          • @Stefan4042 I understand it now after your edit. Thank you.
            – user22333
            Sep 1 at 1:36














          up vote
          0
          down vote













          Note that you have $n-1$ terms, not $n$. Thus the sum will be of the form $frac(n-1)(a+b)2$. Now it makes sense.



          After substituting this in the equation you get:



          $$3sum_k=1^n-1 k^2 = n^3 - 1 - (n-1) - 3fracn(n-1)2 = n^3 - n - frac3n^22 + frac3n2 = n^3 - frac3n^22 + fracn2$$



          $$sum_k=1^n-1 k^2 = fracn^33 - fracn^22 + frac n6$$






          share|cite|improve this answer






















          • Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
            – user22333
            Sep 1 at 0:32










          • @user22333 I just updated my answer
            – Stefan4024
            Sep 1 at 1:01










          • @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
            – user22333
            Sep 1 at 1:10










          • @user22333 I guess I couldn't make it more simple than this.
            – Stefan4024
            Sep 1 at 1:28










          • @Stefan4042 I understand it now after your edit. Thank you.
            – user22333
            Sep 1 at 1:36












          up vote
          0
          down vote










          up vote
          0
          down vote









          Note that you have $n-1$ terms, not $n$. Thus the sum will be of the form $frac(n-1)(a+b)2$. Now it makes sense.



          After substituting this in the equation you get:



          $$3sum_k=1^n-1 k^2 = n^3 - 1 - (n-1) - 3fracn(n-1)2 = n^3 - n - frac3n^22 + frac3n2 = n^3 - frac3n^22 + fracn2$$



          $$sum_k=1^n-1 k^2 = fracn^33 - fracn^22 + frac n6$$






          share|cite|improve this answer














          Note that you have $n-1$ terms, not $n$. Thus the sum will be of the form $frac(n-1)(a+b)2$. Now it makes sense.



          After substituting this in the equation you get:



          $$3sum_k=1^n-1 k^2 = n^3 - 1 - (n-1) - 3fracn(n-1)2 = n^3 - n - frac3n^22 + frac3n2 = n^3 - frac3n^22 + fracn2$$



          $$sum_k=1^n-1 k^2 = fracn^33 - fracn^22 + frac n6$$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Sep 1 at 1:28

























          answered Sep 1 at 0:24









          Stefan4024

          29.8k53377




          29.8k53377











          • Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
            – user22333
            Sep 1 at 0:32










          • @user22333 I just updated my answer
            – Stefan4024
            Sep 1 at 1:01










          • @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
            – user22333
            Sep 1 at 1:10










          • @user22333 I guess I couldn't make it more simple than this.
            – Stefan4024
            Sep 1 at 1:28










          • @Stefan4042 I understand it now after your edit. Thank you.
            – user22333
            Sep 1 at 1:36
















          • Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
            – user22333
            Sep 1 at 0:32










          • @user22333 I just updated my answer
            – Stefan4024
            Sep 1 at 1:01










          • @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
            – user22333
            Sep 1 at 1:10










          • @user22333 I guess I couldn't make it more simple than this.
            – Stefan4024
            Sep 1 at 1:28










          • @Stefan4042 I understand it now after your edit. Thank you.
            – user22333
            Sep 1 at 1:36















          Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
          – user22333
          Sep 1 at 0:32




          Thank you, but you how does he get the final equation? He is actually trying to do a proof for the sum of squares
          – user22333
          Sep 1 at 0:32












          @user22333 I just updated my answer
          – Stefan4024
          Sep 1 at 1:01




          @user22333 I just updated my answer
          – Stefan4024
          Sep 1 at 1:01












          @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
          – user22333
          Sep 1 at 1:10




          @Stefan4042 Could you elaborate more on what exactly combines and what cancels out etc? Sorry, I'm quite new to this.
          – user22333
          Sep 1 at 1:10












          @user22333 I guess I couldn't make it more simple than this.
          – Stefan4024
          Sep 1 at 1:28




          @user22333 I guess I couldn't make it more simple than this.
          – Stefan4024
          Sep 1 at 1:28












          @Stefan4042 I understand it now after your edit. Thank you.
          – user22333
          Sep 1 at 1:36




          @Stefan4042 I understand it now after your edit. Thank you.
          – user22333
          Sep 1 at 1:36

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2901243%2fdifficulty-understanding-tom-apostols-method-of-exhaustion-proof%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          tkz-euclide: tkzDrawCircle[R] not working

          How to combine Bézier curves to a surface?

          1st Magritte Awards