Don't Understand Double Summation with Gauss's formula
up vote
1
down vote
favorite
So as we know, if we have a summation from $1$ to $n$, the simple formula is
$$sum_{i=1}^n i=frac{n(n+1)}2.$$
But if we have two summations, one from $i=1$ to $n$ and another one $j>i$ to $n$, the formula we get is
$$sum_{i=1}^nsum_{j>i}^nj=frac{n(n-1)}2.$$
I'm not understanding this, how does it go from $n+1$ to $n-1$, especially since it's a double summation?
summation
edited Nov 19 at 3:10
Tianlalu
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
add a comment |
up vote
1
down vote
favorite
So as we know, if we have a summation from $1$ to $n$, the simple formula is
$$sum_{i=1}^n i=frac{n(n+1)}2.$$
But if we have two summations, one from $i=1$ to $n$ and another one $j>i$ to $n$, the formula we get is
$$sum_{i=1}^nsum_{j>i}^nj=frac{n(n-1)}2.$$
I'm not understanding this, how does it go from $n+1$ to $n-1$, especially since it's a double summation?
summation
edited Nov 19 at 3:10
Tianlalu
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
So as we know, if we have a summation from $1$ to $n$, the simple formula is
$$sum_{i=1}^n i=frac{n(n+1)}2.$$
But if we have two summations, one from $i=1$ to $n$ and another one $j>i$ to $n$, the formula we get is
$$sum_{i=1}^nsum_{j>i}^nj=frac{n(n-1)}2.$$
I'm not understanding this, how does it go from $n+1$ to $n-1$, especially since it's a double summation?
summation
edited Nov 19 at 3:10
Tianlalu
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
So as we know, if we have a summation from $1$ to $n$, the simple formula is
$$sum_{i=1}^n i=frac{n(n+1)}2.$$
But if we have two summations, one from $i=1$ to $n$ and another one $j>i$ to $n$, the formula we get is
$$sum_{i=1}^nsum_{j>i}^nj=frac{n(n-1)}2.$$
I'm not understanding this, how does it go from $n+1$ to $n-1$, especially since it's a double summation?
summation
summation
edited Nov 19 at 3:10
Tianlalu
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
edited Nov 19 at 3:10
Tianlalu
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
edited Nov 19 at 3:10
Tianlalu
2,9901936
edited Nov 19 at 3:10
Tianlalu
2,9901936
edited Nov 19 at 3:10
Tianlalu
2,9901936
2,9901936
asked Nov 19 at 3:05
reVolutionary
82
asked Nov 19 at 3:05
reVolutionary
82
asked Nov 19 at 3:05
reVolutionary
82
82
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11
add a comment |
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11
add a comment |
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
I think you might be confusing two different things.
Fact 1: Define $S_n := sum_{k=1}^n k$. Then $S_n = n(n+1)/2$ for every nonnegative integer $n$.
(You can see this by induction. Certainly the formula is correct for $n = 0$. With $S_{n-1} = (n-1)n/2$, we have $S_{n} = n + S_{n-1} = (n+1)n/2$, as required.)
Then there is the following fact
Fact 2: Define $T_n = sum_{1 leq i < j leq n} 1$. Then $T_n = n(n-1)/2$.
This is just the number of tuples $(k, l)$ with $1 leq k leq n$ and $1 leq l leq n$ there are with $k < l$. That's just $binom{n}{2}$, or if you like it's also $(n^2 - n)/2 = n(n-1)/2$.
answered Nov 19 at 3:18
Drew Brady
614315
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
I think you might be confusing two different things.
Fact 1: Define $S_n := sum_{k=1}^n k$. Then $S_n = n(n+1)/2$ for every nonnegative integer $n$.
(You can see this by induction. Certainly the formula is correct for $n = 0$. With $S_{n-1} = (n-1)n/2$, we have $S_{n} = n + S_{n-1} = (n+1)n/2$, as required.)
Then there is the following fact
Fact 2: Define $T_n = sum_{1 leq i < j leq n} 1$. Then $T_n = n(n-1)/2$.
This is just the number of tuples $(k, l)$ with $1 leq k leq n$ and $1 leq l leq n$ there are with $k < l$. That's just $binom{n}{2}$, or if you like it's also $(n^2 - n)/2 = n(n-1)/2$.
answered Nov 19 at 3:18
Drew Brady
614315
add a comment |
up vote
0
down vote
accepted
I think you might be confusing two different things.
Fact 1: Define $S_n := sum_{k=1}^n k$. Then $S_n = n(n+1)/2$ for every nonnegative integer $n$.
(You can see this by induction. Certainly the formula is correct for $n = 0$. With $S_{n-1} = (n-1)n/2$, we have $S_{n} = n + S_{n-1} = (n+1)n/2$, as required.)
Then there is the following fact
Fact 2: Define $T_n = sum_{1 leq i < j leq n} 1$. Then $T_n = n(n-1)/2$.
This is just the number of tuples $(k, l)$ with $1 leq k leq n$ and $1 leq l leq n$ there are with $k < l$. That's just $binom{n}{2}$, or if you like it's also $(n^2 - n)/2 = n(n-1)/2$.
answered Nov 19 at 3:18
Drew Brady
614315
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
I think you might be confusing two different things.
Fact 1: Define $S_n := sum_{k=1}^n k$. Then $S_n = n(n+1)/2$ for every nonnegative integer $n$.
(You can see this by induction. Certainly the formula is correct for $n = 0$. With $S_{n-1} = (n-1)n/2$, we have $S_{n} = n + S_{n-1} = (n+1)n/2$, as required.)
Then there is the following fact
Fact 2: Define $T_n = sum_{1 leq i < j leq n} 1$. Then $T_n = n(n-1)/2$.
This is just the number of tuples $(k, l)$ with $1 leq k leq n$ and $1 leq l leq n$ there are with $k < l$. That's just $binom{n}{2}$, or if you like it's also $(n^2 - n)/2 = n(n-1)/2$.
answered Nov 19 at 3:18
Drew Brady
614315
I think you might be confusing two different things.
Fact 1: Define $S_n := sum_{k=1}^n k$. Then $S_n = n(n+1)/2$ for every nonnegative integer $n$.
(You can see this by induction. Certainly the formula is correct for $n = 0$. With $S_{n-1} = (n-1)n/2$, we have $S_{n} = n + S_{n-1} = (n+1)n/2$, as required.)
Then there is the following fact
Fact 2: Define $T_n = sum_{1 leq i < j leq n} 1$. Then $T_n = n(n-1)/2$.
This is just the number of tuples $(k, l)$ with $1 leq k leq n$ and $1 leq l leq n$ there are with $k < l$. That's just $binom{n}{2}$, or if you like it's also $(n^2 - n)/2 = n(n-1)/2$.
answered Nov 19 at 3:18
Drew Brady
614315
answered Nov 19 at 3:18
Drew Brady
614315
answered Nov 19 at 3:18
Drew Brady
614315
answered Nov 19 at 3:18
Drew Brady
614315
614315
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3004466%2fdont-understand-double-summation-with-gausss-formula%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
I have edited your question. You can re-edit it if my edits are not correct.
– Tianlalu
Nov 19 at 3:11