Use PMI to prove this identity
up vote
0
down vote
favorite
Use Principle of Mathematical Induction to show that:
for $nge2$
$$sum_{{a_{n-1}}spacespace=1}^{a_n}sum_{a_{n-2}spacespace=1}^{a_{n-1}}......sum_{a_{1}=1}^{a_2}a_1=frac{prod_{i=0}^{n}(a_n+i)}{n!}$$
I have totally no idea to deal with the product. I can understand it when it only uses 3 sigma notation.
summation products
New contributor
add a comment |
up vote
0
down vote
favorite
Use Principle of Mathematical Induction to show that:
for $nge2$
$$sum_{{a_{n-1}}spacespace=1}^{a_n}sum_{a_{n-2}spacespace=1}^{a_{n-1}}......sum_{a_{1}=1}^{a_2}a_1=frac{prod_{i=0}^{n}(a_n+i)}{n!}$$
I have totally no idea to deal with the product. I can understand it when it only uses 3 sigma notation.
summation products
New contributor
any hint will be thankful
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Use Principle of Mathematical Induction to show that:
for $nge2$
$$sum_{{a_{n-1}}spacespace=1}^{a_n}sum_{a_{n-2}spacespace=1}^{a_{n-1}}......sum_{a_{1}=1}^{a_2}a_1=frac{prod_{i=0}^{n}(a_n+i)}{n!}$$
I have totally no idea to deal with the product. I can understand it when it only uses 3 sigma notation.
summation products
New contributor
Use Principle of Mathematical Induction to show that:
for $nge2$
$$sum_{{a_{n-1}}spacespace=1}^{a_n}sum_{a_{n-2}spacespace=1}^{a_{n-1}}......sum_{a_{1}=1}^{a_2}a_1=frac{prod_{i=0}^{n}(a_n+i)}{n!}$$
I have totally no idea to deal with the product. I can understand it when it only uses 3 sigma notation.
summation products
summation products
New contributor
New contributor
edited yesterday
New contributor
asked yesterday
yuanming luo
61
61
New contributor
New contributor
any hint will be thankful
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday
add a comment |
any hint will be thankful
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday
any hint will be thankful
– yuanming luo
yesterday
any hint will be thankful
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
yuanming luo is a new contributor. Be nice, and check out our Code of Conduct.
yuanming luo is a new contributor. Be nice, and check out our Code of Conduct.
yuanming luo is a new contributor. Be nice, and check out our Code of Conduct.
yuanming luo is a new contributor. Be nice, and check out our Code of Conduct.
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%2f3004905%2fuse-pmi-to-prove-this-identity%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
any hint will be thankful
– yuanming luo
yesterday
Could anyone check whether it is correct?
– yuanming luo
yesterday
I think one of the components of PMI lies on whether n=1 is satisfied, your lhs doesnt work on it , so no point in applying .For n>=2 this identity holds true ,I can prove it but not using PMI
– swapedoc
yesterday
@swapedoc How to prove it without PMI? Could you give me a hint? That may help.
– yuanming luo
yesterday
hint: look for faulhaber formula , also try to guess coefficients of x^k in (x+1)(x+2)(x+3)....(x+n) where k can be from 0 to n
– swapedoc
yesterday