I need help simplifying a sum problem that involves a binomial raised to a power

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
-2
down vote

favorite












I have come across a problem in my homework that describes the sum of a binomial squared, and I can't think of a way to simplify it. I have an idea that it would involve $fracleft(nright)left(n+1right)left(2n+1right)6$, but I can't seem to format the equation in a way that would be helpful. Any help would be much appreciated. There are two problems below, a solution to either would be amazing.



$sum_i=0^n-1fracleft(fracleft(n+1right)2-iright)^2n$
$sum_i=0^n-1left(fracleft(n+1right)2-iright)^2$







share|cite|improve this question






















  • Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
    – dxiv
    Aug 19 at 5:27















up vote
-2
down vote

favorite












I have come across a problem in my homework that describes the sum of a binomial squared, and I can't think of a way to simplify it. I have an idea that it would involve $fracleft(nright)left(n+1right)left(2n+1right)6$, but I can't seem to format the equation in a way that would be helpful. Any help would be much appreciated. There are two problems below, a solution to either would be amazing.



$sum_i=0^n-1fracleft(fracleft(n+1right)2-iright)^2n$
$sum_i=0^n-1left(fracleft(n+1right)2-iright)^2$







share|cite|improve this question






















  • Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
    – dxiv
    Aug 19 at 5:27













up vote
-2
down vote

favorite









up vote
-2
down vote

favorite











I have come across a problem in my homework that describes the sum of a binomial squared, and I can't think of a way to simplify it. I have an idea that it would involve $fracleft(nright)left(n+1right)left(2n+1right)6$, but I can't seem to format the equation in a way that would be helpful. Any help would be much appreciated. There are two problems below, a solution to either would be amazing.



$sum_i=0^n-1fracleft(fracleft(n+1right)2-iright)^2n$
$sum_i=0^n-1left(fracleft(n+1right)2-iright)^2$







share|cite|improve this question














I have come across a problem in my homework that describes the sum of a binomial squared, and I can't think of a way to simplify it. I have an idea that it would involve $fracleft(nright)left(n+1right)left(2n+1right)6$, but I can't seem to format the equation in a way that would be helpful. Any help would be much appreciated. There are two problems below, a solution to either would be amazing.



$sum_i=0^n-1fracleft(fracleft(n+1right)2-iright)^2n$
$sum_i=0^n-1left(fracleft(n+1right)2-iright)^2$









share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Aug 19 at 5:32

























asked Aug 19 at 5:16









Ryan Shesler

33




33











  • Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
    – dxiv
    Aug 19 at 5:27

















  • Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
    – dxiv
    Aug 19 at 5:27
















Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
– dxiv
Aug 19 at 5:27





Square the binomial first: $displaystyle;sum_i=0^n-1left(fracleft(n+1right)^24-(n+1),i+i^2right) = ldots;$
– dxiv
Aug 19 at 5:27











1 Answer
1






active

oldest

votes

















up vote
0
down vote



accepted










$beginarray\
s(n)
&=sum_i=0^n-1left(fracleft(n+1right)2-iright)^2\
&=frac14sum_i=0^n-1left(n+1-2iright)^2\
&=frac14sum_i=0^n-1((n+1)^2-4(n+1)i+4i^2)\
&=frac14sum_i=0^n-1(n+1)^2-sum_i=0^n-1(n+1)i+sum_i=0^n-1i^2\
&=frac14n(n+1)^2-frac12 n(n-1)(n+1)+frac16 (n-1)n(2n-1)\
&=dfracn12left( 3(n+1)^2-6(n-1)(n+1)+2 (n-1)(2n-1)right)\
&=dfracn12left( 3n^2+6n+3-6(n^2-1)+2(2n^2-3n+1)right)\
&=dfracn12left( 3n^2+6n+3-6n^2+6+4n^2-6n+2right)\
&=dfracn12left( n^2+11right)\
endarray
$






share|cite|improve this answer




















  • Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
    – Ryan Shesler
    Aug 19 at 16:33










  • does it have something to do with sum of a series, and if so how? @martycohen
    – Ryan Shesler
    Aug 19 at 16:46











  • Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
    – marty cohen
    Aug 19 at 22:33











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: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2887375%2fi-need-help-simplifying-a-sum-problem-that-involves-a-binomial-raised-to-a-power%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
0
down vote



accepted










$beginarray\
s(n)
&=sum_i=0^n-1left(fracleft(n+1right)2-iright)^2\
&=frac14sum_i=0^n-1left(n+1-2iright)^2\
&=frac14sum_i=0^n-1((n+1)^2-4(n+1)i+4i^2)\
&=frac14sum_i=0^n-1(n+1)^2-sum_i=0^n-1(n+1)i+sum_i=0^n-1i^2\
&=frac14n(n+1)^2-frac12 n(n-1)(n+1)+frac16 (n-1)n(2n-1)\
&=dfracn12left( 3(n+1)^2-6(n-1)(n+1)+2 (n-1)(2n-1)right)\
&=dfracn12left( 3n^2+6n+3-6(n^2-1)+2(2n^2-3n+1)right)\
&=dfracn12left( 3n^2+6n+3-6n^2+6+4n^2-6n+2right)\
&=dfracn12left( n^2+11right)\
endarray
$






