Value of a binomial seriesSum of square binomial coefficientsSimplify a triple sumFinite summation with binomial coefficients, $sum (-1)^kbinomrk binomk/2q$Curious Binomial Coefficient IdentityBinomial coefficient as a summation series proof?Summing the binomial pmf over $n$Finite sum with three binomial coefficientsHow would you derivative the Binomial distribution?Another (complicated?) summation identity with binomial coefficientsalgebraic derivation of sum of binomial coefficients

How to patch glass cuts in a bicycle tire?

Can a person survive on blood in place of water?

Can I summon an otherworldly creature with the Gate spell without knowing its true name?

Is the Unsullied name meant to be ironic? How did it come to be?

Need to read my home electrical meter

Do I need full recovery mode when I have multiple daily backup?

What was the idiom for something that we take without a doubt?

What does $!# mean in Shell scripting?

Does this strict reading of the rules allow both Extra Attack and the Thirsting Blade warlock invocation to be used together?

A steel cutting sword?

Efficient Algorithm for the boundary of a set of tiles

Why did Jon Snow do this immoral act if he is so honorable?

Value of a binomial series

In the 3D Zeldas, is it faster to roll or to simply walk?

Remove CiviCRM and Drupal links / banner on profile form

Is the field of q-series 'dead'?

Can I tell a prospective employee that everyone in the team is leaving?

Python program to take in two strings and print the larger string

Why would Ryanair allow me to book this journey through a third party, but not through their own website?

Why most published works in medical imaging try reducing false positives?

NIntegrate doesn't evaluate

Which European Languages are not Indo-European?

How did NASA Langley end up with the first 737?

Why didn't Thanos use the Time Stone to stop the Avengers' plan?



Value of a binomial series


Sum of square binomial coefficientsSimplify a triple sumFinite summation with binomial coefficients, $sum (-1)^kbinomrk binomk/2q$Curious Binomial Coefficient IdentityBinomial coefficient as a summation series proof?Summing the binomial pmf over $n$Finite sum with three binomial coefficientsHow would you derivative the Binomial distribution?Another (complicated?) summation identity with binomial coefficientsalgebraic derivation of sum of binomial coefficients













5












$begingroup$


Some time ago a question was asked here regarding the value of the sum $$sum_i=0^k frac2i choose i4^i$$.
But it was deleted later by the OP.I went around it but didn't find a solution.
Some common combinatoric identities I know of are $4^i=2^2i=sum_j=0^2i 2ichoose j$ also that $2i choose i=sum_j=0^i ichoose j^2$. But they were
hardly of any use.I also thought of individual term as probability but turns out I cant think of it as any thing sensible.a quick WA check gave answer as $$k+frac12 choose k=frac(2k+1)!k!^24^k$$
Help would be appreciated!










share|cite|improve this question









