conjecture $sum_{k=1}^{infty}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{1}{pi}$
$begingroup$
A conjecture:
$$sum_{k=1}^{infty}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{1}{pi}$$
Can anybody numerically verify if this is anywhere near to the the claim answer?
update:
wolfram's calculator shows that it is true. How can we proves it?
sequences-and-series
$endgroup$
add a comment |
$begingroup$
A conjecture:
$$sum_{k=1}^{infty}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{1}{pi}$$
Can anybody numerically verify if this is anywhere near to the the claim answer?
update:
wolfram's calculator shows that it is true. How can we proves it?
sequences-and-series
$endgroup$
1
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
1
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12
add a comment |
$begingroup$
A conjecture:
$$sum_{k=1}^{infty}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{1}{pi}$$
Can anybody numerically verify if this is anywhere near to the the claim answer?
update:
wolfram's calculator shows that it is true. How can we proves it?
sequences-and-series
$endgroup$
A conjecture:
$$sum_{k=1}^{infty}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{1}{pi}$$
Can anybody numerically verify if this is anywhere near to the the claim answer?
update:
wolfram's calculator shows that it is true. How can we proves it?
sequences-and-series
sequences-and-series
edited Dec 29 '18 at 8:40
Endgame
asked Dec 29 '18 at 7:46
EndgameEndgame
1
1
1
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
1
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12
add a comment |
1
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
1
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12
1
1
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
1
1
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Using $(7)$ and $(9)$ from this answer, we get
$$
begin{align}
sum_{k=1}^inftyfrac{binom{2k}{k}^2}{2^{4k}}frac{k}{(2k-1)^2}
&=sum_{k=0}^inftyfrac{binom{2k}{k}^2}{16^k}left(color{#00F}{frac{1/2}{(2k-1)^2}}color{#090}{+frac{1/2}{2k-1}}right)\
&=left(color{#00F}{frac2pi}color{#090}{-frac1pi}right)\[6pt]
&=frac1pi
end{align}
$$
$endgroup$
add a comment |
$begingroup$
Not only it is true but we can also get the partial sum
$$S_p=sum_{k=1}^{p}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{ p, (p+1)^2 }{2^{4 p+2},(2 p+1)^2}binom{2p+2}{p+1}^2$$
Taking logarithms and using Stirling approximation
$$log(S_p)=-log (pi )-frac{1}{4 p}+frac{1}{96 p^3}+Oleft(frac{1}{p^5}right)$$ Continuing with Taylor
$$S_p=e^{log(S_p)}=frac 1 pi left(1-frac{1}{4 p}+frac{1}{32 p^2}+frac{1}{128 p^3}-frac{5}{2048
p^4}+Oleft(frac{1}{p^5}right)right)$$
For example
$$S_{10}=frac{10667118605}{34359738368}approx 0.3104540113$$ while the above expansion would give
$$S_{10} approx frac 1 pi frac{3994911}{4096000}approx 0.3104540200$$
$endgroup$
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%2f3055632%2fconjecture-sum-k-1-infty2k-choose-k2-frack24k2k-12-frac1%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Using $(7)$ and $(9)$ from this answer, we get
$$
begin{align}
sum_{k=1}^inftyfrac{binom{2k}{k}^2}{2^{4k}}frac{k}{(2k-1)^2}
&=sum_{k=0}^inftyfrac{binom{2k}{k}^2}{16^k}left(color{#00F}{frac{1/2}{(2k-1)^2}}color{#090}{+frac{1/2}{2k-1}}right)\
&=left(color{#00F}{frac2pi}color{#090}{-frac1pi}right)\[6pt]
&=frac1pi
end{align}
$$
$endgroup$
add a comment |
$begingroup$
Using $(7)$ and $(9)$ from this answer, we get
$$
begin{align}
sum_{k=1}^inftyfrac{binom{2k}{k}^2}{2^{4k}}frac{k}{(2k-1)^2}
&=sum_{k=0}^inftyfrac{binom{2k}{k}^2}{16^k}left(color{#00F}{frac{1/2}{(2k-1)^2}}color{#090}{+frac{1/2}{2k-1}}right)\
&=left(color{#00F}{frac2pi}color{#090}{-frac1pi}right)\[6pt]
&=frac1pi
end{align}
$$
$endgroup$
add a comment |
$begingroup$
Using $(7)$ and $(9)$ from this answer, we get
$$
begin{align}
sum_{k=1}^inftyfrac{binom{2k}{k}^2}{2^{4k}}frac{k}{(2k-1)^2}
&=sum_{k=0}^inftyfrac{binom{2k}{k}^2}{16^k}left(color{#00F}{frac{1/2}{(2k-1)^2}}color{#090}{+frac{1/2}{2k-1}}right)\
&=left(color{#00F}{frac2pi}color{#090}{-frac1pi}right)\[6pt]
&=frac1pi
end{align}
$$
$endgroup$
Using $(7)$ and $(9)$ from this answer, we get
$$
begin{align}
sum_{k=1}^inftyfrac{binom{2k}{k}^2}{2^{4k}}frac{k}{(2k-1)^2}
&=sum_{k=0}^inftyfrac{binom{2k}{k}^2}{16^k}left(color{#00F}{frac{1/2}{(2k-1)^2}}color{#090}{+frac{1/2}{2k-1}}right)\
&=left(color{#00F}{frac2pi}color{#090}{-frac1pi}right)\[6pt]
&=frac1pi
end{align}
$$
answered Dec 30 '18 at 22:49
robjohn♦robjohn
271k27316643
271k27316643
add a comment |
add a comment |
$begingroup$
Not only it is true but we can also get the partial sum
$$S_p=sum_{k=1}^{p}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{ p, (p+1)^2 }{2^{4 p+2},(2 p+1)^2}binom{2p+2}{p+1}^2$$
Taking logarithms and using Stirling approximation
$$log(S_p)=-log (pi )-frac{1}{4 p}+frac{1}{96 p^3}+Oleft(frac{1}{p^5}right)$$ Continuing with Taylor
$$S_p=e^{log(S_p)}=frac 1 pi left(1-frac{1}{4 p}+frac{1}{32 p^2}+frac{1}{128 p^3}-frac{5}{2048
p^4}+Oleft(frac{1}{p^5}right)right)$$
For example
$$S_{10}=frac{10667118605}{34359738368}approx 0.3104540113$$ while the above expansion would give
$$S_{10} approx frac 1 pi frac{3994911}{4096000}approx 0.3104540200$$
$endgroup$
add a comment |
$begingroup$
Not only it is true but we can also get the partial sum
$$S_p=sum_{k=1}^{p}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{ p, (p+1)^2 }{2^{4 p+2},(2 p+1)^2}binom{2p+2}{p+1}^2$$
Taking logarithms and using Stirling approximation
$$log(S_p)=-log (pi )-frac{1}{4 p}+frac{1}{96 p^3}+Oleft(frac{1}{p^5}right)$$ Continuing with Taylor
$$S_p=e^{log(S_p)}=frac 1 pi left(1-frac{1}{4 p}+frac{1}{32 p^2}+frac{1}{128 p^3}-frac{5}{2048
p^4}+Oleft(frac{1}{p^5}right)right)$$
For example
$$S_{10}=frac{10667118605}{34359738368}approx 0.3104540113$$ while the above expansion would give
$$S_{10} approx frac 1 pi frac{3994911}{4096000}approx 0.3104540200$$
$endgroup$
add a comment |
$begingroup$
Not only it is true but we can also get the partial sum
$$S_p=sum_{k=1}^{p}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{ p, (p+1)^2 }{2^{4 p+2},(2 p+1)^2}binom{2p+2}{p+1}^2$$
Taking logarithms and using Stirling approximation
$$log(S_p)=-log (pi )-frac{1}{4 p}+frac{1}{96 p^3}+Oleft(frac{1}{p^5}right)$$ Continuing with Taylor
$$S_p=e^{log(S_p)}=frac 1 pi left(1-frac{1}{4 p}+frac{1}{32 p^2}+frac{1}{128 p^3}-frac{5}{2048
p^4}+Oleft(frac{1}{p^5}right)right)$$
For example
$$S_{10}=frac{10667118605}{34359738368}approx 0.3104540113$$ while the above expansion would give
$$S_{10} approx frac 1 pi frac{3994911}{4096000}approx 0.3104540200$$
$endgroup$
Not only it is true but we can also get the partial sum
$$S_p=sum_{k=1}^{p}{2k choose k}^2frac{k}{2^{4k}(2k-1)^2}=frac{ p, (p+1)^2 }{2^{4 p+2},(2 p+1)^2}binom{2p+2}{p+1}^2$$
Taking logarithms and using Stirling approximation
$$log(S_p)=-log (pi )-frac{1}{4 p}+frac{1}{96 p^3}+Oleft(frac{1}{p^5}right)$$ Continuing with Taylor
$$S_p=e^{log(S_p)}=frac 1 pi left(1-frac{1}{4 p}+frac{1}{32 p^2}+frac{1}{128 p^3}-frac{5}{2048
p^4}+Oleft(frac{1}{p^5}right)right)$$
For example
$$S_{10}=frac{10667118605}{34359738368}approx 0.3104540113$$ while the above expansion would give
$$S_{10} approx frac 1 pi frac{3994911}{4096000}approx 0.3104540200$$
answered Dec 29 '18 at 9:22
Claude LeiboviciClaude Leibovici
126k1158135
126k1158135
add a comment |
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%2f3055632%2fconjecture-sum-k-1-infty2k-choose-k2-frack24k2k-12-frac1%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
1
$begingroup$
Sure, YOU can. Use any mathematical program (sage, maple, ...) or wolfram (which is online) to add the first 100 terms, and you can check if this makes sense.
$endgroup$
– A. Pongrácz
Dec 29 '18 at 7:49
$begingroup$
show me the program, i cant find it
$endgroup$
– Endgame
Dec 29 '18 at 7:53
1
$begingroup$
wolframalpha.com
$endgroup$
– A. Pongrácz
Dec 29 '18 at 8:01
$begingroup$
Wolfram says it's true, and not just numerically.
$endgroup$
– Ivan Neretin
Dec 29 '18 at 8:12