Evaluating the limit of a sum using integrationIs this Riemann sum formula for definite integral using of prime numbers true?Limit of sub-sequence and limit of sequenceEvaluating an integral involving a Gaussian functionLimit for sequence $a_m+nleq a_m+a_n$Proving the limitFind a relation between the sum of $100$ positive numbers and the sum of their pairwise productsSeries of non negative terms diverges then does $fracsum a_i^2(sum a_i)^2 to 0$?Limit of multivariate function?Using the coefficients $a_1,a_2,ldots, a_N$ find coefficients $tilde a_1, tilde a_2, ldots,tilde a_N$ such that $tilde a_1+ldots+tilde a_N=1$Integrating the Dirac function over two variablesOptimizing the limit of a sequence of nondifferentiable functions
What does i386 mean on macOS Mojave?
When a land becomes a creature, is it untapped?
51% attack - apparently very easy? refering to CZ's "rollback btc chain" - How to make sure such corruptible scenario can never happen so easily?
What are the components of a legend (in the sense of a tale, not a figure legend)?
Drawing lines to nearest point
How to slow yourself down (for playing nice with others)
Why does my circuit work on a breadboard, but not on a perfboard? I am new to soldering
Was this a power play by Daenerys?
Does Lawful Interception of 4G / the proposed 5G provide a back door for hackers as well?
How to make a language evolve quickly?
Why can't RGB or bicolour LEDs produce a decent yellow?
What are the implications of the new alleged key recovery attack preprint on SIMON?
Why did the ICC decide not to probe alleged US atrocities in Afghanistan?
Word for being out at night during curfew
Why was castling bad for white in this game, and engine strongly prefered trading queens?
Extrude the faces of a cube symmetrically along XYZ
What food production methods would allow a metropolis like New York to become self sufficient
How can this pool heater gas line be disconnected?
Extracting sublists that contain similar elements
How to minimise the cost of guessing a number in a high/low guess game?
What is Plautus’s pun about frustum and frustrum?
Size of a folder with du
Can the sorting of a list be verified without comparing neighbors?
How can I answer high-school writing prompts without sounding weird and fake?
Evaluating the limit of a sum using integration
Is this Riemann sum formula for definite integral using of prime numbers true?Limit of sub-sequence and limit of sequenceEvaluating an integral involving a Gaussian functionLimit for sequence $a_m+nleq a_m+a_n$Proving the limitFind a relation between the sum of $100$ positive numbers and the sum of their pairwise productsSeries of non negative terms diverges then does $fracsum a_i^2(sum a_i)^2 to 0$?Limit of multivariate function?Using the coefficients $a_1,a_2,ldots, a_N$ find coefficients $tilde a_1, tilde a_2, ldots,tilde a_N$ such that $tilde a_1+ldots+tilde a_N=1$Integrating the Dirac function over two variablesOptimizing the limit of a sequence of nondifferentiable functions
$begingroup$
One of the first results we learn in definite integral is that if $f(x)$ is Riemann integrable in $(0,1)$ then we have $lim_n to inftydfrac1nsum_i=1^nfBig(dfracinBig) = int_0^1f(x)dx$.
I was playing around with this to see if this can be generalized and I found the following. We can rewrite the above result as
$$
lim_n to inftyfrac11+1+ldotstext$n$-timessum_i=1^n1times fBig(frac1+1+ldotstext$i$-times1+1+ldotstext$n$-timesBig) = int_0^1f(x)dx.
$$
The LHS can be written in the general form given below and we ask ourselves for which sequence $a_i$ does the following hold
$$
lim_n to inftyfrac1a_1 + a_2 + ldots + a_nsum_i=1^na_i fBig(fraca_1 + a_2 + ldots + a_ia_1 + a_2 + ldots + a_nBig) =int_0^1f(x)dx.
$$
Trivially this holds for $a_i = c$ where $c$ is a non-zero constant and the above result is the case when $c=1$. I also observed that this holds for sequence of natural numbers $a_i = i$ since
$$
lim_n to inftyfrac2n^2+nsum_i=1^ni fBig(fraci^2+in^2+nBig) =int_0^1f(x)dx.
$$
Experimentally, this also holds for the sequence of prime numbers $a_i = p_n$ and also for the sequence of composite numbers $c_n$.
Question: What are the necessary and sufficient conditions on $a_i$ for the above relation to hold?
Related question
real-analysis integration number-theory limits summation
$endgroup$
add a comment |
$begingroup$
One of the first results we learn in definite integral is that if $f(x)$ is Riemann integrable in $(0,1)$ then we have $lim_n to inftydfrac1nsum_i=1^nfBig(dfracinBig) = int_0^1f(x)dx$.
I was playing around with this to see if this can be generalized and I found the following. We can rewrite the above result as
$$
lim_n to inftyfrac11+1+ldotstext$n$-timessum_i=1^n1times fBig(frac1+1+ldotstext$i$-times1+1+ldotstext$n$-timesBig) = int_0^1f(x)dx.
$$
The LHS can be written in the general form given below and we ask ourselves for which sequence $a_i$ does the following hold
$$
lim_n to inftyfrac1a_1 + a_2 + ldots + a_nsum_i=1^na_i fBig(fraca_1 + a_2 + ldots + a_ia_1 + a_2 + ldots + a_nBig) =int_0^1f(x)dx.
$$
Trivially this holds for $a_i = c$ where $c$ is a non-zero constant and the above result is the case when $c=1$. I also observed that this holds for sequence of natural numbers $a_i = i$ since
$$
lim_n to inftyfrac2n^2+nsum_i=1^ni fBig(fraci^2+in^2+nBig) =int_0^1f(x)dx.
$$
Experimentally, this also holds for the sequence of prime numbers $a_i = p_n$ and also for the sequence of composite numbers $c_n$.
Question: What are the necessary and sufficient conditions on $a_i$ for the above relation to hold?
Related question
real-analysis integration number-theory limits summation
$endgroup$
add a comment |
$begingroup$
One of the first results we learn in definite integral is that if $f(x)$ is Riemann integrable in $(0,1)$ then we have $lim_n to inftydfrac1nsum_i=1^nfBig(dfracinBig) = int_0^1f(x)dx$.
I was playing around with this to see if this can be generalized and I found the following. We can rewrite the above result as
$$
lim_n to inftyfrac11+1+ldotstext$n$-timessum_i=1^n1times fBig(frac1+1+ldotstext$i$-times1+1+ldotstext$n$-timesBig) = int_0^1f(x)dx.
$$
The LHS can be written in the general form given below and we ask ourselves for which sequence $a_i$ does the following hold
$$
lim_n to inftyfrac1a_1 + a_2 + ldots + a_nsum_i=1^na_i fBig(fraca_1 + a_2 + ldots + a_ia_1 + a_2 + ldots + a_nBig) =int_0^1f(x)dx.
$$
Trivially this holds for $a_i = c$ where $c$ is a non-zero constant and the above result is the case when $c=1$. I also observed that this holds for sequence of natural numbers $a_i = i$ since
$$
lim_n to inftyfrac2n^2+nsum_i=1^ni fBig(fraci^2+in^2+nBig) =int_0^1f(x)dx.
$$
Experimentally, this also holds for the sequence of prime numbers $a_i = p_n$ and also for the sequence of composite numbers $c_n$.
Question: What are the necessary and sufficient conditions on $a_i$ for the above relation to hold?
Related question
real-analysis integration number-theory limits summation
$endgroup$
One of the first results we learn in definite integral is that if $f(x)$ is Riemann integrable in $(0,1)$ then we have $lim_n to inftydfrac1nsum_i=1^nfBig(dfracinBig) = int_0^1f(x)dx$.
I was playing around with this to see if this can be generalized and I found the following. We can rewrite the above result as
$$
lim_n to inftyfrac11+1+ldotstext$n$-timessum_i=1^n1times fBig(frac1+1+ldotstext$i$-times1+1+ldotstext$n$-timesBig) = int_0^1f(x)dx.
$$
The LHS can be written in the general form given below and we ask ourselves for which sequence $a_i$ does the following hold
$$
lim_n to inftyfrac1a_1 + a_2 + ldots + a_nsum_i=1^na_i fBig(fraca_1 + a_2 + ldots + a_ia_1 + a_2 + ldots + a_nBig) =int_0^1f(x)dx.
$$
Trivially this holds for $a_i = c$ where $c$ is a non-zero constant and the above result is the case when $c=1$. I also observed that this holds for sequence of natural numbers $a_i = i$ since
$$
lim_n to inftyfrac2n^2+nsum_i=1^ni fBig(fraci^2+in^2+nBig) =int_0^1f(x)dx.
$$
Experimentally, this also holds for the sequence of prime numbers $a_i = p_n$ and also for the sequence of composite numbers $c_n$.
Question: What are the necessary and sufficient conditions on $a_i$ for the above relation to hold?
Related question
real-analysis integration number-theory limits summation
real-analysis integration number-theory limits summation
edited May 8 at 7:23
Nilotpal Kanti Sinha
asked May 8 at 6:19
Nilotpal Kanti SinhaNilotpal Kanti Sinha
4,94121641
4,94121641
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Here is a clumsy criterion:
Proposition. Let $(a_n)$ be a sequence of positive numbers and write $s_n = sum_i=1^n a_i$ for the partial sums. Then the followings are equivalent:
For any Riemann-integrable $f : [0, 1] to mathbbR$,
$$ lim_ntoinfty sum_i=1^n fleft(fracs_is_nright)fraca_is_n = int_0^1f(x) , mathrmdx. $$
$maxa_1,cdots,a_n/s_n to 0$ as $ntoinfty$.
This statement is kind of dumb, since $maxa_1,cdots,a_n/s_n$ represents the length of the largest subinterval of the partition in OP's scheme. Then (2) simply requires that the partition becomes finer as $n$ grows.
Proof. Write $|Pi|$ for the mesh-size of the partition $Pi$. If $f : [0, 1] to mathbbR$ is Riemann-integrable and $Pi_n$ is a sequence of partitions of $[0, 1]$ with $|Pi_n|to 0$, then the associated Riemann sum converges to the integral $int_0^1 f(x),mathrmdx$ as $ntoinfty$.
$(2)Rightarrow(1)$ : If we choose $Pi_n = s_i/s_n_i=0^n$, then $|Pi_n| = maxa_1,cdots,a_n/s_n$, and so, (1) follows.
$(1)Rightarrow(2)$ : We prove the contrapositive. Assume that (2) does not hold. Then we can find an interval $[a, b] subseteq [0, 1]$ with $a < b$ and a subsequence $(n_k)$ such that $[a, b]$ is always contained in one of the subintervals of $Pi_n_k$.
Indeed, negating (2) tells that $limsup_ntoinfty |Pi_n| > 0$, thus by passing to a subsequence, we can assume that $|Pi_j| geq epsilon > 0$ holds for all $j$, for some $epsilon > 0$. Next, for each $j$, pick a subinterval $I_j$ of $Pi_j$ having length $> epsilon$. Then we may appeal to the compactness of $[0, 1]$ to extract a further subsequence $Pi_k$ for which $bigcap_k I_k$ is an interval of positive length. (For instance, pick a further subsequence such that the left-endpoints of $I_k$'s converge.)
Once such $[a, b]$ and $Pi_n_k$ are chosen, simply pick $f$ as a Riemann-integrable function which is supported on $(a, b)$ and $int_0^1 f(x) , mathrmdx neq 0$. Then from $sum_i=1^n_k f(s_i/s_n_k) (a_i/s_n_k) = 0$, we know that this Riemann sum does not converge to the integral of $f$.
$endgroup$
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
add a comment |
Your Answer
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%2f3218019%2fevaluating-the-limit-of-a-sum-using-integration%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$
Here is a clumsy criterion:
Proposition. Let $(a_n)$ be a sequence of positive numbers and write $s_n = sum_i=1^n a_i$ for the partial sums. Then the followings are equivalent:
For any Riemann-integrable $f : [0, 1] to mathbbR$,
$$ lim_ntoinfty sum_i=1^n fleft(fracs_is_nright)fraca_is_n = int_0^1f(x) , mathrmdx. $$
$maxa_1,cdots,a_n/s_n to 0$ as $ntoinfty$.
This statement is kind of dumb, since $maxa_1,cdots,a_n/s_n$ represents the length of the largest subinterval of the partition in OP's scheme. Then (2) simply requires that the partition becomes finer as $n$ grows.
Proof. Write $|Pi|$ for the mesh-size of the partition $Pi$. If $f : [0, 1] to mathbbR$ is Riemann-integrable and $Pi_n$ is a sequence of partitions of $[0, 1]$ with $|Pi_n|to 0$, then the associated Riemann sum converges to the integral $int_0^1 f(x),mathrmdx$ as $ntoinfty$.
$(2)Rightarrow(1)$ : If we choose $Pi_n = s_i/s_n_i=0^n$, then $|Pi_n| = maxa_1,cdots,a_n/s_n$, and so, (1) follows.
$(1)Rightarrow(2)$ : We prove the contrapositive. Assume that (2) does not hold. Then we can find an interval $[a, b] subseteq [0, 1]$ with $a < b$ and a subsequence $(n_k)$ such that $[a, b]$ is always contained in one of the subintervals of $Pi_n_k$.
Indeed, negating (2) tells that $limsup_ntoinfty |Pi_n| > 0$, thus by passing to a subsequence, we can assume that $|Pi_j| geq epsilon > 0$ holds for all $j$, for some $epsilon > 0$. Next, for each $j$, pick a subinterval $I_j$ of $Pi_j$ having length $> epsilon$. Then we may appeal to the compactness of $[0, 1]$ to extract a further subsequence $Pi_k$ for which $bigcap_k I_k$ is an interval of positive length. (For instance, pick a further subsequence such that the left-endpoints of $I_k$'s converge.)
Once such $[a, b]$ and $Pi_n_k$ are chosen, simply pick $f$ as a Riemann-integrable function which is supported on $(a, b)$ and $int_0^1 f(x) , mathrmdx neq 0$. Then from $sum_i=1^n_k f(s_i/s_n_k) (a_i/s_n_k) = 0$, we know that this Riemann sum does not converge to the integral of $f$.
$endgroup$
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
add a comment |
$begingroup$
Here is a clumsy criterion:
Proposition. Let $(a_n)$ be a sequence of positive numbers and write $s_n = sum_i=1^n a_i$ for the partial sums. Then the followings are equivalent:
For any Riemann-integrable $f : [0, 1] to mathbbR$,
$$ lim_ntoinfty sum_i=1^n fleft(fracs_is_nright)fraca_is_n = int_0^1f(x) , mathrmdx. $$
$maxa_1,cdots,a_n/s_n to 0$ as $ntoinfty$.
This statement is kind of dumb, since $maxa_1,cdots,a_n/s_n$ represents the length of the largest subinterval of the partition in OP's scheme. Then (2) simply requires that the partition becomes finer as $n$ grows.
Proof. Write $|Pi|$ for the mesh-size of the partition $Pi$. If $f : [0, 1] to mathbbR$ is Riemann-integrable and $Pi_n$ is a sequence of partitions of $[0, 1]$ with $|Pi_n|to 0$, then the associated Riemann sum converges to the integral $int_0^1 f(x),mathrmdx$ as $ntoinfty$.
$(2)Rightarrow(1)$ : If we choose $Pi_n = s_i/s_n_i=0^n$, then $|Pi_n| = maxa_1,cdots,a_n/s_n$, and so, (1) follows.
$(1)Rightarrow(2)$ : We prove the contrapositive. Assume that (2) does not hold. Then we can find an interval $[a, b] subseteq [0, 1]$ with $a < b$ and a subsequence $(n_k)$ such that $[a, b]$ is always contained in one of the subintervals of $Pi_n_k$.
Indeed, negating (2) tells that $limsup_ntoinfty |Pi_n| > 0$, thus by passing to a subsequence, we can assume that $|Pi_j| geq epsilon > 0$ holds for all $j$, for some $epsilon > 0$. Next, for each $j$, pick a subinterval $I_j$ of $Pi_j$ having length $> epsilon$. Then we may appeal to the compactness of $[0, 1]$ to extract a further subsequence $Pi_k$ for which $bigcap_k I_k$ is an interval of positive length. (For instance, pick a further subsequence such that the left-endpoints of $I_k$'s converge.)
Once such $[a, b]$ and $Pi_n_k$ are chosen, simply pick $f$ as a Riemann-integrable function which is supported on $(a, b)$ and $int_0^1 f(x) , mathrmdx neq 0$. Then from $sum_i=1^n_k f(s_i/s_n_k) (a_i/s_n_k) = 0$, we know that this Riemann sum does not converge to the integral of $f$.
$endgroup$
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
add a comment |
$begingroup$
Here is a clumsy criterion:
Proposition. Let $(a_n)$ be a sequence of positive numbers and write $s_n = sum_i=1^n a_i$ for the partial sums. Then the followings are equivalent:
For any Riemann-integrable $f : [0, 1] to mathbbR$,
$$ lim_ntoinfty sum_i=1^n fleft(fracs_is_nright)fraca_is_n = int_0^1f(x) , mathrmdx. $$
$maxa_1,cdots,a_n/s_n to 0$ as $ntoinfty$.
This statement is kind of dumb, since $maxa_1,cdots,a_n/s_n$ represents the length of the largest subinterval of the partition in OP's scheme. Then (2) simply requires that the partition becomes finer as $n$ grows.
Proof. Write $|Pi|$ for the mesh-size of the partition $Pi$. If $f : [0, 1] to mathbbR$ is Riemann-integrable and $Pi_n$ is a sequence of partitions of $[0, 1]$ with $|Pi_n|to 0$, then the associated Riemann sum converges to the integral $int_0^1 f(x),mathrmdx$ as $ntoinfty$.
$(2)Rightarrow(1)$ : If we choose $Pi_n = s_i/s_n_i=0^n$, then $|Pi_n| = maxa_1,cdots,a_n/s_n$, and so, (1) follows.
$(1)Rightarrow(2)$ : We prove the contrapositive. Assume that (2) does not hold. Then we can find an interval $[a, b] subseteq [0, 1]$ with $a < b$ and a subsequence $(n_k)$ such that $[a, b]$ is always contained in one of the subintervals of $Pi_n_k$.
Indeed, negating (2) tells that $limsup_ntoinfty |Pi_n| > 0$, thus by passing to a subsequence, we can assume that $|Pi_j| geq epsilon > 0$ holds for all $j$, for some $epsilon > 0$. Next, for each $j$, pick a subinterval $I_j$ of $Pi_j$ having length $> epsilon$. Then we may appeal to the compactness of $[0, 1]$ to extract a further subsequence $Pi_k$ for which $bigcap_k I_k$ is an interval of positive length. (For instance, pick a further subsequence such that the left-endpoints of $I_k$'s converge.)
Once such $[a, b]$ and $Pi_n_k$ are chosen, simply pick $f$ as a Riemann-integrable function which is supported on $(a, b)$ and $int_0^1 f(x) , mathrmdx neq 0$. Then from $sum_i=1^n_k f(s_i/s_n_k) (a_i/s_n_k) = 0$, we know that this Riemann sum does not converge to the integral of $f$.
$endgroup$
Here is a clumsy criterion:
Proposition. Let $(a_n)$ be a sequence of positive numbers and write $s_n = sum_i=1^n a_i$ for the partial sums. Then the followings are equivalent:
For any Riemann-integrable $f : [0, 1] to mathbbR$,
$$ lim_ntoinfty sum_i=1^n fleft(fracs_is_nright)fraca_is_n = int_0^1f(x) , mathrmdx. $$
$maxa_1,cdots,a_n/s_n to 0$ as $ntoinfty$.
This statement is kind of dumb, since $maxa_1,cdots,a_n/s_n$ represents the length of the largest subinterval of the partition in OP's scheme. Then (2) simply requires that the partition becomes finer as $n$ grows.
Proof. Write $|Pi|$ for the mesh-size of the partition $Pi$. If $f : [0, 1] to mathbbR$ is Riemann-integrable and $Pi_n$ is a sequence of partitions of $[0, 1]$ with $|Pi_n|to 0$, then the associated Riemann sum converges to the integral $int_0^1 f(x),mathrmdx$ as $ntoinfty$.
$(2)Rightarrow(1)$ : If we choose $Pi_n = s_i/s_n_i=0^n$, then $|Pi_n| = maxa_1,cdots,a_n/s_n$, and so, (1) follows.
$(1)Rightarrow(2)$ : We prove the contrapositive. Assume that (2) does not hold. Then we can find an interval $[a, b] subseteq [0, 1]$ with $a < b$ and a subsequence $(n_k)$ such that $[a, b]$ is always contained in one of the subintervals of $Pi_n_k$.
Indeed, negating (2) tells that $limsup_ntoinfty |Pi_n| > 0$, thus by passing to a subsequence, we can assume that $|Pi_j| geq epsilon > 0$ holds for all $j$, for some $epsilon > 0$. Next, for each $j$, pick a subinterval $I_j$ of $Pi_j$ having length $> epsilon$. Then we may appeal to the compactness of $[0, 1]$ to extract a further subsequence $Pi_k$ for which $bigcap_k I_k$ is an interval of positive length. (For instance, pick a further subsequence such that the left-endpoints of $I_k$'s converge.)
Once such $[a, b]$ and $Pi_n_k$ are chosen, simply pick $f$ as a Riemann-integrable function which is supported on $(a, b)$ and $int_0^1 f(x) , mathrmdx neq 0$. Then from $sum_i=1^n_k f(s_i/s_n_k) (a_i/s_n_k) = 0$, we know that this Riemann sum does not converge to the integral of $f$.
edited May 8 at 8:11
answered May 8 at 8:06
Sangchul LeeSangchul Lee
97.5k12174283
97.5k12174283
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
add a comment |
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
$begingroup$
That's a rather simple criterion.
$endgroup$
– Nilotpal Kanti Sinha
2 days ago
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%2f3218019%2fevaluating-the-limit-of-a-sum-using-integration%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