Use PMI to prove this identity











up vote
0
down vote

favorite
1












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.










share|cite|improve this question









New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • 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















up vote
0
down vote

favorite
1












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.










share|cite|improve this question









New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • 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













up vote
0
down vote

favorite
1









up vote
0
down vote

favorite
1






1





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.










share|cite|improve this question









New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











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






share|cite|improve this question









New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited yesterday





















New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









yuanming luo

61




61




New contributor




yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






yuanming luo is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • 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










  • 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















active

oldest

votes











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',
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
});


}
});






yuanming luo is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















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






























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.










 

draft saved


draft discarded


















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.















 


draft saved


draft discarded














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





















































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







Popular posts from this blog

'app-layout' is not a known element: how to share Component with different Modules

android studio warns about leanback feature tag usage required on manifest while using Unity exported app?

SQL update select statement