Property of summation












0












$begingroup$


Very short question. Could you please explain me why



$$sum_{i=0}^{n-1} a = na$$
with $a$ a constant?
I know that



$$sum_{i=1}^{n} a = na$$



but in my case the sum starts from zero and finishes for $(n-1)$.



Thanks.






summation







share|cite|improve this question











$endgroup$








  • 7




    $begingroup$
    Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
    $endgroup$
    – Yves Daoust
    yesterday












  • $begingroup$
    Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
    $endgroup$
    – JMoravitz
    yesterday










  • $begingroup$
    Thanks JMoravitz, your rationale was what I needed to convince myself.
    $endgroup$
    – Kolmogorovwannabe
    yesterday
















0












$begingroup$


Very short question. Could you please explain me why



$$sum_{i=0}^{n-1} a = na$$
with $a$ a constant?
I know that



$$sum_{i=1}^{n} a = na$$



but in my case the sum starts from zero and finishes for $(n-1)$.



Thanks.






summation







share|cite|improve this question











$endgroup$








  • 7




    $begingroup$
    Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
    $endgroup$
    – Yves Daoust
    yesterday












  • $begingroup$
    Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
    $endgroup$
    – JMoravitz
    yesterday










  • $begingroup$
    Thanks JMoravitz, your rationale was what I needed to convince myself.
    $endgroup$
    – Kolmogorovwannabe
    yesterday














0












0








0





$begingroup$


Very short question. Could you please explain me why



$$sum_{i=0}^{n-1} a = na$$
with $a$ a constant?
I know that



$$sum_{i=1}^{n} a = na$$



but in my case the sum starts from zero and finishes for $(n-1)$.



Thanks.






summation







share|cite|improve this question











$endgroup$




Very short question. Could you please explain me why



$$sum_{i=0}^{n-1} a = na$$
with $a$ a constant?
I know that



$$sum_{i=1}^{n} a = na$$



but in my case the sum starts from zero and finishes for $(n-1)$.



Thanks.






summation




summation






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited yesterday









MarianD

1,3061616




1,3061616










asked yesterday









KolmogorovwannabeKolmogorovwannabe

257




257








  • 7




    $begingroup$
    Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
    $endgroup$
    – Yves Daoust
    yesterday












  • $begingroup$
    Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
    $endgroup$
    – JMoravitz
    yesterday










  • $begingroup$
    Thanks JMoravitz, your rationale was what I needed to convince myself.
    $endgroup$
    – Kolmogorovwannabe
    yesterday














  • 7




    $begingroup$
    Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
    $endgroup$
    – Yves Daoust
    yesterday












  • $begingroup$
    Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
    $endgroup$
    – JMoravitz
    yesterday










  • $begingroup$
    Thanks JMoravitz, your rationale was what I needed to convince myself.
    $endgroup$
    – Kolmogorovwannabe
    yesterday








7




7




$begingroup$
Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
$endgroup$
– Yves Daoust
yesterday






$begingroup$
Sorry, I cannot figure out what is difficult to understand here. Can you enlighten me ?
$endgroup$
– Yves Daoust
yesterday














$begingroup$
Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
$endgroup$
– JMoravitz
yesterday




$begingroup$
Recognize that ${0,1,2,3,4,dots,n-1}$ has $n$ elements in it. If this is not immediately obvious why, then recognize that it has the $n-1$ positive elements ${1,2,3,dots,n-1}$ and also the one additional zero element ${0}$. It follows that your summation is iterated a total of $n$ times (the one time when the index is zero, and then the following $n-1$ times while the index is positive for a total of $1+(n-1)=n$ times).
$endgroup$
– JMoravitz
yesterday












$begingroup$
Thanks JMoravitz, your rationale was what I needed to convince myself.
$endgroup$
– Kolmogorovwannabe
yesterday




$begingroup$
Thanks JMoravitz, your rationale was what I needed to convince myself.
$endgroup$
– Kolmogorovwannabe
yesterday










6 Answers
6






active

oldest

votes


















8












$begingroup$

