Numerical evaluation of $sum_{N=1}^inftyleft(frac{1}{Gamma(N+1)^2}right)^{frac{1}{N}}$
Given
$$S=sum_{N=1}^inftyleft(dfrac{1}{Gamma(N+1)^2}right)^{dfrac{1}{N}}$$
Using the Carleman inequality, I got for S:
$$Sledfrac{1}{6}epi^2$$
Using numerical calculation I suppose that the value of
S is less than $3.2$.
Is it possible to have a better vaule or eventually a better iniquality for S?
sequences-and-series inequality gamma-function
add a comment |
Given
$$S=sum_{N=1}^inftyleft(dfrac{1}{Gamma(N+1)^2}right)^{dfrac{1}{N}}$$
Using the Carleman inequality, I got for S:
$$Sledfrac{1}{6}epi^2$$
Using numerical calculation I suppose that the value of
S is less than $3.2$.
Is it possible to have a better vaule or eventually a better iniquality for S?
sequences-and-series inequality gamma-function
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32
add a comment |
Given
$$S=sum_{N=1}^inftyleft(dfrac{1}{Gamma(N+1)^2}right)^{dfrac{1}{N}}$$
Using the Carleman inequality, I got for S:
$$Sledfrac{1}{6}epi^2$$
Using numerical calculation I suppose that the value of
S is less than $3.2$.
Is it possible to have a better vaule or eventually a better iniquality for S?
sequences-and-series inequality gamma-function
Given
$$S=sum_{N=1}^inftyleft(dfrac{1}{Gamma(N+1)^2}right)^{dfrac{1}{N}}$$
Using the Carleman inequality, I got for S:
$$Sledfrac{1}{6}epi^2$$
Using numerical calculation I suppose that the value of
S is less than $3.2$.
Is it possible to have a better vaule or eventually a better iniquality for S?
sequences-and-series inequality gamma-function
sequences-and-series inequality gamma-function
edited Nov 27 at 11:44
GNUSupporter 8964民主女神 地下教會
12.8k72445
12.8k72445
asked Nov 27 at 11:28
Riccardo.Alestra
5,93412153
5,93412153
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32
add a comment |
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32
add a comment |
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',
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%2f3015668%2fnumerical-evaluation-of-sum-n-1-infty-left-frac1-gamman12-right%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3015668%2fnumerical-evaluation-of-sum-n-1-infty-left-frac1-gamman12-right%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
$3.096724440$ is better
– Claude Leibovici
Nov 27 at 11:44
I have changed the formatting of the title so as to make it take up less vertical space -- this is a policy to ensure that the scarce space on the main page is distributed evenly over the questions. See here for more information. Please take this into consideration for future questions. Thanks in advance.
– GNUSupporter 8964民主女神 地下教會
Nov 27 at 11:45
PARI/GP easily eats $texttt{sumnum(n=1,exp(-2*lngamma(n+1)/n))}$ giving $3.09672480007969548412482407485480297466758470220341ldots$
– metamorphy
Nov 27 at 12:32