Property of summation
$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
$endgroup$
add a comment |
$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
$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
add a comment |
$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
$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
edited yesterday
MarianD
1,2791616
1,2791616
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
add a comment |
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
add a comment |
6 Answers
6
active
oldest
votes
$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$
$endgroup$
add a comment |
$begingroup$
In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$
- there are exactly $n$ summands.
$endgroup$
add a comment |
$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$.
$endgroup$
add a comment |
$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$.
$endgroup$
add a comment |
$begingroup$
You are summing $n$ terms, all equal to $a$. So
$$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$
$endgroup$
add a comment |
$begingroup$
Hint:
$a$ times the number of terms.
$endgroup$
add a comment |
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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$
$endgroup$
add a comment |
$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$
$endgroup$
add a comment |
$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$
$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$
answered yesterday
drhabdrhab
103k545136
103k545136
add a comment |
add a comment |
$begingroup$
In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$
- there are exactly $n$ summands.
$endgroup$
add a comment |
$begingroup$
In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$
- there are exactly $n$ summands.
$endgroup$
add a comment |
$begingroup$
In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$
- there are exactly $n$ summands.
$endgroup$
In both cases - $$sum_{i=0}^{n-1}aquad text { and }quadsum_{i=1}^{n}a$$
- there are exactly $n$ summands.
answered yesterday
MarianDMarianD
1,2791616
1,2791616
add a comment |
add a comment |
$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$.
$endgroup$
add a comment |
$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$.
$endgroup$
add a comment |
$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$.
$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$.
edited yesterday
MarianD
1,2791616
1,2791616
answered yesterday
HAMIDINE SOUMAREHAMIDINE SOUMARE
1,05429
1,05429
add a comment |
add a comment |
$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$.
$endgroup$
add a comment |
$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$.
$endgroup$
add a comment |
$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$.
$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$.
edited yesterday
answered yesterday
MarkMark
10.1k622
10.1k622
add a comment |
add a comment |
$begingroup$
You are summing $n$ terms, all equal to $a$. So
$$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$
$endgroup$
add a comment |
$begingroup$
You are summing $n$ terms, all equal to $a$. So
$$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$
$endgroup$
add a comment |
$begingroup$
You are summing $n$ terms, all equal to $a$. So
$$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$
$endgroup$
You are summing $n$ terms, all equal to $a$. So
$$sum_{i=0}^{n-1} a = a+ a+dotsb + a = na.$$
answered yesterday
HugoHugo
8206
8206
add a comment |
add a comment |
$begingroup$
Hint:
$a$ times the number of terms.
$endgroup$
add a comment |
$begingroup$
Hint:
$a$ times the number of terms.
$endgroup$
add a comment |
$begingroup$
Hint:
$a$ times the number of terms.
$endgroup$
Hint:
$a$ times the number of terms.
answered yesterday
Yves DaoustYves Daoust
130k676229
130k676229
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
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