How to show $lim_{ntoinfty}nleft{sum_{k=1}^nfrac{1}{(n+k)^2}right}=frac{1}{2}$
Show that $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=dfrac{1}{2}.$$
Proof:
We can rewrite $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=lim_{ntoinfty}nBigg{sum_{k=1}^ndfrac{1}{(n+k)^2}Bigg}$$
Which looks astoundingly similar to the form in Corollary 8.3, where $dfrac{b-a}{n} = nimplies b-a = 2n$.
Corollary 8.3: Let $f$ be a continuous function on an interval [a,b]. Then $$int_a^bf(x)dx=lim_{ntoinfty}dfrac{b-a}{n}sum_{k=0}^{n-1}fBigg(a+dfrac{k}{n}(b-a)Bigg)$$
That would mean the term in Corollary 8.3 would morph into
$$fleft(a+dfrac{k}{n}(b-a)right)=fleft((b-2n)+dfrac{k}{n}(2n)right)=f(b-2n+2k)$$
We need $f(b-2n+2k)$ to look like $dfrac{1}{(n+k)^2}$. This would imply that $f$ is
... but then I get stuck. I am unsure how to find $f$ or even if I need to find $f$.
real-analysis limits summation riemann-sum
add a comment |
Show that $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=dfrac{1}{2}.$$
Proof:
We can rewrite $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=lim_{ntoinfty}nBigg{sum_{k=1}^ndfrac{1}{(n+k)^2}Bigg}$$
Which looks astoundingly similar to the form in Corollary 8.3, where $dfrac{b-a}{n} = nimplies b-a = 2n$.
Corollary 8.3: Let $f$ be a continuous function on an interval [a,b]. Then $$int_a^bf(x)dx=lim_{ntoinfty}dfrac{b-a}{n}sum_{k=0}^{n-1}fBigg(a+dfrac{k}{n}(b-a)Bigg)$$
That would mean the term in Corollary 8.3 would morph into
$$fleft(a+dfrac{k}{n}(b-a)right)=fleft((b-2n)+dfrac{k}{n}(2n)right)=f(b-2n+2k)$$
We need $f(b-2n+2k)$ to look like $dfrac{1}{(n+k)^2}$. This would imply that $f$ is
... but then I get stuck. I am unsure how to find $f$ or even if I need to find $f$.
real-analysis limits summation riemann-sum
6
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
3
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59
add a comment |
Show that $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=dfrac{1}{2}.$$
Proof:
We can rewrite $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=lim_{ntoinfty}nBigg{sum_{k=1}^ndfrac{1}{(n+k)^2}Bigg}$$
Which looks astoundingly similar to the form in Corollary 8.3, where $dfrac{b-a}{n} = nimplies b-a = 2n$.
Corollary 8.3: Let $f$ be a continuous function on an interval [a,b]. Then $$int_a^bf(x)dx=lim_{ntoinfty}dfrac{b-a}{n}sum_{k=0}^{n-1}fBigg(a+dfrac{k}{n}(b-a)Bigg)$$
That would mean the term in Corollary 8.3 would morph into
$$fleft(a+dfrac{k}{n}(b-a)right)=fleft((b-2n)+dfrac{k}{n}(2n)right)=f(b-2n+2k)$$
We need $f(b-2n+2k)$ to look like $dfrac{1}{(n+k)^2}$. This would imply that $f$ is
... but then I get stuck. I am unsure how to find $f$ or even if I need to find $f$.
real-analysis limits summation riemann-sum
Show that $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=dfrac{1}{2}.$$
Proof:
We can rewrite $$lim_{ntoinfty}nBigg{dfrac{1}{(n+1)^2}+dfrac{1}{(n+2)^2}+dfrac{1}{(n+3)^2}+cdots+dfrac{1}{(2n)^2}Bigg}=lim_{ntoinfty}nBigg{sum_{k=1}^ndfrac{1}{(n+k)^2}Bigg}$$
Which looks astoundingly similar to the form in Corollary 8.3, where $dfrac{b-a}{n} = nimplies b-a = 2n$.
Corollary 8.3: Let $f$ be a continuous function on an interval [a,b]. Then $$int_a^bf(x)dx=lim_{ntoinfty}dfrac{b-a}{n}sum_{k=0}^{n-1}fBigg(a+dfrac{k}{n}(b-a)Bigg)$$
That would mean the term in Corollary 8.3 would morph into
$$fleft(a+dfrac{k}{n}(b-a)right)=fleft((b-2n)+dfrac{k}{n}(2n)right)=f(b-2n+2k)$$
We need $f(b-2n+2k)$ to look like $dfrac{1}{(n+k)^2}$. This would imply that $f$ is
... but then I get stuck. I am unsure how to find $f$ or even if I need to find $f$.
real-analysis limits summation riemann-sum
real-analysis limits summation riemann-sum
edited Dec 5 '18 at 11:13
Lorenzo B.
1,8402520
1,8402520
asked Dec 5 '18 at 10:47
kaisakaisa
1019
1019
6
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
3
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59
add a comment |
6
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
3
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59
6
6
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
3
3
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59
add a comment |
2 Answers
2
active
oldest
votes
HINT
By Riemann's sum
$$lim_{ntoinfty}nsum_{k=1}^ndfrac{1}{(n+k)^2}=lim_{ntoinfty}frac1nsum_{k=1}^ndfrac{1}{(1+k/n)^2}$$
Refer also to the related
- Perfect understanding of Riemann Sums
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
add a comment |
Another approach is to consider that the same result is obtained by the series
$$lim_{ntoinfty}{sum_{k=1}^ndfrac{n}{(n+k)(n+k+1)}}$$
Proof: the difference of the two terms is $O(n^{-2})$, $O(n^{-1})$ after the summation.
And then to use
$$frac{1}{(n+k)(n+k+1)} = frac{1}{n+k} - frac{1}{n+k+1} $$
Which simplifies the summation ...
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%2f3026928%2fhow-to-show-lim-n-to-inftyn-left-sum-k-1n-frac1nk2-right-fra%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
HINT
By Riemann's sum
$$lim_{ntoinfty}nsum_{k=1}^ndfrac{1}{(n+k)^2}=lim_{ntoinfty}frac1nsum_{k=1}^ndfrac{1}{(1+k/n)^2}$$
Refer also to the related
- Perfect understanding of Riemann Sums
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
add a comment |
HINT
By Riemann's sum
$$lim_{ntoinfty}nsum_{k=1}^ndfrac{1}{(n+k)^2}=lim_{ntoinfty}frac1nsum_{k=1}^ndfrac{1}{(1+k/n)^2}$$
Refer also to the related
- Perfect understanding of Riemann Sums
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
add a comment |
HINT
By Riemann's sum
$$lim_{ntoinfty}nsum_{k=1}^ndfrac{1}{(n+k)^2}=lim_{ntoinfty}frac1nsum_{k=1}^ndfrac{1}{(1+k/n)^2}$$
Refer also to the related
- Perfect understanding of Riemann Sums
HINT
By Riemann's sum
$$lim_{ntoinfty}nsum_{k=1}^ndfrac{1}{(n+k)^2}=lim_{ntoinfty}frac1nsum_{k=1}^ndfrac{1}{(1+k/n)^2}$$
Refer also to the related
- Perfect understanding of Riemann Sums
answered Dec 5 '18 at 10:52
gimusigimusi
1
1
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
add a comment |
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
But then I get to here: $lim_{ntoinfty}dfrac{n}{n}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}=lim_{ntoinfty}Bigg{sum_{k=1}^ndfrac{1}{(1+(k/n))^2}Bigg}$, which is infinity. EDIT: Ah I see. I forgot to square.
– kaisa
Dec 5 '18 at 11:09
add a comment |
Another approach is to consider that the same result is obtained by the series
$$lim_{ntoinfty}{sum_{k=1}^ndfrac{n}{(n+k)(n+k+1)}}$$
Proof: the difference of the two terms is $O(n^{-2})$, $O(n^{-1})$ after the summation.
And then to use
$$frac{1}{(n+k)(n+k+1)} = frac{1}{n+k} - frac{1}{n+k+1} $$
Which simplifies the summation ...
add a comment |
Another approach is to consider that the same result is obtained by the series
$$lim_{ntoinfty}{sum_{k=1}^ndfrac{n}{(n+k)(n+k+1)}}$$
Proof: the difference of the two terms is $O(n^{-2})$, $O(n^{-1})$ after the summation.
And then to use
$$frac{1}{(n+k)(n+k+1)} = frac{1}{n+k} - frac{1}{n+k+1} $$
Which simplifies the summation ...
add a comment |
Another approach is to consider that the same result is obtained by the series
$$lim_{ntoinfty}{sum_{k=1}^ndfrac{n}{(n+k)(n+k+1)}}$$
Proof: the difference of the two terms is $O(n^{-2})$, $O(n^{-1})$ after the summation.
And then to use
$$frac{1}{(n+k)(n+k+1)} = frac{1}{n+k} - frac{1}{n+k+1} $$
Which simplifies the summation ...
Another approach is to consider that the same result is obtained by the series
$$lim_{ntoinfty}{sum_{k=1}^ndfrac{n}{(n+k)(n+k+1)}}$$
Proof: the difference of the two terms is $O(n^{-2})$, $O(n^{-1})$ after the summation.
And then to use
$$frac{1}{(n+k)(n+k+1)} = frac{1}{n+k} - frac{1}{n+k+1} $$
Which simplifies the summation ...
answered Dec 5 '18 at 11:24
DamienDamien
52714
52714
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%2f3026928%2fhow-to-show-lim-n-to-inftyn-left-sum-k-1n-frac1nk2-right-fra%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
6
Ah yes, the famous Corollary 8.3. I love that corollary
– mathworker21
Dec 5 '18 at 10:49
3
Should we all know what Corollary 8.3 is?
– José Carlos Santos
Dec 5 '18 at 10:49
@mathworker21 Ooops. I added it now. Thank you.
– kaisa
Dec 5 '18 at 10:58
See math.stackexchange.com/questions/469885/…
– lab bhattacharjee
Dec 5 '18 at 10:59