share|cite|improve this answer




















  • Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
    – Ryan Shesler
    Aug 19 at 16:33










  • does it have something to do with sum of a series, and if so how? @martycohen
    – Ryan Shesler
    Aug 19 at 16:46











  • Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
    – marty cohen
    Aug 19 at 22:33















up vote
0
down vote



accepted










$beginarray\
s(n)
&=sum_i=0^n-1left(fracleft(n+1right)2-iright)^2\
&=frac14sum_i=0^n-1left(n+1-2iright)^2\
&=frac14sum_i=0^n-1((n+1)^2-4(n+1)i+4i^2)\
&=frac14sum_i=0^n-1(n+1)^2-sum_i=0^n-1(n+1)i+sum_i=0^n-1i^2\
&=frac14n(n+1)^2-frac12 n(n-1)(n+1)+frac16 (n-1)n(2n-1)\
&=dfracn12left( 3(n+1)^2-6(n-1)(n+1)+2 (n-1)(2n-1)right)\
&=dfracn12left( 3n^2+6n+3-6(n^2-1)+2(2n^2-3n+1)right)\
&=dfracn12left( 3n^2+6n+3-6n^2+6+4n^2-6n+2right)\
&=dfracn12left( n^2+11right)\
endarray
$






share|cite|improve this answer




















  • Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
    – Ryan Shesler
    Aug 19 at 16:33










  • does it have something to do with sum of a series, and if so how? @martycohen
    – Ryan Shesler
    Aug 19 at 16:46











  • Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
    – marty cohen
    Aug 19 at 22:33













up vote
0
down vote



accepted







up vote
0
down vote



accepted






$beginarray\
s(n)
&=sum_i=0^n-1left(fracleft(n+1right)2-iright)^2\
&=frac14sum_i=0^n-1left(n+1-2iright)^2\
&=frac14sum_i=0^n-1((n+1)^2-4(n+1)i+4i^2)\
&=frac14sum_i=0^n-1(n+1)^2-sum_i=0^n-1(n+1)i+sum_i=0^n-1i^2\
&=frac14n(n+1)^2-frac12 n(n-1)(n+1)+frac16 (n-1)n(2n-1)\
&=dfracn12left( 3(n+1)^2-6(n-1)(n+1)+2 (n-1)(2n-1)right)\
&=dfracn12left( 3n^2+6n+3-6(n^2-1)+2(2n^2-3n+1)right)\
&=dfracn12left( 3n^2+6n+3-6n^2+6+4n^2-6n+2right)\
&=dfracn12left( n^2+11right)\
endarray
$






share|cite|improve this answer












$beginarray\
s(n)
&=sum_i=0^n-1left(fracleft(n+1right)2-iright)^2\
&=frac14sum_i=0^n-1left(n+1-2iright)^2\
&=frac14sum_i=0^n-1((n+1)^2-4(n+1)i+4i^2)\
&=frac14sum_i=0^n-1(n+1)^2-sum_i=0^n-1(n+1)i+sum_i=0^n-1i^2\
&=frac14n(n+1)^2-frac12 n(n-1)(n+1)+frac16 (n-1)n(2n-1)\
&=dfracn12left( 3(n+1)^2-6(n-1)(n+1)+2 (n-1)(2n-1)right)\
&=dfracn12left( 3n^2+6n+3-6(n^2-1)+2(2n^2-3n+1)right)\
&=dfracn12left( 3n^2+6n+3-6n^2+6+4n^2-6n+2right)\
&=dfracn12left( n^2+11right)\
endarray
$







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Aug 19 at 5:51









marty cohen

69.6k446122




69.6k446122











  • Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
    – Ryan Shesler
    Aug 19 at 16:33










  • does it have something to do with sum of a series, and if so how? @martycohen
    – Ryan Shesler
    Aug 19 at 16:46











  • Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
    – marty cohen
    Aug 19 at 22:33

















  • Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
    – Ryan Shesler
    Aug 19 at 16:33










  • does it have something to do with sum of a series, and if so how? @martycohen
    – Ryan Shesler
    Aug 19 at 16:46











  • Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
    – marty cohen
    Aug 19 at 22:33
















Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
– Ryan Shesler
Aug 19 at 16:33




Hi! Thank you for the help! The problem checks, but I was just curious as to how you solved each of the sums in step 4.
– Ryan Shesler
Aug 19 at 16:33












does it have something to do with sum of a series, and if so how? @martycohen
– Ryan Shesler
Aug 19 at 16:46





does it have something to do with sum of a series, and if so how? @martycohen
– Ryan Shesler
Aug 19 at 16:46













Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
– marty cohen
Aug 19 at 22:33





Well known sums: $sum_i=0^n-1 i = n(n-1)/2, sum_i=0^n-1 i^2 = n(n-1)(2n-1)/6$.
– marty cohen
Aug 19 at 22:33













 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2887375%2fi-need-help-simplifying-a-sum-problem-that-involves-a-binomial-raised-to-a-power%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

tkz-euclide: tkzDrawCircle[R] not working

How to combine Bézier curves to a surface?

1st Magritte Awards