Calculate $limlimits_ntoinftysumlimits_0leqslant kleqslant2nfrac kk+n^2$ using Riemann sums
Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
$$lim_ntoinftysumlimits_0leqslantkleqslant2n frackk+n^2$$
I can't figure out the "right" function for this limit. The previous problem was very similar except there was $k^2$ in the denominator, and it wasn't difficult to recognize the Riemann sum for $f(x)=fracxx^2+1$.
Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$.
limits definite-integrals riemann-sum
 |Â
show 4 more comments
up vote
2
down vote
favorite
$$lim_ntoinftysumlimits_0leqslantkleqslant2n frackk+n^2$$
I can't figure out the "right" function for this limit. The previous problem was very similar except there was $k^2$ in the denominator, and it wasn't difficult to recognize the Riemann sum for $f(x)=fracxx^2+1$.
Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$.
limits definite-integrals riemann-sum
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
No. Check your computations.
â Did
Aug 22 at 11:31
 |Â
show 4 more comments
up vote
2
down vote
favorite
up vote
2
down vote
favorite
$$lim_ntoinftysumlimits_0leqslantkleqslant2n frackk+n^2$$
I can't figure out the "right" function for this limit. The previous problem was very similar except there was $k^2$ in the denominator, and it wasn't difficult to recognize the Riemann sum for $f(x)=fracxx^2+1$.
Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$.
limits definite-integrals riemann-sum
$$lim_ntoinftysumlimits_0leqslantkleqslant2n frackk+n^2$$
I can't figure out the "right" function for this limit. The previous problem was very similar except there was $k^2$ in the denominator, and it wasn't difficult to recognize the Riemann sum for $f(x)=fracxx^2+1$.
Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$.
limits definite-integrals riemann-sum
edited Aug 22 at 11:20
Did
243k23208443
243k23208443
asked Aug 22 at 9:52
Timur Sharapov
234
234
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
No. Check your computations.
â Did
Aug 22 at 11:31
 |Â
show 4 more comments
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
No. Check your computations.
â Did
Aug 22 at 11:31
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
No. Check your computations.
â Did
Aug 22 at 11:31
No. Check your computations.
â Did
Aug 22 at 11:31
 |Â
