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
Did 20% of US soldiers in Vietnam use heroin, 95% of whom quit afterwards?
The art of clickbait captions
Ethical issue - how can I better document what is happening?
Of strange atmospheres - the survivable but unbreathable
Popcorn is the only acceptable snack to consume while watching a movie
What is the function of the corrugations on a section of the Space Shuttle's external tank?
Why are GND pads often only connected by four traces?
One-way train from Paris to Barcelona
Have 1.5% of all nuclear reactors ever built melted down?
What is a fully qualified name?
How should I introduce map drawing to my players?
Can my floppy disk still work without a shutter spring?
Best material to absorb as much light as possible
Why would Ryanair allow me to book this journey through a third party, but not through their own website?
Where's this lookout in Nova Scotia?
Value of a binomial series
USPS Back Room - Trespassing?
Can I connect my older mathematica front-end to the free wolfram engine?
Is it legal to meet with potential future employers in the UK, whilst visiting from the USA
Does pair production happen even when the photon is around a neutron?
Is the field of q-series 'dead'?
Apt - strange requests to d16r8ew072anqo.cloudfront.net:80
Why does Mjolnir fall down in Age of Ultron but not in Endgame?
How can I tell if I'm being too picky as a referee?
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
$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!
summation binomial-coefficients
$endgroup$
add a comment |
$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!
summation binomial-coefficients
$endgroup$
add a comment |
$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!
summation binomial-coefficients
$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
summation binomial-coefficients
asked 8 hours ago
Archis WelankarArchis Welankar
12.3k41742
12.3k41742
add a comment |
add a comment |
3 Answers
3
active
oldest
votes
$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.
New contributor
$endgroup$
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 hours ago
add a comment |
$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$.
$endgroup$
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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.
$endgroup$
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
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
);
);
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%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
$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.
New contributor
$endgroup$
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 hours ago
add a comment |
$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.
New contributor
$endgroup$
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 hours ago
add a comment |
$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.
New contributor
$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.
New contributor
edited 5 hours ago
darij grinberg
11.8k33268
11.8k33268
New contributor
answered 7 hours ago
auscryptauscrypt
1,3867
1,3867
New contributor
New contributor
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 hours ago
add a comment |
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 hours ago
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 hours ago
$begingroup$
+1 but the result wasn't known beforehand so I dont think induction can really help :)
$endgroup$
– Archis Welankar
6 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
6 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
6 hours ago
add a comment |
$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$.
$endgroup$
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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$.
$endgroup$
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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$.
$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$.
edited 4 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
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
the "coefficient of" method is always effective ! (+1)
$endgroup$
– G Cab
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
$begingroup$
@GCab: At least often useful. :-) Thanks for the credit.
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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.
$endgroup$
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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.
$endgroup$
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$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.
$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.
answered 3 hours ago
G CabG Cab
20.9k31342
20.9k31342
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
$begingroup$
Very nice approach. (+1)
$endgroup$
– Markus Scheuer
3 hours ago
add a comment |
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.
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%2f3237320%2fvalue-of-a-binomial-series%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