Since you are allready convinced that $sum_{i=1}^{n}a=na$ this might help:



$sum_{i=0}^{n-1}a=a+sum_{i=1}^{n-1}a=a+sum_{i=1}^{n}a-a=sum_{i=1}^{n}a$






share|cite|improve this answer









$endgroup$





















    22












    $begingroup$

    In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$



    - there are exactly $n$ summands.



    enter image description here






    share|cite|improve this answer









    $endgroup$





















      3












      $begingroup$

      Since $a$ is not $i$-depending one can write: $$sum_{i=0}^{n-1}{a}=asum_{i=0}^{n-1}{1}$$
      And $sum_{i=0}^{n-1}{1}=1+1+cdots+1$ $n$ times which obviously is $n$.






      share|cite|improve this answer











      $endgroup$





















        2












        $begingroup$

        What is the definition of $sum_{i=0}^{n-1} x_i$? It is exactly $x_0+x_1+...x_{n-1}$. If $x_0=x_1=...x_{n-1}=a$ then it means you just sum $a$ $n$ times. And that gives $na$.






        share|cite|improve this answer











        $endgroup$





















          1












          $begingroup$

          You are summing $n$ terms, all equal to $a$. So
          $$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$






          share|cite|improve this answer









          $endgroup$





















            0












            $begingroup$

            Hint:



            $a$ times the number of terms.






            share|cite|improve this answer









            $endgroup$













              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',
              autoActivateHeartbeat: false,
              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%2f3149368%2fproperty-of-summation%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              6 Answers
              6






              active

              oldest

              votes








              6 Answers
              6






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              8












              $begingroup$

              Since you are allready convinced that $sum_{i=1}^{n}a=na$ this might help:



              $sum_{i=0}^{n-1}a=a+sum_{i=1}^{n-1}a=a+sum_{i=1}^{n}a-a=sum_{i=1}^{n}a$






              share|cite|improve this answer









              $endgroup$


















                8












                $begingroup$

                Since you are allready convinced that $sum_{i=1}^{n}a=na$ this might help:



                $sum_{i=0}^{n-1}a=a+sum_{i=1}^{n-1}a=a+sum_{i=1}^{n}a-a=sum_{i=1}^{n}a$






                share|cite|improve this answer









                $endgroup$
















                  8












                  8








                  8





                  $begingroup$

                  Since you are allready convinced that $sum_{i=1}^{n}a=na$ this might help:



                  $sum_{i=0}^{n-1}a=a+sum_{i=1}^{n-1}a=a+sum_{i=1}^{n}a-a=sum_{i=1}^{n}a$






                  share|cite|improve this answer









                  $endgroup$



                  Since you are allready convinced that $sum_{i=1}^{n}a=na$ this might help:



                  $sum_{i=0}^{n-1}a=a+sum_{i=1}^{n-1}a=a+sum_{i=1}^{n}a-a=sum_{i=1}^{n}a$







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered yesterday









                  drhabdrhab

                  103k545136




                  103k545136























                      22












                      $begingroup$

                      In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$



                      - there are exactly $n$ summands.



                      enter image description here






                      share|cite|improve this answer









                      $endgroup$


















                        22












                        $begingroup$

                        In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$



                        - there are exactly $n$ summands.



                        enter image description here






                        share|cite|improve this answer









                        $endgroup$
















                          22












                          22








                          22





                          $begingroup$

                          In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$



                          - there are exactly $n$ summands.



                          enter image description here






                          share|cite|improve this answer









                          $endgroup$



                          In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$



                          - there are exactly $n$ summands.



                          enter image description here







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered yesterday









                          MarianDMarianD

                          1,3061616




                          1,3061616























                              3












                              $begingroup$

                              Since $a$ is not $i$-depending one can write: $$sum_{i=0}^{n-1}{a}=asum_{i=0}^{n-1}{1}$$
                              And $sum_{i=0}^{n-1}{1}=1+1+cdots+1$ $n$ times which obviously is $n$.






                              share|cite|improve this answer











                              $endgroup$


















                                3












                                $begingroup$

                                Since $a$ is not $i$-depending one can write: $$sum_{i=0}^{n-1}{a}=asum_{i=0}^{n-1}{1}$$
                                And $sum_{i=0}^{n-1}{1}=1+1+cdots+1$ $n$ times which obviously is $n$.






                                share|cite|improve this answer











                                $endgroup$
















                                  3












                                  3








                                  3





                                  $begingroup$

                                  Since $a$ is not $i$-depending one can write: $$sum_{i=0}^{n-1}{a}=asum_{i=0}^{n-1}{1}$$
                                  And $sum_{i=0}^{n-1}{1}=1+1+cdots+1$ $n$ times which obviously is $n$.






                                  share|cite|improve this answer











                                  $endgroup$



                                  Since $a$ is not $i$-depending one can write: $$sum_{i=0}^{n-1}{a}=asum_{i=0}^{n-1}{1}$$
                                  And $sum_{i=0}^{n-1}{1}=1+1+cdots+1$ $n$ times which obviously is $n$.







                                  share|cite|improve this answer














                                  share|cite|improve this answer



                                  share|cite|improve this answer








                                  edited yesterday









                                  MarianD

                                  1,3061616




                                  1,3061616










                                  answered yesterday









                                  HAMIDINE SOUMAREHAMIDINE SOUMARE

                                  1,06429




                                  1,06429























                                      2












                                      $begingroup$

                                      What is the definition of $sum_{i=0}^{n-1} x_i$? It is exactly $x_0+x_1+...x_{n-1}$. If $x_0=x_1=...x_{n-1}=a$ then it means you just sum $a$ $n$ times. And that gives $na$.






                                      share|cite|improve this answer











                                      $endgroup$


















                                        2












                                        $begingroup$

                                        What is the definition of $sum_{i=0}^{n-1} x_i$? It is exactly $x_0+x_1+...x_{n-1}$. If $x_0=x_1=...x_{n-1}=a$ then it means you just sum $a$ $n$ times. And that gives $na$.






                                        share|cite|improve this answer











                                        $endgroup$
















                                          2












                                          2








                                          2





                                          $begingroup$

                                          What is the definition of $sum_{i=0}^{n-1} x_i$? It is exactly $x_0+x_1+...x_{n-1}$. If $x_0=x_1=...x_{n-1}=a$ then it means you just sum $a$ $n$ times. And that gives $na$.






                                          share|cite|improve this answer











                                          $endgroup$



                                          What is the definition of $sum_{i=0}^{n-1} x_i$? It is exactly $x_0+x_1+...x_{n-1}$. If $x_0=x_1=...x_{n-1}=a$ then it means you just sum $a$ $n$ times. And that gives $na$.







                                          share|cite|improve this answer














                                          share|cite|improve this answer



                                          share|cite|improve this answer








                                          edited yesterday

























                                          answered yesterday









                                          MarkMark

                                          10.1k622




                                          10.1k622























                                              1












                                              $begingroup$

                                              You are summing $n$ terms, all equal to $a$. So
                                              $$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$






                                              share|cite|improve this answer









                                              $endgroup$


















                                                1












                                                $begingroup$

                                                You are summing $n$ terms, all equal to $a$. So
                                                $$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$






                                                share|cite|improve this answer









                                                $endgroup$
















                                                  1












                                                  1








                                                  1





                                                  $begingroup$

                                                  You are summing $n$ terms, all equal to $a$. So
                                                  $$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$






                                                  share|cite|improve this answer









                                                  $endgroup$



                                                  You are summing $n$ terms, all equal to $a$. So
                                                  $$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$







                                                  share|cite|improve this answer












                                                  share|cite|improve this answer



                                                  share|cite|improve this answer










                                                  answered yesterday









                                                  HugoHugo

                                                  8206




                                                  8206























                                                      0












                                                      $begingroup$

                                                      Hint:



                                                      $a$ times the number of terms.






                                                      share|cite|improve this answer









                                                      $endgroup$


















                                                        0












                                                        $begingroup$

                                                        Hint:



                                                        $a$ times the number of terms.






                                                        share|cite|improve this answer









                                                        $endgroup$
















                                                          0












                                                          0








                                                          0





                                                          $begingroup$

                                                          Hint:



                                                          $a$ times the number of terms.






                                                          share|cite|improve this answer









                                                          $endgroup$



                                                          Hint:



                                                          $a$ times the number of terms.







                                                          share|cite|improve this answer












                                                          share|cite|improve this answer



                                                          share|cite|improve this answer










                                                          answered yesterday









                                                          Yves DaoustYves Daoust

                                                          130k676229




                                                          130k676229






























                                                              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.




                                                              draft saved


                                                              draft discarded














                                                              StackExchange.ready(
                                                              function () {
                                                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149368%2fproperty-of-summation%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

                                                              "Incorrect syntax near the keyword 'ON'. (on update cascade, on delete cascade,)

                                                              Image
                                                              .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 2 total noob sorry any help greatly appreciated. I keep getting this "Incorrect syntax near the keyword 'ON'." heres my codes code one CREATE TABLE supplier ( supplierID INT PRIMARY KEY, ISBN INT FOREIGN KEY REFERENCES book(ISBN), price DECIMAL (5,2), ON UPDATE CASCADE, ON DELETE CASCADE, ); code two CREATE TABLE orders ( orderID INT PRIMARY KEY, customerID INT FOREIGN KEY REFERENCES customer(customerID), ISBN INT FOREIGN KEY REFERENCES book(ISBN), orderDate date, ON UPDATE CASCADE, ON DELETE CASCADE, ); Ive run out of stuff to try other than dumbing it down to uselessness.
                                                              Read more

                                                              Alcedinidae

                                                              Image
                                                              Alcedinidae Martin-pêcheur à dos bleu ( Alcedo azurea ) Classification (COI) Règne Animalia Embranchement Chordata Sous-embr. Vertebrata Classe Aves Ordre Coraciiformes Famille Alcedinidae Rafinesque, 1815 Les Alcédinidés ou Alcedinidae forment une famille d'oiseaux plus connus sous les noms de martins-pêcheurs et martins-chasseurs. Sommaire 1 Description 2 Répartition et habitat 3 Systématique 3.1 Liste alphabétique des genres 3.2 Liste des espèces 4 Chez les Anciens : l'alcyon 4.1 Étymologie (Littré) 4.2 Oiseau « fabuleux » ? 5 Notes 6 Articles connexes 7 Liens externes 7.1 Bibliographie Description | Ce sont des oiseaux compacts de taille petite à moyenne (10 à 46 cm), au bec droit et long, en forme de poignard. Leurs pattes sont courtes, et ils portent un plumage aux couleurs vives. Répartition et habitat | Cosmopolites, ils fréquentent surtout
                                                              Read more

                                                              RAC Tourist Trophy

                                                              Image
                                                              Pour les articles homonymes, voir Tourist Trophy. Le RAC Tourist Trophy est une course automobile organisée par le Royal Automobile Club d'Angleterre. Créée en 1905, cette course a fait partie des épreuves comptant pour le championnat du monde des voitures de sport entre 1953 et 1955, en 1958 et 1959, et entre 1962 et 1965. Après une interruption de 17 ans (l'épreuve s'arrête après 1988), le RAC Tourist Trophy reprend en 2005 sous l'égide de la FIA GT. Palmarès | John Napier sur Arrol-Johnston, vainqueur du premier RAC Tourist Trophy, en 1905. L'honorable C.S. Rolls, vainqueur du RAC Tourist Trophy 1906. Ernest Curtis, sur Rover 20 hp, vainqueur du RAC Tourist Trophy 1907. William Watson, vainqueur du RAC Tourist Trophy 1908. Kenelm Lee Guinness, vainqueur du RAC Tourist Trophy 1914 sur Sunbeam. Départ du RAC Tourist Trophy 1928. Louis Gérard, vainqueur du RAC Tourist Trophy 1938 sur Delage. Année Circuit Vainqueur
                                                              Read more