How to show divergence of $sum_{n = 1}^{infty} 2^{-o(1)}frac{1}{n}$?
$begingroup$
I am trying to show the divergence of the following sum:
$$sum_{n = 1}^{infty} 2^{-o(1)}frac{1}{n}$$
where the exponent of the 2 is negative little-o of 1. I have tried some ideas such as the following:
since $o(1)$ means that $lim_{n rightarrow infty} f(n)/1 rightarrow 0$, then we can potentially look at $max_n f(n)$ and $min_n f(n)$ and use those to bound the term $2^{-o(1)}$ in the sum, but I'm not sure how to handle functions $f(n)$ that oscillate. Any thoughts are appreciated!
sequences-and-series analysis computational-complexity
$endgroup$
add a comment |
$begingroup$
I am trying to show the divergence of the following sum:
$$sum_{n = 1}^{infty} 2^{-o(1)}frac{1}{n}$$
where the exponent of the 2 is negative little-o of 1. I have tried some ideas such as the following:
since $o(1)$ means that $lim_{n rightarrow infty} f(n)/1 rightarrow 0$, then we can potentially look at $max_n f(n)$ and $min_n f(n)$ and use those to bound the term $2^{-o(1)}$ in the sum, but I'm not sure how to handle functions $f(n)$ that oscillate. Any thoughts are appreciated!
sequences-and-series analysis computational-complexity
$endgroup$
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59
add a comment |
$begingroup$
I am trying to show the divergence of the following sum:
$$sum_{n = 1}^{infty} 2^{-o(1)}frac{1}{n}$$
where the exponent of the 2 is negative little-o of 1. I have tried some ideas such as the following:
since $o(1)$ means that $lim_{n rightarrow infty} f(n)/1 rightarrow 0$, then we can potentially look at $max_n f(n)$ and $min_n f(n)$ and use those to bound the term $2^{-o(1)}$ in the sum, but I'm not sure how to handle functions $f(n)$ that oscillate. Any thoughts are appreciated!
sequences-and-series analysis computational-complexity
$endgroup$
I am trying to show the divergence of the following sum:
$$sum_{n = 1}^{infty} 2^{-o(1)}frac{1}{n}$$
where the exponent of the 2 is negative little-o of 1. I have tried some ideas such as the following:
since $o(1)$ means that $lim_{n rightarrow infty} f(n)/1 rightarrow 0$, then we can potentially look at $max_n f(n)$ and $min_n f(n)$ and use those to bound the term $2^{-o(1)}$ in the sum, but I'm not sure how to handle functions $f(n)$ that oscillate. Any thoughts are appreciated!
sequences-and-series analysis computational-complexity
sequences-and-series analysis computational-complexity
edited Dec 10 '18 at 21:58
hologram
asked Dec 10 '18 at 21:43
hologramhologram
14312
14312
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59
add a comment |
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If $f(n)=o(1)$, by definition, for some $epsilon>0$, you will find an $N$ such that
$$n>Nimplies|f(n)|<epsilonimplies 2^{-f(n)}>2^{-epsilon}.$$
Then the tail of the sum diverges as it is bounded below by an harmonic series.
$endgroup$
add a comment |
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%2f3034527%2fhow-to-show-divergence-of-sum-n-1-infty-2-o1-frac1n%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If $f(n)=o(1)$, by definition, for some $epsilon>0$, you will find an $N$ such that
$$n>Nimplies|f(n)|<epsilonimplies 2^{-f(n)}>2^{-epsilon}.$$
Then the tail of the sum diverges as it is bounded below by an harmonic series.
$endgroup$
add a comment |
$begingroup$
If $f(n)=o(1)$, by definition, for some $epsilon>0$, you will find an $N$ such that
$$n>Nimplies|f(n)|<epsilonimplies 2^{-f(n)}>2^{-epsilon}.$$
Then the tail of the sum diverges as it is bounded below by an harmonic series.
$endgroup$
add a comment |
$begingroup$
If $f(n)=o(1)$, by definition, for some $epsilon>0$, you will find an $N$ such that
$$n>Nimplies|f(n)|<epsilonimplies 2^{-f(n)}>2^{-epsilon}.$$
Then the tail of the sum diverges as it is bounded below by an harmonic series.
$endgroup$
If $f(n)=o(1)$, by definition, for some $epsilon>0$, you will find an $N$ such that
$$n>Nimplies|f(n)|<epsilonimplies 2^{-f(n)}>2^{-epsilon}.$$
Then the tail of the sum diverges as it is bounded below by an harmonic series.
edited Dec 10 '18 at 22:08
answered Dec 10 '18 at 21:55
Yves DaoustYves Daoust
127k673226
127k673226
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%2f3034527%2fhow-to-show-divergence-of-sum-n-1-infty-2-o1-frac1n%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
$begingroup$
An $o(1)$ function cannot oscillate wildly.
$endgroup$
– Yves Daoust
Dec 10 '18 at 21:56
$begingroup$
apologies I have fixed that in the question
$endgroup$
– hologram
Dec 10 '18 at 21:59