Compute the following limit, possibly using a Riemann Sum The 2019 Stack Overflow Developer Survey Results Are InIs it alright to substitute $0$ for $1/n$ in this limit problem?Evaluate limit of sumsLimit of a Riemann Sum and IntegralHelp calculating a riemann sumlimit of a sequence / riemann sumsFind and prove the limit of $X_n=$ $frac n^1001.01^n$Calculate limit using Riemann sumRiemann sum limitCan we find the limit of the sequence $a_n=frac1n^2+frac1(n+1)^2+frac1(n+2)^2+dots+frac1(2n)^2$ using Riemann sum?Find the limit of a sequence using Riemann sumProving the limit of the following sequenceEvaluate the limit by first recognizing the sum as a Riemann Sum for a function defined on $[0,1]$.
How to make payment on the internet without leaving a money trail?
Unbreakable Formation vs. Cry of the Carnarium
Why can Shazam do this?
Limit the amount of RAM Mathematica may access?
Can't find the latex code for the ⍎ (down tack jot) symbol
What could be the right powersource for 15 seconds lifespan disposable giant chainsaw?
I looked up a future colleague on linkedin before I started a job. I told my colleague about it and he seemed surprised. Should I apologize?
Lethal sonic weapons
What does "sndry explns" mean in one of the Hitchhiker's guide books?
A poker game description that does not feel gimmicky
Does it makes sense to buy a new cycle to learn riding?
It's possible to achieve negative score?
aging parents with no investments
Are there any other methods to apply to solving simultaneous equations?
Springs with some finite mass
Where does the "burst of radiance" from Holy Weapon originate?
How to manage monthly salary
Deadlock Graph and Interpretation, solution to avoid
Pristine Bit Checking
Should I write numbers in words or as symbols in this case?
I see my dog run
Carnot-Caratheodory metric
Why is the maximum length of openwrt’s root password 8 characters?
Fractional alignment
Compute the following limit, possibly using a Riemann Sum
The 2019 Stack Overflow Developer Survey Results Are InIs it alright to substitute $0$ for $1/n$ in this limit problem?Evaluate limit of sumsLimit of a Riemann Sum and IntegralHelp calculating a riemann sumlimit of a sequence / riemann sumsFind and prove the limit of $X_n=$ $frac n^1001.01^n$Calculate limit using Riemann sumRiemann sum limitCan we find the limit of the sequence $a_n=frac1n^2+frac1(n+1)^2+frac1(n+2)^2+dots+frac1(2n)^2$ using Riemann sum?Find the limit of a sequence using Riemann sumProving the limit of the following sequenceEvaluate the limit by first recognizing the sum as a Riemann Sum for a function defined on $[0,1]$.
$begingroup$
$$lim _nto infty sum _k=1^nfrac1n+k+frackn^2$$ I unsuccessfully tried to find two different Riemann Sums converging to the same value close to the given sum so I could use the Squeeze Theorem. Is there any other way to solve this?
calculus limits riemann-sum
$endgroup$
add a comment |
$begingroup$
$$lim _nto infty sum _k=1^nfrac1n+k+frackn^2$$ I unsuccessfully tried to find two different Riemann Sums converging to the same value close to the given sum so I could use the Squeeze Theorem. Is there any other way to solve this?
calculus limits riemann-sum
$endgroup$
$begingroup$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27
add a comment |
$begingroup$
$$lim _nto infty sum _k=1^nfrac1n+k+frackn^2$$ I unsuccessfully tried to find two different Riemann Sums converging to the same value close to the given sum so I could use the Squeeze Theorem. Is there any other way to solve this?
calculus limits riemann-sum
$endgroup$
$$lim _nto infty sum _k=1^nfrac1n+k+frackn^2$$ I unsuccessfully tried to find two different Riemann Sums converging to the same value close to the given sum so I could use the Squeeze Theorem. Is there any other way to solve this?
calculus limits riemann-sum
calculus limits riemann-sum
asked Mar 1 '18 at 17:46
user528021user528021
1879
1879
$begingroup$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27
add a comment |
$begingroup$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27
$begingroup$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27
add a comment |
5 Answers
5
active
oldest
votes
$begingroup$
It is easy to see that
$$ beginalign
left |sum_k=1^n frac1n+k+k/n^2-sum_k=1^n frac1n+kright|&=frac1n^2sum_k=1^n frack(n+k+k/n^2)(n+k)\\
&le frac1n^2sum_k=1^n frac1ktag 1
endalign$$
Then, using $sum_k=1^nfrac1k =gamma+log(n) +Oleft(frac1nright)$, we see that the limit of the left-hand side of $(1)$ as $nto infty$ is $0$.
Can you finish now?
$endgroup$
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
add a comment |
$begingroup$
Writing this as
$$lim_n to inftyS_nn = lim_n to inftyfrac1nsum _k=1^nfrac11+frackn+fracknfrac1n^2
$$
a technique that often works is to evaluate the double limit
$$lim_m to infty lim_n to infty S_mn = lim_m to infty lim_n to infty frac1nsum _k=1^nfrac11+frackn+fracknfrac1m^2 = lim_m to inftyint_0^1 fracdx1 +x + x/m^2 = int_0^1 fracdx1 +x
$$
where the last step is justified by DCT.
We can justify $ lim_n to infty S_nn = lim_m to infty lim_n to infty S_mn = log 2$ by showing one of the iterated limits exhibits uniform convergence.
An example with more details is given here. The argument for justifying the use of the double limit in this case will be similar.
$endgroup$
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
add a comment |
$begingroup$
$newcommandbbx[1],bbox[15px,border:1px groove navy]displaystyle#1,
newcommandbraces[1]leftlbrace,#1,rightrbrace
newcommandbracks[1]leftlbrack,#1,rightrbrack
newcommandddmathrmd
newcommandds[1]displaystyle#1
newcommandexpo[1],mathrme^#1,
newcommandicmathrmi
newcommandmc[1]mathcal#1
newcommandmrm[1]mathrm#1
newcommandpars[1]left(,#1,right)
newcommandpartiald[3][]fracpartial^#1 #2partial #3^#1
newcommandroot[2][],sqrt[#1],#2,,
newcommandtotald[3][]fracmathrmd^#1 #2mathrmd #3^#1
newcommandverts[1]leftvert,#1,rightvert$
beginalign
&bbox[10px,#ffd]lim _n to infty sum _k = 1^n1 over n + k + k/n^2 =
lim _n to infty bracksn^2 over n^2 + 1
sum _k = 1^n1 over k + n^3/parsn^2 + 1
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
sum _k = 1^inftybracks1 over k + n^3/parsn^2 + 1 -
1 over k + n^3/parsn^2 + 1 + n
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
bracksH_large n^3/parsn^2 + 1 + n -
H_large n^3/parsn^2 + 1
endalign
where $dsH_z$ is a Harmonic Number.
In using the
$dsH_z$ asymptotic behavior as $dsvertsz to infty$, it's straightforward found:
$$
bbxlim _n to infty sum _k = 1^n1 over n + k + k/n^2 = lnpars2
$$
$endgroup$
add a comment |
$begingroup$
I thought it might be instructive to present a method that relies only on the squeeze theorem. To that end, we proceed.
First, it is trivial to see that
$$sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+ktag 1$$
Second, note that we have
$$beginalign
sum_k=1^n frac1n+k+k/n^2&=sum_k=1^n frac1(n+k)left(1+frack/n^2n+kright)\\
&ge sum_k=1^n frac1(n+k)left(1-frack/n^2n+kright)\\
&ge left(1-frac1n^2right)sum_k=1^n frac1n+ktag2
endalign$$
Putting $(1)$ and $(2)$ together reveals
$$left(1-frac1n^2right)sum_k=1^n frac1n+kle sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+k$$
whence application of the squeeze theorem yields the coveted limit
$$lim_nto inftysum_k=1^n frac1n+k+k/n^2=log(2)$$
as expected!
$endgroup$
add a comment |
$begingroup$
The sum under limit is not a Riemann sum, but it differs from a Riemann sum by negligible amount.
To setup things let's note that by definition of Riemann integral we have $$int_0^1f(x),dx=lim_ntoinfty frac1nsum_k=1^nf(t_k),,frack-1nleq t_kleq frack n $$ It is easy to guess that the function $f$ involved here is given by $f(x) =1/(1+x)$ and let's choose $$t_1=0,t_k=frack-1n+frack-1n^3,k=2,3dots,n$$ The corresponding Riemann sum is $$S_n=frac1n+frac1nsum_k=2^ndfrac11+dfrack-1n+dfrack-1n^3$$ which can be rewritten as $$S_n=frac1n+sum_k=1^n-1frac1n+k+(k/n^2)$$ If the sum in question is denoted by $S'_n$ then we can see that $$S_n-S'_n=frac1n-frac1n+n+(1/n^2)$$ and clearly the above expression tends to $0$ as $ntoinfty $. The Riemann sum $S_n$ tends to $int_0^1dx/(1+x)=log 2$ and hence the given sum $S'_n$ also tends to $log 2$.
The same technique has been used in this answer in a simpler manner.
$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%2f2672497%2fcompute-the-following-limit-possibly-using-a-riemann-sum%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
5 Answers
5
active
oldest
votes
5 Answers
5
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
It is easy to see that
$$ beginalign
left |sum_k=1^n frac1n+k+k/n^2-sum_k=1^n frac1n+kright|&=frac1n^2sum_k=1^n frack(n+k+k/n^2)(n+k)\\
&le frac1n^2sum_k=1^n frac1ktag 1
endalign$$
Then, using $sum_k=1^nfrac1k =gamma+log(n) +Oleft(frac1nright)$, we see that the limit of the left-hand side of $(1)$ as $nto infty$ is $0$.
Can you finish now?
$endgroup$
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
add a comment |
$begingroup$
It is easy to see that
$$ beginalign
left |sum_k=1^n frac1n+k+k/n^2-sum_k=1^n frac1n+kright|&=frac1n^2sum_k=1^n frack(n+k+k/n^2)(n+k)\\
&le frac1n^2sum_k=1^n frac1ktag 1
endalign$$
Then, using $sum_k=1^nfrac1k =gamma+log(n) +Oleft(frac1nright)$, we see that the limit of the left-hand side of $(1)$ as $nto infty$ is $0$.
Can you finish now?
$endgroup$
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
add a comment |
$begingroup$
It is easy to see that
$$ beginalign
left |sum_k=1^n frac1n+k+k/n^2-sum_k=1^n frac1n+kright|&=frac1n^2sum_k=1^n frack(n+k+k/n^2)(n+k)\\
&le frac1n^2sum_k=1^n frac1ktag 1
endalign$$
Then, using $sum_k=1^nfrac1k =gamma+log(n) +Oleft(frac1nright)$, we see that the limit of the left-hand side of $(1)$ as $nto infty$ is $0$.
Can you finish now?
$endgroup$
It is easy to see that
$$ beginalign
left |sum_k=1^n frac1n+k+k/n^2-sum_k=1^n frac1n+kright|&=frac1n^2sum_k=1^n frack(n+k+k/n^2)(n+k)\\
&le frac1n^2sum_k=1^n frac1ktag 1
endalign$$
Then, using $sum_k=1^nfrac1k =gamma+log(n) +Oleft(frac1nright)$, we see that the limit of the left-hand side of $(1)$ as $nto infty$ is $0$.
Can you finish now?
answered Mar 1 '18 at 18:52
Mark ViolaMark Viola
134k1278177
134k1278177
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
add a comment |
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
Mark: Good approach to show the $k/n^2$ is negligible -- which is what this is about.
$endgroup$
– RRL
Mar 1 '18 at 19:01
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
$begingroup$
@RRL Indeed, although your methd extends beyond just its application to the problem at hand. Another approach, is to factor $n+k$ out of the denominator and bound the term $frac11+k/(n^2(n+k))$ on both sides then apply the squeeze theorem.
$endgroup$
– Mark Viola
Mar 1 '18 at 19:11
add a comment |
$begingroup$
Writing this as
$$lim_n to inftyS_nn = lim_n to inftyfrac1nsum _k=1^nfrac11+frackn+fracknfrac1n^2
$$
a technique that often works is to evaluate the double limit
$$lim_m to infty lim_n to infty S_mn = lim_m to infty lim_n to infty frac1nsum _k=1^nfrac11+frackn+fracknfrac1m^2 = lim_m to inftyint_0^1 fracdx1 +x + x/m^2 = int_0^1 fracdx1 +x
$$
where the last step is justified by DCT.
We can justify $ lim_n to infty S_nn = lim_m to infty lim_n to infty S_mn = log 2$ by showing one of the iterated limits exhibits uniform convergence.
An example with more details is given here. The argument for justifying the use of the double limit in this case will be similar.
$endgroup$
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
add a comment |
$begingroup$
Writing this as
$$lim_n to inftyS_nn = lim_n to inftyfrac1nsum _k=1^nfrac11+frackn+fracknfrac1n^2
$$
a technique that often works is to evaluate the double limit
$$lim_m to infty lim_n to infty S_mn = lim_m to infty lim_n to infty frac1nsum _k=1^nfrac11+frackn+fracknfrac1m^2 = lim_m to inftyint_0^1 fracdx1 +x + x/m^2 = int_0^1 fracdx1 +x
$$
where the last step is justified by DCT.
We can justify $ lim_n to infty S_nn = lim_m to infty lim_n to infty S_mn = log 2$ by showing one of the iterated limits exhibits uniform convergence.
An example with more details is given here. The argument for justifying the use of the double limit in this case will be similar.
$endgroup$
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
add a comment |
$begingroup$
Writing this as
$$lim_n to inftyS_nn = lim_n to inftyfrac1nsum _k=1^nfrac11+frackn+fracknfrac1n^2
$$
a technique that often works is to evaluate the double limit
$$lim_m to infty lim_n to infty S_mn = lim_m to infty lim_n to infty frac1nsum _k=1^nfrac11+frackn+fracknfrac1m^2 = lim_m to inftyint_0^1 fracdx1 +x + x/m^2 = int_0^1 fracdx1 +x
$$
where the last step is justified by DCT.
We can justify $ lim_n to infty S_nn = lim_m to infty lim_n to infty S_mn = log 2$ by showing one of the iterated limits exhibits uniform convergence.
An example with more details is given here. The argument for justifying the use of the double limit in this case will be similar.
$endgroup$
Writing this as
$$lim_n to inftyS_nn = lim_n to inftyfrac1nsum _k=1^nfrac11+frackn+fracknfrac1n^2
$$
a technique that often works is to evaluate the double limit
$$lim_m to infty lim_n to infty S_mn = lim_m to infty lim_n to infty frac1nsum _k=1^nfrac11+frackn+fracknfrac1m^2 = lim_m to inftyint_0^1 fracdx1 +x + x/m^2 = int_0^1 fracdx1 +x
$$
where the last step is justified by DCT.
We can justify $ lim_n to infty S_nn = lim_m to infty lim_n to infty S_mn = log 2$ by showing one of the iterated limits exhibits uniform convergence.
An example with more details is given here. The argument for justifying the use of the double limit in this case will be similar.
edited Mar 1 '18 at 18:23
answered Mar 1 '18 at 18:01
RRLRRL
53.5k52574
53.5k52574
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
add a comment |
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
$begingroup$
This is pretty brilliant! Had never seen this technique.
$endgroup$
– Fimpellizieri
Mar 1 '18 at 18:03
2
2
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
@Fimpellizieri: Here is an example with the full justification. Thanks.
$endgroup$
– RRL
Mar 1 '18 at 18:12
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
$begingroup$
Well done. And the general result is more powerful than its application here. I posted a solution with a simpler way forward. Let me know your thoughts.
$endgroup$
– Mark Viola
Mar 1 '18 at 18:57
add a comment |
$begingroup$
$newcommandbbx[1],bbox[15px,border:1px groove navy]displaystyle#1,
newcommandbraces[1]leftlbrace,#1,rightrbrace
newcommandbracks[1]leftlbrack,#1,rightrbrack
newcommandddmathrmd
newcommandds[1]displaystyle#1
newcommandexpo[1],mathrme^#1,
newcommandicmathrmi
newcommandmc[1]mathcal#1
newcommandmrm[1]mathrm#1
newcommandpars[1]left(,#1,right)
newcommandpartiald[3][]fracpartial^#1 #2partial #3^#1
newcommandroot[2][],sqrt[#1],#2,,
newcommandtotald[3][]fracmathrmd^#1 #2mathrmd #3^#1
newcommandverts[1]leftvert,#1,rightvert$
beginalign
&bbox[10px,#ffd]lim _n to infty sum _k = 1^n1 over n + k + k/n^2 =
lim _n to infty bracksn^2 over n^2 + 1
sum _k = 1^n1 over k + n^3/parsn^2 + 1
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
sum _k = 1^inftybracks1 over k + n^3/parsn^2 + 1 -
1 over k + n^3/parsn^2 + 1 + n
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
bracksH_large n^3/parsn^2 + 1 + n -
H_large n^3/parsn^2 + 1
endalign
where $dsH_z$ is a Harmonic Number.
In using the
$dsH_z$ asymptotic behavior as $dsvertsz to infty$, it's straightforward found:
$$
bbxlim _n to infty sum _k = 1^n1 over n + k + k/n^2 = lnpars2
$$
$endgroup$
add a comment |
$begingroup$
$newcommandbbx[1],bbox[15px,border:1px groove navy]displaystyle#1,
newcommandbraces[1]leftlbrace,#1,rightrbrace
newcommandbracks[1]leftlbrack,#1,rightrbrack
newcommandddmathrmd
newcommandds[1]displaystyle#1
newcommandexpo[1],mathrme^#1,
newcommandicmathrmi
newcommandmc[1]mathcal#1
newcommandmrm[1]mathrm#1
newcommandpars[1]left(,#1,right)
newcommandpartiald[3][]fracpartial^#1 #2partial #3^#1
newcommandroot[2][],sqrt[#1],#2,,
newcommandtotald[3][]fracmathrmd^#1 #2mathrmd #3^#1
newcommandverts[1]leftvert,#1,rightvert$
beginalign
&bbox[10px,#ffd]lim _n to infty sum _k = 1^n1 over n + k + k/n^2 =
lim _n to infty bracksn^2 over n^2 + 1
sum _k = 1^n1 over k + n^3/parsn^2 + 1
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
sum _k = 1^inftybracks1 over k + n^3/parsn^2 + 1 -
1 over k + n^3/parsn^2 + 1 + n
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
bracksH_large n^3/parsn^2 + 1 + n -
H_large n^3/parsn^2 + 1
endalign
where $dsH_z$ is a Harmonic Number.
In using the
$dsH_z$ asymptotic behavior as $dsvertsz to infty$, it's straightforward found:
$$
bbxlim _n to infty sum _k = 1^n1 over n + k + k/n^2 = lnpars2
$$
$endgroup$
add a comment |
$begingroup$
$newcommandbbx[1],bbox[15px,border:1px groove navy]displaystyle#1,
newcommandbraces[1]leftlbrace,#1,rightrbrace
newcommandbracks[1]leftlbrack,#1,rightrbrack
newcommandddmathrmd
newcommandds[1]displaystyle#1
newcommandexpo[1],mathrme^#1,
newcommandicmathrmi
newcommandmc[1]mathcal#1
newcommandmrm[1]mathrm#1
newcommandpars[1]left(,#1,right)
newcommandpartiald[3][]fracpartial^#1 #2partial #3^#1
newcommandroot[2][],sqrt[#1],#2,,
newcommandtotald[3][]fracmathrmd^#1 #2mathrmd #3^#1
newcommandverts[1]leftvert,#1,rightvert$
beginalign
&bbox[10px,#ffd]lim _n to infty sum _k = 1^n1 over n + k + k/n^2 =
lim _n to infty bracksn^2 over n^2 + 1
sum _k = 1^n1 over k + n^3/parsn^2 + 1
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
sum _k = 1^inftybracks1 over k + n^3/parsn^2 + 1 -
1 over k + n^3/parsn^2 + 1 + n
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
bracksH_large n^3/parsn^2 + 1 + n -
H_large n^3/parsn^2 + 1
endalign
where $dsH_z$ is a Harmonic Number.
In using the
$dsH_z$ asymptotic behavior as $dsvertsz to infty$, it's straightforward found:
$$
bbxlim _n to infty sum _k = 1^n1 over n + k + k/n^2 = lnpars2
$$
$endgroup$
$newcommandbbx[1],bbox[15px,border:1px groove navy]displaystyle#1,
newcommandbraces[1]leftlbrace,#1,rightrbrace
newcommandbracks[1]leftlbrack,#1,rightrbrack
newcommandddmathrmd
newcommandds[1]displaystyle#1
newcommandexpo[1],mathrme^#1,
newcommandicmathrmi
newcommandmc[1]mathcal#1
newcommandmrm[1]mathrm#1
newcommandpars[1]left(,#1,right)
newcommandpartiald[3][]fracpartial^#1 #2partial #3^#1
newcommandroot[2][],sqrt[#1],#2,,
newcommandtotald[3][]fracmathrmd^#1 #2mathrmd #3^#1
newcommandverts[1]leftvert,#1,rightvert$
beginalign
&bbox[10px,#ffd]lim _n to infty sum _k = 1^n1 over n + k + k/n^2 =
lim _n to infty bracksn^2 over n^2 + 1
sum _k = 1^n1 over k + n^3/parsn^2 + 1
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
sum _k = 1^inftybracks1 over k + n^3/parsn^2 + 1 -
1 over k + n^3/parsn^2 + 1 + n
\[5mm] = &
lim _n to infty bracesn^2 over n^2 + 1
bracksH_large n^3/parsn^2 + 1 + n -
H_large n^3/parsn^2 + 1
endalign
where $dsH_z$ is a Harmonic Number.
In using the
$dsH_z$ asymptotic behavior as $dsvertsz to infty$, it's straightforward found:
$$
bbxlim _n to infty sum _k = 1^n1 over n + k + k/n^2 = lnpars2
$$
edited Mar 30 at 4:50
answered Mar 1 '18 at 20:42
Felix MarinFelix Marin
68.9k7110147
68.9k7110147
add a comment |
add a comment |
$begingroup$
I thought it might be instructive to present a method that relies only on the squeeze theorem. To that end, we proceed.
First, it is trivial to see that
$$sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+ktag 1$$
Second, note that we have
$$beginalign
sum_k=1^n frac1n+k+k/n^2&=sum_k=1^n frac1(n+k)left(1+frack/n^2n+kright)\\
&ge sum_k=1^n frac1(n+k)left(1-frack/n^2n+kright)\\
&ge left(1-frac1n^2right)sum_k=1^n frac1n+ktag2
endalign$$
Putting $(1)$ and $(2)$ together reveals
$$left(1-frac1n^2right)sum_k=1^n frac1n+kle sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+k$$
whence application of the squeeze theorem yields the coveted limit
$$lim_nto inftysum_k=1^n frac1n+k+k/n^2=log(2)$$
as expected!
$endgroup$
add a comment |
$begingroup$
I thought it might be instructive to present a method that relies only on the squeeze theorem. To that end, we proceed.
First, it is trivial to see that
$$sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+ktag 1$$
Second, note that we have
$$beginalign
sum_k=1^n frac1n+k+k/n^2&=sum_k=1^n frac1(n+k)left(1+frack/n^2n+kright)\\
&ge sum_k=1^n frac1(n+k)left(1-frack/n^2n+kright)\\
&ge left(1-frac1n^2right)sum_k=1^n frac1n+ktag2
endalign$$
Putting $(1)$ and $(2)$ together reveals
$$left(1-frac1n^2right)sum_k=1^n frac1n+kle sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+k$$
whence application of the squeeze theorem yields the coveted limit
$$lim_nto inftysum_k=1^n frac1n+k+k/n^2=log(2)$$
as expected!
$endgroup$
add a comment |
$begingroup$
I thought it might be instructive to present a method that relies only on the squeeze theorem. To that end, we proceed.
First, it is trivial to see that
$$sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+ktag 1$$
Second, note that we have
$$beginalign
sum_k=1^n frac1n+k+k/n^2&=sum_k=1^n frac1(n+k)left(1+frack/n^2n+kright)\\
&ge sum_k=1^n frac1(n+k)left(1-frack/n^2n+kright)\\
&ge left(1-frac1n^2right)sum_k=1^n frac1n+ktag2
endalign$$
Putting $(1)$ and $(2)$ together reveals
$$left(1-frac1n^2right)sum_k=1^n frac1n+kle sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+k$$
whence application of the squeeze theorem yields the coveted limit
$$lim_nto inftysum_k=1^n frac1n+k+k/n^2=log(2)$$
as expected!
$endgroup$
I thought it might be instructive to present a method that relies only on the squeeze theorem. To that end, we proceed.
First, it is trivial to see that
$$sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+ktag 1$$
Second, note that we have
$$beginalign
sum_k=1^n frac1n+k+k/n^2&=sum_k=1^n frac1(n+k)left(1+frack/n^2n+kright)\\
&ge sum_k=1^n frac1(n+k)left(1-frack/n^2n+kright)\\
&ge left(1-frac1n^2right)sum_k=1^n frac1n+ktag2
endalign$$
Putting $(1)$ and $(2)$ together reveals
$$left(1-frac1n^2right)sum_k=1^n frac1n+kle sum_k=1^n frac1n+k+k/n^2le sum_k=1^n frac1n+k$$
whence application of the squeeze theorem yields the coveted limit
$$lim_nto inftysum_k=1^n frac1n+k+k/n^2=log(2)$$
as expected!
answered Mar 1 '18 at 20:58
Mark ViolaMark Viola
134k1278177
134k1278177
add a comment |
add a comment |
$begingroup$
The sum under limit is not a Riemann sum, but it differs from a Riemann sum by negligible amount.
To setup things let's note that by definition of Riemann integral we have $$int_0^1f(x),dx=lim_ntoinfty frac1nsum_k=1^nf(t_k),,frack-1nleq t_kleq frack n $$ It is easy to guess that the function $f$ involved here is given by $f(x) =1/(1+x)$ and let's choose $$t_1=0,t_k=frack-1n+frack-1n^3,k=2,3dots,n$$ The corresponding Riemann sum is $$S_n=frac1n+frac1nsum_k=2^ndfrac11+dfrack-1n+dfrack-1n^3$$ which can be rewritten as $$S_n=frac1n+sum_k=1^n-1frac1n+k+(k/n^2)$$ If the sum in question is denoted by $S'_n$ then we can see that $$S_n-S'_n=frac1n-frac1n+n+(1/n^2)$$ and clearly the above expression tends to $0$ as $ntoinfty $. The Riemann sum $S_n$ tends to $int_0^1dx/(1+x)=log 2$ and hence the given sum $S'_n$ also tends to $log 2$.
The same technique has been used in this answer in a simpler manner.
$endgroup$
add a comment |
$begingroup$
The sum under limit is not a Riemann sum, but it differs from a Riemann sum by negligible amount.
To setup things let's note that by definition of Riemann integral we have $$int_0^1f(x),dx=lim_ntoinfty frac1nsum_k=1^nf(t_k),,frack-1nleq t_kleq frack n $$ It is easy to guess that the function $f$ involved here is given by $f(x) =1/(1+x)$ and let's choose $$t_1=0,t_k=frack-1n+frack-1n^3,k=2,3dots,n$$ The corresponding Riemann sum is $$S_n=frac1n+frac1nsum_k=2^ndfrac11+dfrack-1n+dfrack-1n^3$$ which can be rewritten as $$S_n=frac1n+sum_k=1^n-1frac1n+k+(k/n^2)$$ If the sum in question is denoted by $S'_n$ then we can see that $$S_n-S'_n=frac1n-frac1n+n+(1/n^2)$$ and clearly the above expression tends to $0$ as $ntoinfty $. The Riemann sum $S_n$ tends to $int_0^1dx/(1+x)=log 2$ and hence the given sum $S'_n$ also tends to $log 2$.
The same technique has been used in this answer in a simpler manner.
$endgroup$
add a comment |
$begingroup$
The sum under limit is not a Riemann sum, but it differs from a Riemann sum by negligible amount.
To setup things let's note that by definition of Riemann integral we have $$int_0^1f(x),dx=lim_ntoinfty frac1nsum_k=1^nf(t_k),,frack-1nleq t_kleq frack n $$ It is easy to guess that the function $f$ involved here is given by $f(x) =1/(1+x)$ and let's choose $$t_1=0,t_k=frack-1n+frack-1n^3,k=2,3dots,n$$ The corresponding Riemann sum is $$S_n=frac1n+frac1nsum_k=2^ndfrac11+dfrack-1n+dfrack-1n^3$$ which can be rewritten as $$S_n=frac1n+sum_k=1^n-1frac1n+k+(k/n^2)$$ If the sum in question is denoted by $S'_n$ then we can see that $$S_n-S'_n=frac1n-frac1n+n+(1/n^2)$$ and clearly the above expression tends to $0$ as $ntoinfty $. The Riemann sum $S_n$ tends to $int_0^1dx/(1+x)=log 2$ and hence the given sum $S'_n$ also tends to $log 2$.
The same technique has been used in this answer in a simpler manner.
$endgroup$
The sum under limit is not a Riemann sum, but it differs from a Riemann sum by negligible amount.
To setup things let's note that by definition of Riemann integral we have $$int_0^1f(x),dx=lim_ntoinfty frac1nsum_k=1^nf(t_k),,frack-1nleq t_kleq frack n $$ It is easy to guess that the function $f$ involved here is given by $f(x) =1/(1+x)$ and let's choose $$t_1=0,t_k=frack-1n+frack-1n^3,k=2,3dots,n$$ The corresponding Riemann sum is $$S_n=frac1n+frac1nsum_k=2^ndfrac11+dfrack-1n+dfrack-1n^3$$ which can be rewritten as $$S_n=frac1n+sum_k=1^n-1frac1n+k+(k/n^2)$$ If the sum in question is denoted by $S'_n$ then we can see that $$S_n-S'_n=frac1n-frac1n+n+(1/n^2)$$ and clearly the above expression tends to $0$ as $ntoinfty $. The Riemann sum $S_n$ tends to $int_0^1dx/(1+x)=log 2$ and hence the given sum $S'_n$ also tends to $log 2$.
The same technique has been used in this answer in a simpler manner.
edited Mar 31 at 3:11
answered Mar 31 at 3:04
Paramanand SinghParamanand Singh
51.3k559170
51.3k559170
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%2f2672497%2fcompute-the-following-limit-possibly-using-a-riemann-sum%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$
Wolfram Alpha says $ln 2$.
$endgroup$
– RRL
Mar 1 '18 at 18:10
$begingroup$
Your answer is nice. Liked it.
$endgroup$
– King Tut
Mar 1 '18 at 18:27