show 4 more comments
2 Answers
2
active
oldest
votes
up vote
2
down vote
Write the sum as
$$S_nn = frac1nsum_k=0^2n frack/n1 + k/n^2$$
This is not in the form of a Riemann sum. However, there is a trick (requiring justification) where we can reduce the limit to that of a Riemann sum by viewing this in terms of a double sequence
$$S_nm = frac1nsum_k=0^2n frack/n1 + (k/n)(1/m)$$
Clearly, $displaystylelim_m to infty S_nm = frac1nsum_k=0^2n frackn.,$ As the convergence can be shown to be uniform for all $n$, by a well-known theorem for double sequences, we can evaluate as an iterated limit,
$$lim_n to infty S_nn = lim_n to infty lim_m to infty S_nm = lim_n to infty frac1nsum_k=0^2n frackn = int_0^2 x , dx = 2.$$
Justification: Uniform convergence of inner limit
Note that
$$left|frac1nsum_k=0^2n frack/n1 + (k/n)(1/m) - frac1nsum_k=0^2n frackn right|= frac1nsum_k=0^2nfrac(k/n)^2(1/m)1 + (k/n)(1/m) \ leqslant frac1nmsum_k=0^2nleft(fracknright)^2 leqslant frac2n nmleft(frac2nn right)^2 = frac8m$$
add a comment |Â
up vote
0
down vote
Edited after reading the comments.
No need for Riemann sums.
Lower bound:
$$
sum_k=0^2nfrackk+n^2gefrac12,n+n^2sum_k=0^2nk=fracn,(2,n+1)2,n+n^2.
$$
Upper boud:
$$
sum_k=0^2nfrackk+n^2lefrac1n^2sum_k=0^2nk=fracn,(2,n+1)n^2.
$$
However, Riemann sums can be used, but in a more complicated way:
$$
sum_k=0^2nfrackk+n^2=2,n,Bigl(frac12,nsum_k=0^2nfrack/(2,n)k/(2,n)+n/2Bigr)
sim2,nint_0^1fracx,dxx+n/2.
$$
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
Write the sum as
$$S_nn = frac1nsum_k=0^2n frack/n1 + k/n^2$$
This is not in the form of a Riemann sum. However, there is a trick (requiring justification) where we can reduce the limit to that of a Riemann sum by viewing this in terms of a double sequence
$$S_nm = frac1nsum_k=0^2n frack/n1 + (k/n)(1/m)$$
Clearly, $displaystylelim_m to infty S_nm = frac1nsum_k=0^2n frackn.,$ As the convergence can be shown to be uniform for all $n$, by a well-known theorem for double sequences, we can evaluate as an iterated limit,
$$lim_n to infty S_nn = lim_n to infty lim_m to infty S_nm = lim_n to infty frac1nsum_k=0^2n frackn = int_0^2 x , dx = 2.$$
Justification: Uniform convergence of inner limit
Note that
$$left|frac1nsum_k=0^2n frack/n1 + (k/n)(1/m) - frac1nsum_k=0^2n frackn right|= frac1nsum_k=0^2nfrac(k/n)^2(1/m)1 + (k/n)(1/m) \ leqslant frac1nmsum_k=0^2nleft(fracknright)^2 leqslant frac2n nmleft(frac2nn right)^2 = frac8m$$
add a comment |Â
up vote
2
down vote
Write the sum as
$$S_nn = frac1nsum_k=0^2n frack/n1 + k/n^2$$
This is not in the form of a Riemann sum. However, there is a trick (requiring justification) where we can reduce the limit to that of a Riemann sum by viewing this in terms of a double sequence
$$S_nm = frac1nsum_k=0^2n frack/n1 + (k/n)(1/m)$$
Clearly, $displaystylelim_m to infty S_nm = frac1nsum_k=0^2n frackn.,$ As the convergence can be shown to be uniform for all $n$, by a well-known theorem for double sequences, we can evaluate as an iterated limit,
$$lim_n to infty S_nn = lim_n to infty lim_m to infty S_nm = lim_n to infty frac1nsum_k=0^2n frackn = int_0^2 x , dx = 2.$$
Justification: Uniform convergence of inner limit
Note that
$$left|frac1nsum_k=0^2n frack/n1 + (k/n)(1/m) - frac1nsum_k=0^2n frackn right|= frac1nsum_k=0^2nfrac(k/n)^2(1/m)1 + (k/n)(1/m) \ leqslant frac1nmsum_k=0^2nleft(fracknright)^2 leqslant frac2n nmleft(frac2nn right)^2 = frac8m$$
add a comment |Â
up vote
2
down vote
up vote
2
down vote
Write the sum as
$$S_nn = frac1nsum_k=0^2n frack/n1 + k/n^2$$
This is not in the form of a Riemann sum. However, there is a trick (requiring justification) where we can reduce the limit to that of a Riemann sum by viewing this in terms of a double sequence
$$S_nm = frac1nsum_k=0^2n frack/n1 + (k/n)(1/m)$$
Clearly, $displaystylelim_m to infty S_nm = frac1nsum_k=0^2n frackn.,$ As the convergence can be shown to be uniform for all $n$, by a well-known theorem for double sequences, we can evaluate as an iterated limit,
$$lim_n to infty S_nn = lim_n to infty lim_m to infty S_nm = lim_n to infty frac1nsum_k=0^2n frackn = int_0^2 x , dx = 2.$$
Justification: Uniform convergence of inner limit
Note that
$$left|frac1nsum_k=0^2n frack/n1 + (k/n)(1/m) - frac1nsum_k=0^2n frackn right|= frac1nsum_k=0^2nfrac(k/n)^2(1/m)1 + (k/n)(1/m) \ leqslant frac1nmsum_k=0^2nleft(fracknright)^2 leqslant frac2n nmleft(frac2nn right)^2 = frac8m$$
Write the sum as
$$S_nn = frac1nsum_k=0^2n frack/n1 + k/n^2$$
This is not in the form of a Riemann sum. However, there is a trick (requiring justification) where we can reduce the limit to that of a Riemann sum by viewing this in terms of a double sequence
$$S_nm = frac1nsum_k=0^2n frack/n1 + (k/n)(1/m)$$
Clearly, $displaystylelim_m to infty S_nm = frac1nsum_k=0^2n frackn.,$ As the convergence can be shown to be uniform for all $n$, by a well-known theorem for double sequences, we can evaluate as an iterated limit,
$$lim_n to infty S_nn = lim_n to infty lim_m to infty S_nm = lim_n to infty frac1nsum_k=0^2n frackn = int_0^2 x , dx = 2.$$
Justification: Uniform convergence of inner limit
Note that
$$left|frac1nsum_k=0^2n frack/n1 + (k/n)(1/m) - frac1nsum_k=0^2n frackn right|= frac1nsum_k=0^2nfrac(k/n)^2(1/m)1 + (k/n)(1/m) \ leqslant frac1nmsum_k=0^2nleft(fracknright)^2 leqslant frac2n nmleft(frac2nn right)^2 = frac8m$$
edited Aug 23 at 8:06
answered Aug 23 at 7:36
RRL
44.2k42362
44.2k42362
add a comment |Â
add a comment |Â
up vote
0
down vote
Edited after reading the comments.
No need for Riemann sums.
Lower bound:
$$
sum_k=0^2nfrackk+n^2gefrac12,n+n^2sum_k=0^2nk=fracn,(2,n+1)2,n+n^2.
$$
Upper boud:
$$
sum_k=0^2nfrackk+n^2lefrac1n^2sum_k=0^2nk=fracn,(2,n+1)n^2.
$$
However, Riemann sums can be used, but in a more complicated way:
$$
sum_k=0^2nfrackk+n^2=2,n,Bigl(frac12,nsum_k=0^2nfrack/(2,n)k/(2,n)+n/2Bigr)
sim2,nint_0^1fracx,dxx+n/2.
$$
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
add a comment |Â
up vote
0
down vote
Edited after reading the comments.
No need for Riemann sums.
Lower bound:
$$
sum_k=0^2nfrackk+n^2gefrac12,n+n^2sum_k=0^2nk=fracn,(2,n+1)2,n+n^2.
$$
Upper boud:
$$
sum_k=0^2nfrackk+n^2lefrac1n^2sum_k=0^2nk=fracn,(2,n+1)n^2.
$$
However, Riemann sums can be used, but in a more complicated way:
$$
sum_k=0^2nfrackk+n^2=2,n,Bigl(frac12,nsum_k=0^2nfrack/(2,n)k/(2,n)+n/2Bigr)
sim2,nint_0^1fracx,dxx+n/2.
$$
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Edited after reading the comments.
No need for Riemann sums.
Lower bound:
$$
sum_k=0^2nfrackk+n^2gefrac12,n+n^2sum_k=0^2nk=fracn,(2,n+1)2,n+n^2.
$$
Upper boud:
$$
sum_k=0^2nfrackk+n^2lefrac1n^2sum_k=0^2nk=fracn,(2,n+1)n^2.
$$
However, Riemann sums can be used, but in a more complicated way:
$$
sum_k=0^2nfrackk+n^2=2,n,Bigl(frac12,nsum_k=0^2nfrack/(2,n)k/(2,n)+n/2Bigr)
sim2,nint_0^1fracx,dxx+n/2.
$$
Edited after reading the comments.
No need for Riemann sums.
Lower bound:
$$
sum_k=0^2nfrackk+n^2gefrac12,n+n^2sum_k=0^2nk=fracn,(2,n+1)2,n+n^2.
$$
Upper boud:
$$
sum_k=0^2nfrackk+n^2lefrac1n^2sum_k=0^2nk=fracn,(2,n+1)n^2.
$$
However, Riemann sums can be used, but in a more complicated way:
$$
sum_k=0^2nfrackk+n^2=2,n,Bigl(frac12,nsum_k=0^2nfrack/(2,n)k/(2,n)+n/2Bigr)
sim2,nint_0^1fracx,dxx+n/2.
$$
edited Aug 23 at 18:26
answered Aug 22 at 11:14
Julián Aguirre
65.2k23894
65.2k23894
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
add a comment |Â
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
1
1
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
Simpler upper bound: $$ sum_k=0^2nfrackk+n^2leqslantfrac1n^2sum_k=0^2nk$$
â Did
Aug 22 at 11:18
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
So there is no simple way to calculate this limit as the Riemann sum for some $f(x)$ without trying to bound the sum?
â Timur Sharapov
Aug 22 at 11:21
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@TimurSharapov Indeed Riemann sums only complicate things here while simple uniform comparisons do the job neatly.
â Did
Aug 22 at 11:24
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
@Did I tried that type of estimate, and somehow forgot the $2$ in the denominator of the sum $sum_k=0^2nk$.
â Julián Aguirre
Aug 22 at 13:53
Thus, modify your answer?
â Did
Aug 22 at 15:52
Thus, modify your answer?
â Did
Aug 22 at 15:52
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2890858%2fcalculate-lim-limits-n-to-infty-sum-limits-0-leqslant-k-leqslant2n-frac-k%23new-answer', 'question_page');
);
Post as a guest
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
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
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
"Given the limits, this integral sum can be written as $sumf(frac2kn)cdotfrac2n$." Well, no.
â Did
Aug 22 at 11:20
Sorry, but why not?
â Timur Sharapov
Aug 22 at 11:22
Which function $f$ would yield this identity? Not $f(x)=frac xx^2+1$ in any case...
â Did
Aug 22 at 11:23
Or, alternatively, we can divide $[0;2]$ into $2n$ parts with the increment equal to $frac1n$. Then the integral sum is the sum of $f(frackn)cdotfrac1n$ on $[0,2]$
â Timur Sharapov
Aug 22 at 11:28
No. Check your computations.
â Did
Aug 22 at 11:31