General formula for natural power summation nested
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Is there any general formula (even non concise) for
$$sum sum sum cdots sum limits_m - times n^k $$
For m = 1
$$sum n^k = 1^k + 2^k +3^k +cdots + n^k$$
For m = 2
$$sum sum n^k = 1^k +(1^k + 2^k) + (1^k + 2^k +3^k) +cdots + (1^k +2^k +3^k +cdots +n^k)$$
and so on....
sequences-and-series summation
add a comment |Â
up vote
0
down vote
favorite
Is there any general formula (even non concise) for
$$sum sum sum cdots sum limits_m - times n^k $$
For m = 1
$$sum n^k = 1^k + 2^k +3^k +cdots + n^k$$
For m = 2
$$sum sum n^k = 1^k +(1^k + 2^k) + (1^k + 2^k +3^k) +cdots + (1^k +2^k +3^k +cdots +n^k)$$
and so on....
sequences-and-series summation
3
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
2
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Is there any general formula (even non concise) for
$$sum sum sum cdots sum limits_m - times n^k $$
For m = 1
$$sum n^k = 1^k + 2^k +3^k +cdots + n^k$$
For m = 2
$$sum sum n^k = 1^k +(1^k + 2^k) + (1^k + 2^k +3^k) +cdots + (1^k +2^k +3^k +cdots +n^k)$$
and so on....
sequences-and-series summation
Is there any general formula (even non concise) for
$$sum sum sum cdots sum limits_m - times n^k $$
For m = 1
$$sum n^k = 1^k + 2^k +3^k +cdots + n^k$$
For m = 2
$$sum sum n^k = 1^k +(1^k + 2^k) + (1^k + 2^k +3^k) +cdots + (1^k +2^k +3^k +cdots +n^k)$$
and so on....
sequences-and-series summation
edited Aug 1 at 13:13
asked Aug 1 at 12:55
hanugm
789419
789419
3
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
2
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11
add a comment |Â
3
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
2
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11
3
3
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
2
2
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2869054%2fgeneral-formula-for-natural-power-summation-nested%23new-answer', 'question_page');
);
Post as a guest
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
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
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
3
Be careful with your summing indices, $n$ shouldn't be the upper bound of summation and the running index
– user190080
Aug 1 at 13:02
@user190080 unless ofc, that this is an indefinite sum. Regardless though, the formatting is ambiguous.
– Simply Beautiful Art
Aug 1 at 15:08
2
For $k=0,1,$ you may note the hockey-stick identity: $$sum_n=0^Nbinom nk=binomN+1k+1$$
– Simply Beautiful Art
Aug 1 at 15:11