sum of $sum_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1)$











up vote
-1
down vote

favorite












Is there any way to analytically find the sum of an infinite series if the infinite series is not geometric, nor can it be set up as residues for a convenient meromorphic function?



For instance, if I have the function
$f(x)=1+sum_{n=1}^{infty}(-1)^{n+1}(x^{1/n}-1)$, I have a function of x that will converge conditionally for all $xgeq1$, because it is an alternating series where the limit of terms converges to zero. However, I don't see any way of solving the sum using residues.



Are there any other methods to attempt to find the value of the series (and therefore of $f(x)$)?










share|cite|improve this question









New contributor




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




















  • You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
    – rtybase
    Nov 21 at 13:36












  • @rtybase: How does that help?
    – MoKo19
    Nov 21 at 13:46










  • E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
    – rtybase
    Nov 21 at 14:02















up vote
-1
down vote

favorite












Is there any way to analytically find the sum of an infinite series if the infinite series is not geometric, nor can it be set up as residues for a convenient meromorphic function?



For instance, if I have the function
$f(x)=1+sum_{n=1}^{infty}(-1)^{n+1}(x^{1/n}-1)$, I have a function of x that will converge conditionally for all $xgeq1$, because it is an alternating series where the limit of terms converges to zero. However, I don't see any way of solving the sum using residues.



Are there any other methods to attempt to find the value of the series (and therefore of $f(x)$)?










share|cite|improve this question









New contributor




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




















  • You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
    – rtybase
    Nov 21 at 13:36












  • @rtybase: How does that help?
    – MoKo19
    Nov 21 at 13:46










  • E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
    – rtybase
    Nov 21 at 14:02













up vote
-1
down vote

favorite









up vote
-1
down vote

favorite











Is there any way to analytically find the sum of an infinite series if the infinite series is not geometric, nor can it be set up as residues for a convenient meromorphic function?



For instance, if I have the function
$f(x)=1+sum_{n=1}^{infty}(-1)^{n+1}(x^{1/n}-1)$, I have a function of x that will converge conditionally for all $xgeq1$, because it is an alternating series where the limit of terms converges to zero. However, I don't see any way of solving the sum using residues.



Are there any other methods to attempt to find the value of the series (and therefore of $f(x)$)?










share|cite|improve this question









New contributor




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











Is there any way to analytically find the sum of an infinite series if the infinite series is not geometric, nor can it be set up as residues for a convenient meromorphic function?



For instance, if I have the function
$f(x)=1+sum_{n=1}^{infty}(-1)^{n+1}(x^{1/n}-1)$, I have a function of x that will converge conditionally for all $xgeq1$, because it is an alternating series where the limit of terms converges to zero. However, I don't see any way of solving the sum using residues.



Are there any other methods to attempt to find the value of the series (and therefore of $f(x)$)?







sequences-and-series






share|cite|improve this question









New contributor




MoKo19 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 question









New contributor




MoKo19 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 question




share|cite|improve this question








edited Nov 21 at 11:22









Tianlalu

2,674632




2,674632






New contributor




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









asked Nov 21 at 11:14









MoKo19

813




813




New contributor




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





New contributor





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






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












  • You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
    – rtybase
    Nov 21 at 13:36












  • @rtybase: How does that help?
    – MoKo19
    Nov 21 at 13:46










  • E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
    – rtybase
    Nov 21 at 14:02


















  • You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
    – rtybase
    Nov 21 at 13:36












  • @rtybase: How does that help?
    – MoKo19
    Nov 21 at 13:46










  • E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
    – rtybase
    Nov 21 at 14:02
















You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
– rtybase
Nov 21 at 13:36






You can definitely approximate it using the fact that $$lim_{x to 0} left( frac{a^x - 1}{x} right) = ln{a}, qquad forall~a > 0$$
– rtybase
Nov 21 at 13:36














@rtybase: How does that help?
– MoKo19
Nov 21 at 13:46




@rtybase: How does that help?
– MoKo19
Nov 21 at 13:46












E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
– rtybase
Nov 21 at 14:02




E.g. $$sumlimits_{n=1}^{infty}(-1)^{n+1}(2^{1/n}-1) approx sum_{n=1}^{N(varepsilon)}(-1)^{n+1}(2^{1/n}-1)+ln{2}left(sum_{n=N(varepsilon)+1}^{infty}(-1)^{n+1}frac{1}{n}right)$$
– rtybase
Nov 21 at 14:02















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',
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
});


}
});






MoKo19 is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007575%2fsum-of-sum-n-1-infty-1n121-n-1%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes








MoKo19 is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















MoKo19 is a new contributor. Be nice, and check out our Code of Conduct.













MoKo19 is a new contributor. Be nice, and check out our Code of Conduct.












MoKo19 is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007575%2fsum-of-sum-n-1-infty-1n121-n-1%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

To store a contact into the json file from server.js file using a class in NodeJS

Redirect URL with Chrome Remote Debugging Android Devices

Dieringhausen