Find a closed expression for $sum_{k=1}^nleft(sum_{l=1}^k l^2right)$. [closed]
Find the close expression for :
$$sum_{k=1}^nleft(sum_{l=1}^k l^2right)$$
I have very less knowledge about nested sigma notations. Any help or hints would be greatly appreciated.
summation
closed as off-topic by Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen Nov 29 at 20:12
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen
If this question can be reworded to fit the rules in the help center, please edit the question.
|
show 3 more comments
Find the close expression for :
$$sum_{k=1}^nleft(sum_{l=1}^k l^2right)$$
I have very less knowledge about nested sigma notations. Any help or hints would be greatly appreciated.
summation
closed as off-topic by Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen Nov 29 at 20:12
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen
If this question can be reworded to fit the rules in the help center, please edit the question.
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15
|
show 3 more comments
Find the close expression for :
$$sum_{k=1}^nleft(sum_{l=1}^k l^2right)$$
I have very less knowledge about nested sigma notations. Any help or hints would be greatly appreciated.
summation
Find the close expression for :
$$sum_{k=1}^nleft(sum_{l=1}^k l^2right)$$
I have very less knowledge about nested sigma notations. Any help or hints would be greatly appreciated.
summation
summation
edited Nov 29 at 17:20
Shaun
8,447113580
8,447113580
asked Nov 29 at 17:09
01110000_01110000
75
75
closed as off-topic by Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen Nov 29 at 20:12
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen
If this question can be reworded to fit the rules in the help center, please edit the question.
closed as off-topic by Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen Nov 29 at 20:12
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Shaun, amWhy, RRL, user10354138, Jyrki Lahtonen
If this question can be reworded to fit the rules in the help center, please edit the question.
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15
|
show 3 more comments
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15
|
show 3 more comments
3 Answers
3
active
oldest
votes
To evaluate this sum by hand efficiently, we can use something calling rising factorial.
For any $n > 0$, the rising factorial is a polynomial in $x$ defined by:
$$x^{(n)} = prodlimits_{k=0}^{n-1}(x+k)$$
One useful property of $x^{(n)}$ is it can be expressed as a difference of successive terms of $x^{(n+1)}$
$$begin{align}x^{(n)}
&= x(x+1)cdots(x+n-1)\ &= x(x+1)cdots(x+n-1)frac{(x+n)-(x-1)}{n+1}\
&= frac{1}{n+1}left(x^{(n+1)} - (x-1)^{(n+1)}right)end{align}
$$
This means summation over $x^{(n)}$ is a telescoping one.
$$begin{align}sum_{x=1}^y (x)_n &= frac{1}{n+1}sum_{x=1}^yleft( x^{(n+1)} - (x-1)^{(n+1)}right)
= frac{1}{n+1}left( y^{(n+1)} - 0^{(n+1)}right)\
&= frac{1}{n+1} y^{(n+1)}end{align}$$
For the sum at hand, notice $ell^2 = ell(ell+1) - ell = ell^{(2)} - ell^{(1)}$, we have
$$begin{align}sum_{k=1}^n sum_{ell=1}^k ell^2
&= sum_{k=1}^n sum_{ell=1}^kleft( ell^{(2)} - ell^{(1)}right)
= sum_{k=1}^n left(frac13 k^{(3)} - frac12 k^{(2)}right)\
&= frac{1}{3cdot 4}n^{(4)} - frac{1}{2cdot 3} n^{(3)}
= frac{n(n+1)(n+2)(n+3 - 2)}{12}\
&= frac{n(n+1)^2(n+2)}{12}end{align}$$
add a comment |
A brute force way is as follows. The inner sum can be written as
$$
sum_{l=1}^k l^2=frac{k(k+1)(2k+1)}{6}tag{1}
$$
To sum this over $k$ expand the LHS of $(1)$ and use the formulae
$$
sum_{j=1}^nj=frac{n(n+1)}{2}quad sum_{j=1}^nj^2=frac{n^2(n+1)^2}{4}.
$$
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
add a comment |
Hint:
A sum of $k^{th}$ powers can be expressed as a $k+1^{th}$ degree polynomial, quartic in your case. Furthermore, $P(0)=0$ because a void summation is zero, and
$$S(n)=n(an^3+bn^2+cn+d)$$ or
$$Q(n):=frac{P(n)}n=an^3+bn^2+cn+d$$ can be identified as the Lagrangian interpolation polynomial through the points $left(i,dfrac{S(i)}iright)$ for $i=1,2,3,4$.
add a comment |
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
To evaluate this sum by hand efficiently, we can use something calling rising factorial.
For any $n > 0$, the rising factorial is a polynomial in $x$ defined by:
$$x^{(n)} = prodlimits_{k=0}^{n-1}(x+k)$$
One useful property of $x^{(n)}$ is it can be expressed as a difference of successive terms of $x^{(n+1)}$
$$begin{align}x^{(n)}
&= x(x+1)cdots(x+n-1)\ &= x(x+1)cdots(x+n-1)frac{(x+n)-(x-1)}{n+1}\
&= frac{1}{n+1}left(x^{(n+1)} - (x-1)^{(n+1)}right)end{align}
$$
This means summation over $x^{(n)}$ is a telescoping one.
$$begin{align}sum_{x=1}^y (x)_n &= frac{1}{n+1}sum_{x=1}^yleft( x^{(n+1)} - (x-1)^{(n+1)}right)
= frac{1}{n+1}left( y^{(n+1)} - 0^{(n+1)}right)\
&= frac{1}{n+1} y^{(n+1)}end{align}$$
For the sum at hand, notice $ell^2 = ell(ell+1) - ell = ell^{(2)} - ell^{(1)}$, we have
$$begin{align}sum_{k=1}^n sum_{ell=1}^k ell^2
&= sum_{k=1}^n sum_{ell=1}^kleft( ell^{(2)} - ell^{(1)}right)
= sum_{k=1}^n left(frac13 k^{(3)} - frac12 k^{(2)}right)\
&= frac{1}{3cdot 4}n^{(4)} - frac{1}{2cdot 3} n^{(3)}
= frac{n(n+1)(n+2)(n+3 - 2)}{12}\
&= frac{n(n+1)^2(n+2)}{12}end{align}$$
add a comment |
To evaluate this sum by hand efficiently, we can use something calling rising factorial.
For any $n > 0$, the rising factorial is a polynomial in $x$ defined by:
$$x^{(n)} = prodlimits_{k=0}^{n-1}(x+k)$$
One useful property of $x^{(n)}$ is it can be expressed as a difference of successive terms of $x^{(n+1)}$
$$begin{align}x^{(n)}
&= x(x+1)cdots(x+n-1)\ &= x(x+1)cdots(x+n-1)frac{(x+n)-(x-1)}{n+1}\
&= frac{1}{n+1}left(x^{(n+1)} - (x-1)^{(n+1)}right)end{align}
$$
This means summation over $x^{(n)}$ is a telescoping one.
$$begin{align}sum_{x=1}^y (x)_n &= frac{1}{n+1}sum_{x=1}^yleft( x^{(n+1)} - (x-1)^{(n+1)}right)
= frac{1}{n+1}left( y^{(n+1)} - 0^{(n+1)}right)\
&= frac{1}{n+1} y^{(n+1)}end{align}$$
For the sum at hand, notice $ell^2 = ell(ell+1) - ell = ell^{(2)} - ell^{(1)}$, we have
$$begin{align}sum_{k=1}^n sum_{ell=1}^k ell^2
&= sum_{k=1}^n sum_{ell=1}^kleft( ell^{(2)} - ell^{(1)}right)
= sum_{k=1}^n left(frac13 k^{(3)} - frac12 k^{(2)}right)\
&= frac{1}{3cdot 4}n^{(4)} - frac{1}{2cdot 3} n^{(3)}
= frac{n(n+1)(n+2)(n+3 - 2)}{12}\
&= frac{n(n+1)^2(n+2)}{12}end{align}$$
add a comment |
To evaluate this sum by hand efficiently, we can use something calling rising factorial.
For any $n > 0$, the rising factorial is a polynomial in $x$ defined by:
$$x^{(n)} = prodlimits_{k=0}^{n-1}(x+k)$$
One useful property of $x^{(n)}$ is it can be expressed as a difference of successive terms of $x^{(n+1)}$
$$begin{align}x^{(n)}
&= x(x+1)cdots(x+n-1)\ &= x(x+1)cdots(x+n-1)frac{(x+n)-(x-1)}{n+1}\
&= frac{1}{n+1}left(x^{(n+1)} - (x-1)^{(n+1)}right)end{align}
$$
This means summation over $x^{(n)}$ is a telescoping one.
$$begin{align}sum_{x=1}^y (x)_n &= frac{1}{n+1}sum_{x=1}^yleft( x^{(n+1)} - (x-1)^{(n+1)}right)
= frac{1}{n+1}left( y^{(n+1)} - 0^{(n+1)}right)\
&= frac{1}{n+1} y^{(n+1)}end{align}$$
For the sum at hand, notice $ell^2 = ell(ell+1) - ell = ell^{(2)} - ell^{(1)}$, we have
$$begin{align}sum_{k=1}^n sum_{ell=1}^k ell^2
&= sum_{k=1}^n sum_{ell=1}^kleft( ell^{(2)} - ell^{(1)}right)
= sum_{k=1}^n left(frac13 k^{(3)} - frac12 k^{(2)}right)\
&= frac{1}{3cdot 4}n^{(4)} - frac{1}{2cdot 3} n^{(3)}
= frac{n(n+1)(n+2)(n+3 - 2)}{12}\
&= frac{n(n+1)^2(n+2)}{12}end{align}$$
To evaluate this sum by hand efficiently, we can use something calling rising factorial.
For any $n > 0$, the rising factorial is a polynomial in $x$ defined by:
$$x^{(n)} = prodlimits_{k=0}^{n-1}(x+k)$$
One useful property of $x^{(n)}$ is it can be expressed as a difference of successive terms of $x^{(n+1)}$
$$begin{align}x^{(n)}
&= x(x+1)cdots(x+n-1)\ &= x(x+1)cdots(x+n-1)frac{(x+n)-(x-1)}{n+1}\
&= frac{1}{n+1}left(x^{(n+1)} - (x-1)^{(n+1)}right)end{align}
$$
This means summation over $x^{(n)}$ is a telescoping one.
$$begin{align}sum_{x=1}^y (x)_n &= frac{1}{n+1}sum_{x=1}^yleft( x^{(n+1)} - (x-1)^{(n+1)}right)
= frac{1}{n+1}left( y^{(n+1)} - 0^{(n+1)}right)\
&= frac{1}{n+1} y^{(n+1)}end{align}$$
For the sum at hand, notice $ell^2 = ell(ell+1) - ell = ell^{(2)} - ell^{(1)}$, we have
$$begin{align}sum_{k=1}^n sum_{ell=1}^k ell^2
&= sum_{k=1}^n sum_{ell=1}^kleft( ell^{(2)} - ell^{(1)}right)
= sum_{k=1}^n left(frac13 k^{(3)} - frac12 k^{(2)}right)\
&= frac{1}{3cdot 4}n^{(4)} - frac{1}{2cdot 3} n^{(3)}
= frac{n(n+1)(n+2)(n+3 - 2)}{12}\
&= frac{n(n+1)^2(n+2)}{12}end{align}$$
answered Nov 29 at 18:15
achille hui
95.2k5129256
95.2k5129256
add a comment |
add a comment |
A brute force way is as follows. The inner sum can be written as
$$
sum_{l=1}^k l^2=frac{k(k+1)(2k+1)}{6}tag{1}
$$
To sum this over $k$ expand the LHS of $(1)$ and use the formulae
$$
sum_{j=1}^nj=frac{n(n+1)}{2}quad sum_{j=1}^nj^2=frac{n^2(n+1)^2}{4}.
$$
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
add a comment |
A brute force way is as follows. The inner sum can be written as
$$
sum_{l=1}^k l^2=frac{k(k+1)(2k+1)}{6}tag{1}
$$
To sum this over $k$ expand the LHS of $(1)$ and use the formulae
$$
sum_{j=1}^nj=frac{n(n+1)}{2}quad sum_{j=1}^nj^2=frac{n^2(n+1)^2}{4}.
$$
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
add a comment |
A brute force way is as follows. The inner sum can be written as
$$
sum_{l=1}^k l^2=frac{k(k+1)(2k+1)}{6}tag{1}
$$
To sum this over $k$ expand the LHS of $(1)$ and use the formulae
$$
sum_{j=1}^nj=frac{n(n+1)}{2}quad sum_{j=1}^nj^2=frac{n^2(n+1)^2}{4}.
$$
A brute force way is as follows. The inner sum can be written as
$$
sum_{l=1}^k l^2=frac{k(k+1)(2k+1)}{6}tag{1}
$$
To sum this over $k$ expand the LHS of $(1)$ and use the formulae
$$
sum_{j=1}^nj=frac{n(n+1)}{2}quad sum_{j=1}^nj^2=frac{n^2(n+1)^2}{4}.
$$
answered Nov 29 at 17:13
Foobaz John
20.9k41250
20.9k41250
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
add a comment |
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
So to get the answer would you replace n with k(k+1)(2k+1)/6 ?
– 01110000_01110000
Nov 29 at 17:19
add a comment |
Hint:
A sum of $k^{th}$ powers can be expressed as a $k+1^{th}$ degree polynomial, quartic in your case. Furthermore, $P(0)=0$ because a void summation is zero, and
$$S(n)=n(an^3+bn^2+cn+d)$$ or
$$Q(n):=frac{P(n)}n=an^3+bn^2+cn+d$$ can be identified as the Lagrangian interpolation polynomial through the points $left(i,dfrac{S(i)}iright)$ for $i=1,2,3,4$.
add a comment |
Hint:
A sum of $k^{th}$ powers can be expressed as a $k+1^{th}$ degree polynomial, quartic in your case. Furthermore, $P(0)=0$ because a void summation is zero, and
$$S(n)=n(an^3+bn^2+cn+d)$$ or
$$Q(n):=frac{P(n)}n=an^3+bn^2+cn+d$$ can be identified as the Lagrangian interpolation polynomial through the points $left(i,dfrac{S(i)}iright)$ for $i=1,2,3,4$.
add a comment |
Hint:
A sum of $k^{th}$ powers can be expressed as a $k+1^{th}$ degree polynomial, quartic in your case. Furthermore, $P(0)=0$ because a void summation is zero, and
$$S(n)=n(an^3+bn^2+cn+d)$$ or
$$Q(n):=frac{P(n)}n=an^3+bn^2+cn+d$$ can be identified as the Lagrangian interpolation polynomial through the points $left(i,dfrac{S(i)}iright)$ for $i=1,2,3,4$.
Hint:
A sum of $k^{th}$ powers can be expressed as a $k+1^{th}$ degree polynomial, quartic in your case. Furthermore, $P(0)=0$ because a void summation is zero, and
$$S(n)=n(an^3+bn^2+cn+d)$$ or
$$Q(n):=frac{P(n)}n=an^3+bn^2+cn+d$$ can be identified as the Lagrangian interpolation polynomial through the points $left(i,dfrac{S(i)}iright)$ for $i=1,2,3,4$.
answered Nov 29 at 17:19
Yves Daoust
124k671221
124k671221
add a comment |
add a comment |
At least can you express the inner summation ?
– Yves Daoust
Nov 29 at 17:11
@YvesDaoust By solve you mean expand?
– 01110000_01110000
Nov 29 at 17:13
I changed to "express".
– Yves Daoust
Nov 29 at 17:13
@YvesDaoust No I do not. I am still unclear about what you are asking
– 01110000_01110000
Nov 29 at 17:14
The inner summation yields $dfrac{k(k+1)(2k+1)}{6}.$ (en.wikipedia.org/wiki/Summation).
– amWhy
Nov 29 at 17:15