Is $2 sum_{n=m+2}^{infty}dfrac{1}{n^{alpha}} geq sum_{n=m+1}^{infty}dfrac{1}{n^{alpha}}$?
Working in a project I came across to the following problem, to investigate if the following inequality is true for $alpha>2,$ and $m$ a positive integer:
$$2 sum_{n=m+2}^{infty}dfrac{1}{n^{alpha}} geq sum_{n=m+1}^{infty}dfrac{1}{n^{alpha}}.$$
I have made some numerical experiments in Worfram which indicates that this is true, but I have no idea how to perform ao proof.
real-analysis complex-analysis number-theory numerical-methods zeta-functions
add a comment |
Working in a project I came across to the following problem, to investigate if the following inequality is true for $alpha>2,$ and $m$ a positive integer:
$$2 sum_{n=m+2}^{infty}dfrac{1}{n^{alpha}} geq sum_{n=m+1}^{infty}dfrac{1}{n^{alpha}}.$$
I have made some numerical experiments in Worfram which indicates that this is true, but I have no idea how to perform ao proof.
real-analysis complex-analysis number-theory numerical-methods zeta-functions
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18
add a comment |
Working in a project I came across to the following problem, to investigate if the following inequality is true for $alpha>2,$ and $m$ a positive integer:
$$2 sum_{n=m+2}^{infty}dfrac{1}{n^{alpha}} geq sum_{n=m+1}^{infty}dfrac{1}{n^{alpha}}.$$
I have made some numerical experiments in Worfram which indicates that this is true, but I have no idea how to perform ao proof.
real-analysis complex-analysis number-theory numerical-methods zeta-functions
Working in a project I came across to the following problem, to investigate if the following inequality is true for $alpha>2,$ and $m$ a positive integer:
$$2 sum_{n=m+2}^{infty}dfrac{1}{n^{alpha}} geq sum_{n=m+1}^{infty}dfrac{1}{n^{alpha}}.$$
I have made some numerical experiments in Worfram which indicates that this is true, but I have no idea how to perform ao proof.
real-analysis complex-analysis number-theory numerical-methods zeta-functions
real-analysis complex-analysis number-theory numerical-methods zeta-functions
asked Nov 30 at 0:14
Eduardo
553112
553112
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18
add a comment |
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18
add a comment |
2 Answers
2
active
oldest
votes
This is equivalent to just asking the question of whether
$$frac{1}{(m + 1)^{alpha}} le sum_{n = m + 2}^{infty} frac{1}{n^{alpha}}$$
or equivalently, whether
$$sum_{k = 2}^{infty} left(frac{m + 1}{m + k}right)^{alpha} ge 1$$
Now fix an exponent $alpha$. The summands are each increasing in $m$, tending towards $1$ as $m to infty$ (which immediately implies the desired inequality for $m$ large enough, depending on $alpha$); therefore, it is sufficient to study $m = 1$. We need to show that
$$2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} ge 1.$$
However, if $alpha$ is sufficiently large this does not hold: in fact,
$$lim_{alpha to infty} 2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} = 0.$$
So the punchline is that for each fixed $m$, this works if $alpha$ is small enough. And for each fixed $alpha$, it works if $m$ is large enough.
add a comment |
When $alpha = 4$ and $m=1$ you can do the sums in closed form:
$$
2 sum_{n=3}^infty frac{1}{n^4} - sum_{n=2}^infty frac{1}{n^4}
= frac{pi^4}{90}-frac98 < 0
$$
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%2f3019436%2fis-2-sum-n-m2-infty-dfrac1n-alpha-geq-sum-n-m1-infty-dfra%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
This is equivalent to just asking the question of whether
$$frac{1}{(m + 1)^{alpha}} le sum_{n = m + 2}^{infty} frac{1}{n^{alpha}}$$
or equivalently, whether
$$sum_{k = 2}^{infty} left(frac{m + 1}{m + k}right)^{alpha} ge 1$$
Now fix an exponent $alpha$. The summands are each increasing in $m$, tending towards $1$ as $m to infty$ (which immediately implies the desired inequality for $m$ large enough, depending on $alpha$); therefore, it is sufficient to study $m = 1$. We need to show that
$$2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} ge 1.$$
However, if $alpha$ is sufficiently large this does not hold: in fact,
$$lim_{alpha to infty} 2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} = 0.$$
So the punchline is that for each fixed $m$, this works if $alpha$ is small enough. And for each fixed $alpha$, it works if $m$ is large enough.
add a comment |
This is equivalent to just asking the question of whether
$$frac{1}{(m + 1)^{alpha}} le sum_{n = m + 2}^{infty} frac{1}{n^{alpha}}$$
or equivalently, whether
$$sum_{k = 2}^{infty} left(frac{m + 1}{m + k}right)^{alpha} ge 1$$
Now fix an exponent $alpha$. The summands are each increasing in $m$, tending towards $1$ as $m to infty$ (which immediately implies the desired inequality for $m$ large enough, depending on $alpha$); therefore, it is sufficient to study $m = 1$. We need to show that
$$2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} ge 1.$$
However, if $alpha$ is sufficiently large this does not hold: in fact,
$$lim_{alpha to infty} 2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} = 0.$$
So the punchline is that for each fixed $m$, this works if $alpha$ is small enough. And for each fixed $alpha$, it works if $m$ is large enough.
add a comment |
This is equivalent to just asking the question of whether
$$frac{1}{(m + 1)^{alpha}} le sum_{n = m + 2}^{infty} frac{1}{n^{alpha}}$$
or equivalently, whether
$$sum_{k = 2}^{infty} left(frac{m + 1}{m + k}right)^{alpha} ge 1$$
Now fix an exponent $alpha$. The summands are each increasing in $m$, tending towards $1$ as $m to infty$ (which immediately implies the desired inequality for $m$ large enough, depending on $alpha$); therefore, it is sufficient to study $m = 1$. We need to show that
$$2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} ge 1.$$
However, if $alpha$ is sufficiently large this does not hold: in fact,
$$lim_{alpha to infty} 2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} = 0.$$
So the punchline is that for each fixed $m$, this works if $alpha$ is small enough. And for each fixed $alpha$, it works if $m$ is large enough.
This is equivalent to just asking the question of whether
$$frac{1}{(m + 1)^{alpha}} le sum_{n = m + 2}^{infty} frac{1}{n^{alpha}}$$
or equivalently, whether
$$sum_{k = 2}^{infty} left(frac{m + 1}{m + k}right)^{alpha} ge 1$$
Now fix an exponent $alpha$. The summands are each increasing in $m$, tending towards $1$ as $m to infty$ (which immediately implies the desired inequality for $m$ large enough, depending on $alpha$); therefore, it is sufficient to study $m = 1$. We need to show that
$$2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} ge 1.$$
However, if $alpha$ is sufficiently large this does not hold: in fact,
$$lim_{alpha to infty} 2^{alpha} sum_{j = 3}^{infty} frac{1}{j^{alpha}} = 0.$$
So the punchline is that for each fixed $m$, this works if $alpha$ is small enough. And for each fixed $alpha$, it works if $m$ is large enough.
answered Nov 30 at 0:25
T. Bongers
22.8k54661
22.8k54661
add a comment |
add a comment |
When $alpha = 4$ and $m=1$ you can do the sums in closed form:
$$
2 sum_{n=3}^infty frac{1}{n^4} - sum_{n=2}^infty frac{1}{n^4}
= frac{pi^4}{90}-frac98 < 0
$$
add a comment |
When $alpha = 4$ and $m=1$ you can do the sums in closed form:
$$
2 sum_{n=3}^infty frac{1}{n^4} - sum_{n=2}^infty frac{1}{n^4}
= frac{pi^4}{90}-frac98 < 0
$$
add a comment |
When $alpha = 4$ and $m=1$ you can do the sums in closed form:
$$
2 sum_{n=3}^infty frac{1}{n^4} - sum_{n=2}^infty frac{1}{n^4}
= frac{pi^4}{90}-frac98 < 0
$$
When $alpha = 4$ and $m=1$ you can do the sums in closed form:
$$
2 sum_{n=3}^infty frac{1}{n^4} - sum_{n=2}^infty frac{1}{n^4}
= frac{pi^4}{90}-frac98 < 0
$$
edited Nov 30 at 1:13
answered Nov 30 at 0:42
Mark Fischler
32.3k12250
32.3k12250
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.
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%2f3019436%2fis-2-sum-n-m2-infty-dfrac1n-alpha-geq-sum-n-m1-infty-dfra%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
Please link to the numerical experiments. It might help.
– Shaun
Nov 30 at 0:18
Why are there two sums when you can cancel so many terms from the right?
– T_M
Nov 30 at 0:18