$endgroup$
















    5












    $begingroup$


    Some time ago a question was asked here regarding the value of the sum $$sum_i=0^k frac2i choose i4^i$$.
    But it was deleted later by the OP.I went around it but didn't find a solution.
    Some common combinatoric identities I know of are $4^i=2^2i=sum_j=0^2i 2ichoose j$ also that $2i choose i=sum_j=0^i ichoose j^2$. But they were
    hardly of any use.I also thought of individual term as probability but turns out I cant think of it as any thing sensible.a quick WA check gave answer as $$k+frac12 choose k=frac(2k+1)!k!^24^k$$
    Help would be appreciated!










    share|cite|improve this question









    $endgroup$














      5












      5








      5


      2



      $begingroup$


      Some time ago a question was asked here regarding the value of the sum $$sum_i=0^k frac2i choose i4^i$$.
      But it was deleted later by the OP.I went around it but didn't find a solution.
      Some common combinatoric identities I know of are $4^i=2^2i=sum_j=0^2i 2ichoose j$ also that $2i choose i=sum_j=0^i ichoose j^2$. But they were
      hardly of any use.I also thought of individual term as probability but turns out I cant think of it as any thing sensible.a quick WA check gave answer as $$k+frac12 choose k=frac(2k+1)!k!^24^k$$
      Help would be appreciated!










      share|cite|improve this question









      $endgroup$




      Some time ago a question was asked here regarding the value of the sum $$sum_i=0^k frac2i choose i4^i$$.
      But it was deleted later by the OP.I went around it but didn't find a solution.
      Some common combinatoric identities I know of are $4^i=2^2i=sum_j=0^2i 2ichoose j$ also that $2i choose i=sum_j=0^i ichoose j^2$. But they were
      hardly of any use.I also thought of individual term as probability but turns out I cant think of it as any thing sensible.a quick WA check gave answer as $$k+frac12 choose k=frac(2k+1)!k!^24^k$$
      Help would be appreciated!







      summation binomial-coefficients






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 8 hours ago









      Archis WelankarArchis Welankar

      12.3k41742




      12.3k41742




















          3 Answers
          3






          active

          oldest

          votes


















          2












          $begingroup$

          We prove that $$sum_k=0^n frac2k choose k4^k = frac(2n+1)!n!^24^n.$$
          We proceed by induction. The base case is easily verifiable. Denote the RHS of the above equation as $a_n$.
          Now consider $$a_n+1 = frac(2n+3)!(n+1)!^24^n+1 = frac(2n+2)(2n+3)4(n+1)^2 cdot frac(2n+1)!n!^24^n = frac(2n+3)2n+2 a_n.$$
          So we now have $$a_n+1 - a_n =fraca_n2n+2 = frac(2n+1)!2(n+1)cdot n!^24^n = frac(2n+1)!(n+1)!n!4^n+1cdot 2\ = frac(2n+1)!(n+1)!n!4^n+1cdot frac2n+2n+1 = frac(2n+2)!(n+1)!^24^n+1 = frac2(n+1) choose n+14^n+1,$$
          which is the added term in the summation. This completes the induction.






          share|cite|improve this answer










          New contributor



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





          $endgroup$












          • $begingroup$
            +1 but the result wasn't known beforehand so I dont think induction can really help :)
            $endgroup$
            – Archis Welankar
            7 hours ago










          • $begingroup$
            @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
            $endgroup$
            – auscrypt
            7 hours ago


















          2












          $begingroup$

          We use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ of a series. Recalling the generating function of the central binomial coefficients we can write
          beginalign*
          [z^i]frac1sqrt1-4z=binom2iitag1
          endalign*




          We obtain
          beginalign*
          colorbluesum_i=0^kcolorbluebinom2iifrac14^i
          &=sum_i=0^k[z^i]frac1sqrt1-ztag2\
          &=[z^0]frac1sqrt1-zsum_i=0^kz^-itag3\
          &=[z^0]frac1sqrt1-zcdotfracleft(frac1zright)^k+1-1frac1z-1tag4\
          &=[z^k]frac1-z^k+1(1-z)^3/2tag5\
          &=[z^k]sum_j=0^inftybinom-frac32j(-z)^jtag6\
          &=[z^k]sum_j=0^inftybinomj+frac12jz^jtag7\
          &,,colorblue=binomk+frac12k
          endalign*



          and the claim follows.




          Comment:



          • In (2) we apply the coefficient of operator according to (1).


          • In (3) we use the rule $[z^p-q]A(z)=[z^p]z^qA(z)$.


          • In (4) we apply the finite geometric series formula.


          • In (5) we do some simplifications and apply the rule from (3) again.


          • In (6) we observe $z^k+1$ in the numerator does not contribute to $[z^k]$ and we make a binomial series expansion.


          • In (7) we use the binomial identity $binom-pq=binomp+q-1q(-1)^q$.


          • In (8) we finally select the coefficient of $z^k$.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            the "coefficient of" method is always effective ! (+1)
            $endgroup$
            – G Cab
            4 hours ago










          • $begingroup$
            @GCab: At least often useful. :-) Thanks for the credit.
            $endgroup$
            – Markus Scheuer
            4 hours ago


















          1












          $begingroup$

          In another way, using the duplication formula for Gamma
          $$
          Gamma left( 2,z right) = 2^,2,z - 1 over sqrt pi Gamma left( z right)Gamma left( z + 1/2 right)
          = 2^,2,z - 1 Gamma left( z right)Gamma left( z + 1/2 right) over Gamma left( 1/2 right)
          $$

          we have
          $$
          1 over 4^,i binom2ii
          = 1 over 4^,i Gamma left( 2left( i + 1/2 right) right) over Gamma left( i + 1 right)^,2
          = Gamma left( i + 1/2 right) over Gamma left( 1/2 right)Gamma left( i + 1 right) = binomi-1/2i
          $$



          Then our sum is
          $$
          eqalign
          & sumlimits_i = 0^k 1 over 4^,i left( matrix
          2i cr
          i cr right) = cr
          & = sumlimits_i = 0^k left( matrix
          i - 1/2 cr
          i cr right) = quad quad (1) cr
          & = sumlimits_i left( matrix
          k - i cr
          k - i cr right)left( matrix
          i - 1/2 cr
          i cr right) = quad quad (2) cr
          & = left( matrix
          k + 1/2 cr
          k cr right)quad quad (3) cr
          $$

          where:

          1) for the identity above;

          2) replacing the sum upper bound with the first b., the lower bound is implicit in the second b.;

          3) using the "double convolution" formula for binomials.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Very nice approach. (+1)
            $endgroup$
            – Markus Scheuer
            4 hours ago











          Your Answer








          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',
          autoActivateHeartbeat: false,
          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
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3237320%2fvalue-of-a-binomial-series%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          3 Answers
          3






          active

          oldest

          votes








          3 Answers
          3






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          We prove that $$sum_k=0^n frac2k choose k4^k = frac(2n+1)!n!^24^n.$$
          We proceed by induction. The base case is easily verifiable. Denote the RHS of the above equation as $a_n$.
          Now consider $$a_n+1 = frac(2n+3)!(n+1)!^24^n+1 = frac(2n+2)(2n+3)4(n+1)^2 cdot frac(2n+1)!n!^24^n = frac(2n+3)2n+2 a_n.$$
          So we now have $$a_n+1 - a_n =fraca_n2n+2 = frac(2n+1)!2(n+1)cdot n!^24^n = frac(2n+1)!(n+1)!n!4^n+1cdot 2\ = frac(2n+1)!(n+1)!n!4^n+1cdot frac2n+2n+1 = frac(2n+2)!(n+1)!^24^n+1 = frac2(n+1) choose n+14^n+1,$$
          which is the added term in the summation. This completes the induction.






          share|cite|improve this answer










          New contributor



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





          $endgroup$












          • $begingroup$
            +1 but the result wasn't known beforehand so I dont think induction can really help :)
            $endgroup$
            – Archis Welankar
            7 hours ago










          • $begingroup$
            @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
            $endgroup$
            – auscrypt
            7 hours ago















          2












          $begingroup$

          We prove that $$sum_k=0^n frac2k choose k4^k = frac(2n+1)!n!^24^n.$$
          We proceed by induction. The base case is easily verifiable. Denote the RHS of the above equation as $a_n$.
          Now consider $$a_n+1 = frac(2n+3)!(n+1)!^24^n+1 = frac(2n+2)(2n+3)4(n+1)^2 cdot frac(2n+1)!n!^24^n = frac(2n+3)2n+2 a_n.$$
          So we now have $$a_n+1 - a_n =fraca_n2n+2 = frac(2n+1)!2(n+1)cdot n!^24^n = frac(2n+1)!(n+1)!n!4^n+1cdot 2\ = frac(2n+1)!(n+1)!n!4^n+1cdot frac2n+2n+1 = frac(2n+2)!(n+1)!^24^n+1 = frac2(n+1) choose n+14^n+1,$$
          which is the added term in the summation. This completes the induction.






          share|cite|improve this answer










          New contributor



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





          $endgroup$












          • $begingroup$
            +1 but the result wasn't known beforehand so I dont think induction can really help :)
            $endgroup$
            – Archis Welankar
            7 hours ago










          • $begingroup$
            @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
            $endgroup$
            – auscrypt
            7 hours ago













          2












          2








          2





          $begingroup$

          We prove that $$sum_k=0^n frac2k choose k4^k = frac(2n+1)!n!^24^n.$$
          We proceed by induction. The base case is easily verifiable. Denote the RHS of the above equation as $a_n$.
          Now consider $$a_n+1 = frac(2n+3)!(n+1)!^24^n+1 = frac(2n+2)(2n+3)4(n+1)^2 cdot frac(2n+1)!n!^24^n = frac(2n+3)2n+2 a_n.$$
          So we now have $$a_n+1 - a_n =fraca_n2n+2 = frac(2n+1)!2(n+1)cdot n!^24^n = frac(2n+1)!(n+1)!n!4^n+1cdot 2\ = frac(2n+1)!(n+1)!n!4^n+1cdot frac2n+2n+1 = frac(2n+2)!(n+1)!^24^n+1 = frac2(n+1) choose n+14^n+1,$$
          which is the added term in the summation. This completes the induction.






          share|cite|improve this answer










          New contributor



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





          $endgroup$



          We prove that $$sum_k=0^n frac2k choose k4^k = frac(2n+1)!n!^24^n.$$
          We proceed by induction. The base case is easily verifiable. Denote the RHS of the above equation as $a_n$.
          Now consider $$a_n+1 = frac(2n+3)!(n+1)!^24^n+1 = frac(2n+2)(2n+3)4(n+1)^2 cdot frac(2n+1)!n!^24^n = frac(2n+3)2n+2 a_n.$$
          So we now have $$a_n+1 - a_n =fraca_n2n+2 = frac(2n+1)!2(n+1)cdot n!^24^n = frac(2n+1)!(n+1)!n!4^n+1cdot 2\ = frac(2n+1)!(n+1)!n!4^n+1cdot frac2n+2n+1 = frac(2n+2)!(n+1)!^24^n+1 = frac2(n+1) choose n+14^n+1,$$
          which is the added term in the summation. This completes the induction.







          share|cite|improve this answer










          New contributor



          auscrypt 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 answer



          share|cite|improve this answer








          edited 5 hours ago









          darij grinberg

          11.8k33268




          11.8k33268






          New contributor



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








          answered 8 hours ago









          auscryptauscrypt

          1,3867




          1,3867




          New contributor



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




          New contributor




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













          • $begingroup$
            +1 but the result wasn't known beforehand so I dont think induction can really help :)
            $endgroup$
            – Archis Welankar
            7 hours ago










          • $begingroup$
            @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
            $endgroup$
            – auscrypt
            7 hours ago
















          • $begingroup$
            +1 but the result wasn't known beforehand so I dont think induction can really help :)
            $endgroup$
            – Archis Welankar
            7 hours ago










          • $begingroup$
            @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
            $endgroup$
            – auscrypt
            7 hours ago















          $begingroup$
          +1 but the result wasn't known beforehand so I dont think induction can really help :)
          $endgroup$
          – Archis Welankar
          7 hours ago




          $begingroup$
          +1 but the result wasn't known beforehand so I dont think induction can really help :)
          $endgroup$
          – Archis Welankar
          7 hours ago












          $begingroup$
          @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
          $endgroup$
          – auscrypt
          7 hours ago




          $begingroup$
          @ArchisWelankar Yeah, induction is only really useful here because the result was worked out already, either by guessing it or by using WA (or some other method).
          $endgroup$
          – auscrypt
          7 hours ago











          2












          $begingroup$

          We use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ of a series. Recalling the generating function of the central binomial coefficients we can write
          beginalign*
          [z^i]frac1sqrt1-4z=binom2iitag1
          endalign*




          We obtain
          beginalign*
          colorbluesum_i=0^kcolorbluebinom2iifrac14^i
          &=sum_i=0^k[z^i]frac1sqrt1-ztag2\
          &=[z^0]frac1sqrt1-zsum_i=0^kz^-itag3\
          &=[z^0]frac1sqrt1-zcdotfracleft(frac1zright)^k+1-1frac1z-1tag4\
          &=[z^k]frac1-z^k+1(1-z)^3/2tag5\
          &=[z^k]sum_j=0^inftybinom-frac32j(-z)^jtag6\
          &=[z^k]sum_j=0^inftybinomj+frac12jz^jtag7\
          &,,colorblue=binomk+frac12k
          endalign*



          and the claim follows.




          Comment:



          • In (2) we apply the coefficient of operator according to (1).


          • In (3) we use the rule $[z^p-q]A(z)=[z^p]z^qA(z)$.


          • In (4) we apply the finite geometric series formula.


          • In (5) we do some simplifications and apply the rule from (3) again.


          • In (6) we observe $z^k+1$ in the numerator does not contribute to $[z^k]$ and we make a binomial series expansion.


          • In (7) we use the binomial identity $binom-pq=binomp+q-1q(-1)^q$.


          • In (8) we finally select the coefficient of $z^k$.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            the "coefficient of" method is always effective ! (+1)
            $endgroup$
            – G Cab
            4 hours ago










          • $begingroup$
            @GCab: At least often useful. :-) Thanks for the credit.
            $endgroup$
            – Markus Scheuer
            4 hours ago















          2












          $begingroup$

          We use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ of a series. Recalling the generating function of the central binomial coefficients we can write
          beginalign*
          [z^i]frac1sqrt1-4z=binom2iitag1
          endalign*




          We obtain
          beginalign*
          colorbluesum_i=0^kcolorbluebinom2iifrac14^i
          &=sum_i=0^k[z^i]frac1sqrt1-ztag2\
          &=[z^0]frac1sqrt1-zsum_i=0^kz^-itag3\
          &=[z^0]frac1sqrt1-zcdotfracleft(frac1zright)^k+1-1frac1z-1tag4\
          &=[z^k]frac1-z^k+1(1-z)^3/2tag5\
          &=[z^k]sum_j=0^inftybinom-frac32j(-z)^jtag6\
          &=[z^k]sum_j=0^inftybinomj+frac12jz^jtag7\
          &,,colorblue=binomk+frac12k
          endalign*



          and the claim follows.




          Comment:



          • In (2) we apply the coefficient of operator according to (1).


          • In (3) we use the rule $[z^p-q]A(z)=[z^p]z^qA(z)$.


          • In (4) we apply the finite geometric series formula.


          • In (5) we do some simplifications and apply the rule from (3) again.


          • In (6) we observe $z^k+1$ in the numerator does not contribute to $[z^k]$ and we make a binomial series expansion.


          • In (7) we use the binomial identity $binom-pq=binomp+q-1q(-1)^q$.


          • In (8) we finally select the coefficient of $z^k$.






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            the "coefficient of" method is always effective ! (+1)
            $endgroup$
            – G Cab
            4 hours ago










          • $begingroup$
            @GCab: At least often useful. :-) Thanks for the credit.
            $endgroup$
            – Markus Scheuer
            4 hours ago













          2












          2








          2





          $begingroup$

          We use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ of a series. Recalling the generating function of the central binomial coefficients we can write
          beginalign*
          [z^i]frac1sqrt1-4z=binom2iitag1
          endalign*




          We obtain
          beginalign*
          colorbluesum_i=0^kcolorbluebinom2iifrac14^i
          &=sum_i=0^k[z^i]frac1sqrt1-ztag2\
          &=[z^0]frac1sqrt1-zsum_i=0^kz^-itag3\
          &=[z^0]frac1sqrt1-zcdotfracleft(frac1zright)^k+1-1frac1z-1tag4\
          &=[z^k]frac1-z^k+1(1-z)^3/2tag5\
          &=[z^k]sum_j=0^inftybinom-frac32j(-z)^jtag6\
          &=[z^k]sum_j=0^inftybinomj+frac12jz^jtag7\
          &,,colorblue=binomk+frac12k
          endalign*



          and the claim follows.




          Comment:



          • In (2) we apply the coefficient of operator according to (1).


          • In (3) we use the rule $[z^p-q]A(z)=[z^p]z^qA(z)$.


          • In (4) we apply the finite geometric series formula.


          • In (5) we do some simplifications and apply the rule from (3) again.


          • In (6) we observe $z^k+1$ in the numerator does not contribute to $[z^k]$ and we make a binomial series expansion.


          • In (7) we use the binomial identity $binom-pq=binomp+q-1q(-1)^q$.


          • In (8) we finally select the coefficient of $z^k$.






          share|cite|improve this answer











          $endgroup$



          We use the coefficient of operator $[z^n]$ to denote the coefficient of $z^n$ of a series. Recalling the generating function of the central binomial coefficients we can write
          beginalign*
          [z^i]frac1sqrt1-4z=binom2iitag1
          endalign*




          We obtain
          beginalign*
          colorbluesum_i=0^kcolorbluebinom2iifrac14^i
          &=sum_i=0^k[z^i]frac1sqrt1-ztag2\
          &=[z^0]frac1sqrt1-zsum_i=0^kz^-itag3\
          &=[z^0]frac1sqrt1-zcdotfracleft(frac1zright)^k+1-1frac1z-1tag4\
          &=[z^k]frac1-z^k+1(1-z)^3/2tag5\
          &=[z^k]sum_j=0^inftybinom-frac32j(-z)^jtag6\
          &=[z^k]sum_j=0^inftybinomj+frac12jz^jtag7\
          &,,colorblue=binomk+frac12k
          endalign*



          and the claim follows.




          Comment:



          • In (2) we apply the coefficient of operator according to (1).


          • In (3) we use the rule $[z^p-q]A(z)=[z^p]z^qA(z)$.


          • In (4) we apply the finite geometric series formula.


          • In (5) we do some simplifications and apply the rule from (3) again.


          • In (6) we observe $z^k+1$ in the numerator does not contribute to $[z^k]$ and we make a binomial series expansion.


          • In (7) we use the binomial identity $binom-pq=binomp+q-1q(-1)^q$.


          • In (8) we finally select the coefficient of $z^k$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited 5 hours ago

























          answered 5 hours ago









          Markus ScheuerMarkus Scheuer

          65.6k461156




          65.6k461156











          • $begingroup$
            the "coefficient of" method is always effective ! (+1)
            $endgroup$
            – G Cab
            4 hours ago










          • $begingroup$
            @GCab: At least often useful. :-) Thanks for the credit.
            $endgroup$
            – Markus Scheuer
            4 hours ago
















          • $begingroup$
            the "coefficient of" method is always effective ! (+1)
            $endgroup$
            – G Cab
            4 hours ago










          • $begingroup$
            @GCab: At least often useful. :-) Thanks for the credit.
            $endgroup$
            – Markus Scheuer
            4 hours ago















          $begingroup$
          the "coefficient of" method is always effective ! (+1)
          $endgroup$
          – G Cab
          4 hours ago




          $begingroup$
          the "coefficient of" method is always effective ! (+1)
          $endgroup$
          – G Cab
          4 hours ago












          $begingroup$
          @GCab: At least often useful. :-) Thanks for the credit.
          $endgroup$
          – Markus Scheuer
          4 hours ago




          $begingroup$
          @GCab: At least often useful. :-) Thanks for the credit.
          $endgroup$
          – Markus Scheuer
          4 hours ago











          1












          $begingroup$

          In another way, using the duplication formula for Gamma
          $$
          Gamma left( 2,z right) = 2^,2,z - 1 over sqrt pi Gamma left( z right)Gamma left( z + 1/2 right)
          = 2^,2,z - 1 Gamma left( z right)Gamma left( z + 1/2 right) over Gamma left( 1/2 right)
          $$

          we have
          $$
          1 over 4^,i binom2ii
          = 1 over 4^,i Gamma left( 2left( i + 1/2 right) right) over Gamma left( i + 1 right)^,2
          = Gamma left( i + 1/2 right) over Gamma left( 1/2 right)Gamma left( i + 1 right) = binomi-1/2i
          $$



          Then our sum is
          $$
          eqalign
          & sumlimits_i = 0^k 1 over 4^,i left( matrix
          2i cr
          i cr right) = cr
          & = sumlimits_i = 0^k left( matrix
          i - 1/2 cr
          i cr right) = quad quad (1) cr
          & = sumlimits_i left( matrix
          k - i cr
          k - i cr right)left( matrix
          i - 1/2 cr
          i cr right) = quad quad (2) cr
          & = left( matrix
          k + 1/2 cr
          k cr right)quad quad (3) cr
          $$

          where:

          1) for the identity above;

          2) replacing the sum upper bound with the first b., the lower bound is implicit in the second b.;

          3) using the "double convolution" formula for binomials.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Very nice approach. (+1)
            $endgroup$
            – Markus Scheuer
            4 hours ago















          1












          $begingroup$

          In another way, using the duplication formula for Gamma
          $$
          Gamma left( 2,z right) = 2^,2,z - 1 over sqrt pi Gamma left( z right)Gamma left( z + 1/2 right)
          = 2^,2,z - 1 Gamma left( z right)Gamma left( z + 1/2 right) over Gamma left( 1/2 right)
          $$

          we have
          $$
          1 over 4^,i binom2ii
          = 1 over 4^,i Gamma left( 2left( i + 1/2 right) right) over Gamma left( i + 1 right)^,2
          = Gamma left( i + 1/2 right) over Gamma left( 1/2 right)Gamma left( i + 1 right) = binomi-1/2i
          $$



          Then our sum is
          $$
          eqalign
          & sumlimits_i = 0^k 1 over 4^,i left( matrix
          2i cr
          i cr right) = cr
          & = sumlimits_i = 0^k left( matrix
          i - 1/2 cr
          i cr right) = quad quad (1) cr
          & = sumlimits_i left( matrix
          k - i cr
          k - i cr right)left( matrix
          i - 1/2 cr
          i cr right) = quad quad (2) cr
          & = left( matrix
          k + 1/2 cr
          k cr right)quad quad (3) cr
          $$

          where:

          1) for the identity above;

          2) replacing the sum upper bound with the first b., the lower bound is implicit in the second b.;

          3) using the "double convolution" formula for binomials.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Very nice approach. (+1)
            $endgroup$
            – Markus Scheuer
            4 hours ago













          1












          1








          1





          $begingroup$

          In another way, using the duplication formula for Gamma
          $$
          Gamma left( 2,z right) = 2^,2,z - 1 over sqrt pi Gamma left( z right)Gamma left( z + 1/2 right)
          = 2^,2,z - 1 Gamma left( z right)Gamma left( z + 1/2 right) over Gamma left( 1/2 right)
          $$

          we have
          $$
          1 over 4^,i binom2ii
          = 1 over 4^,i Gamma left( 2left( i + 1/2 right) right) over Gamma left( i + 1 right)^,2
          = Gamma left( i + 1/2 right) over Gamma left( 1/2 right)Gamma left( i + 1 right) = binomi-1/2i
          $$



          Then our sum is
          $$
          eqalign
          & sumlimits_i = 0^k 1 over 4^,i left( matrix
          2i cr
          i cr right) = cr
          & = sumlimits_i = 0^k left( matrix
          i - 1/2 cr
          i cr right) = quad quad (1) cr
          & = sumlimits_i left( matrix
          k - i cr
          k - i cr right)left( matrix
          i - 1/2 cr
          i cr right) = quad quad (2) cr
          & = left( matrix
          k + 1/2 cr
          k cr right)quad quad (3) cr
          $$

          where:

          1) for the identity above;

          2) replacing the sum upper bound with the first b., the lower bound is implicit in the second b.;

          3) using the "double convolution" formula for binomials.






          share|cite|improve this answer









          $endgroup$



          In another way, using the duplication formula for Gamma
          $$
          Gamma left( 2,z right) = 2^,2,z - 1 over sqrt pi Gamma left( z right)Gamma left( z + 1/2 right)
          = 2^,2,z - 1 Gamma left( z right)Gamma left( z + 1/2 right) over Gamma left( 1/2 right)
          $$

          we have
          $$
          1 over 4^,i binom2ii
          = 1 over 4^,i Gamma left( 2left( i + 1/2 right) right) over Gamma left( i + 1 right)^,2
          = Gamma left( i + 1/2 right) over Gamma left( 1/2 right)Gamma left( i + 1 right) = binomi-1/2i
          $$



          Then our sum is
          $$
          eqalign
          & sumlimits_i = 0^k 1 over 4^,i left( matrix
          2i cr
          i cr right) = cr
          & = sumlimits_i = 0^k left( matrix
          i - 1/2 cr
          i cr right) = quad quad (1) cr
          & = sumlimits_i left( matrix
          k - i cr
          k - i cr right)left( matrix
          i - 1/2 cr
          i cr right) = quad quad (2) cr
          & = left( matrix
          k + 1/2 cr
          k cr right)quad quad (3) cr
          $$

          where:

          1) for the identity above;

          2) replacing the sum upper bound with the first b., the lower bound is implicit in the second b.;

          3) using the "double convolution" formula for binomials.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 4 hours ago









          G CabG Cab

          20.9k31342




          20.9k31342











          • $begingroup$
            Very nice approach. (+1)
            $endgroup$
            – Markus Scheuer
            4 hours ago
















          • $begingroup$
            Very nice approach. (+1)
            $endgroup$
            – Markus Scheuer
            4 hours ago















          $begingroup$
          Very nice approach. (+1)
          $endgroup$
          – Markus Scheuer
          4 hours ago




          $begingroup$
          Very nice approach. (+1)
          $endgroup$
          – Markus Scheuer
          4 hours ago

















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3237320%2fvalue-of-a-binomial-series%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

          ParseJSON using SSJSUsing AMPscript with SSJS ActivitiesHow to resubscribe a user in Marketing cloud using SSJS?Pulling Subscriber Status from Lists using SSJSRetrieving Emails using SSJSProblem in updating DE using SSJSUsing SSJS to send single email in Marketing CloudError adding EmailSendDefinition using SSJS

          Кампала Садржај Географија Географија Историја Становништво Привреда Партнерски градови Референце Спољашње везе Мени за навигацију0°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.340°11′ СГШ; 32°20′ ИГД / 0.18° СГШ; 32.34° ИГД / 0.18; 32.34МедијиПодациЗванични веб-сајту

          19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу