Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Given a series $\displaystyle\sum_{n=0}^\infty a_n$, how can we bound the error (which I shall denote with $R_n$) when we evaluate it to $m$ terms?

$$\sum_{n=0}^\infty a_n \approx \sum_{n=0}^m a_n$$

$$R_n = \sum_{n = m+1}^\infty a_n$$ $$So$$

$$\sum_{n=0}^\infty a_n = \sum_{n=0}^m a_n + R_n$$

Clearly, we need to find some bounds for $R_n$ that we can evaluate, but how can they be found?

Example series:

  • $\displaystyle\sum_{n=0}^\infty \frac1{n!}$
  • $\displaystyle\sum_{n=0}^\infty \frac{2n+2}{(2n+1)!}$
  • $\displaystyle\sum_{n=1}^\infty \frac1{n^2}$
  • $\displaystyle\sum_{n=1}^\infty (-1)^n \frac1n$
  • $\displaystyle\sum_{n=0}^\infty \frac{3+2n}{2^n}$

  • For $\sum_{n=1}^\infty \frac1{n^2}$, we can use the integral test: $\displaystyle \int_{n+1}^\infty \frac1{x^2}dx \le R_n \le \int_{n}^\infty \frac1{x^2}dx$ so an upper bound on $R_n$ is $\displaystyle\lim_{t\to\infty}\left( \frac1n - \frac1t \right) = \frac1n$

  • For $\sum_{n=1}^\infty (-1)^n \frac1n$, we can use the property of alternating series that says $R_n \le \left|b_{n+1}\right|$

  • For $\displaystyle\sum_{n=m}^\infty \frac{3+2n}{2^n}$, we can split it into $\displaystyle\sum_{n=m}^\infty\left(\frac3{2^n}+\frac{2n}{2^n}\right) = 2^{1-m} +\sum_{n=m}^\infty \frac{n}{2^{n-1}} < 2^{1-m} + \sum_{n=m}^\infty \frac {1.5^{n-1}}{2^{n-1}} = 2^{1-m} + \frac{3^{m-1}}{4^{m-2}}$ so $R_m \le 2^{1-m} + \frac{3^{m-1}}{4^{m-1}}$ given $m>5$.

share|improve this question
This depends a lot on the series in question. –  vadim123 May 1 '13 at 22:21
@vadim123 How do we generally go about trying to find the errors? –  Quincunx May 1 '13 at 22:21
add comment

3 Answers

up vote 2 down vote accepted

Typically one approaches these problems with some sort of comparison to a known series. For example,

$$\sum_{n=m}^\infty \frac{1}{n!}=\frac{1}{m!}\left(\frac{1}{m+1}+\frac{1}{(m+1)(m+2)}+\frac{1}{(m+1)(m+2)(m+3)}+\cdots\right)\le \frac{1}{m!}\left(\frac{1}{m+1}+\frac{1}{(m+1)^2}+\frac{1}{(m+1)^3}+\cdots\right)$$$$=\frac{1}{m!}\frac{\frac1{m+1}}{1-\frac1{m+1}}=\frac{1}{m!}\frac{m+1}{m}\le \frac{2}{m!}$$ The known series in this case was a geometric series.

share|improve this answer
What about some of the other series? –  Quincunx May 1 '13 at 22:41
Math.SE is not the right place to ask such a large collection of questions. One series is fine, asking for a general method is fine, but beyond this you need a different resource. –  vadim123 May 1 '13 at 22:57
You have a good method for doing this, but I am guessing that different series have different comparisons. I am trying to better understand how to choose a comparison series. If you show another series that requires a different method, I consider it a better answer to the general question. I don't mean for you to do all of them; those series are just semi-random series that would hopefully help me understand the concept behind this. –  Quincunx May 1 '13 at 23:03
add comment

With alternating series of decreasing terms the first term left out is a bound for the error.

If your $a_n$ is a "nice" function $a(x)$ that is monotonically decreasing after the relevant $m$, you can use: $$ \sum_{k \ge m} a(k) = \int_m^\infty \lceil a(x) \rceil d x \ge \int_m^\infty a(x) d x \ge \int_m^\infty \lfloor a(x) \rfloor d x = \sum_{k \ge m} a(k + 1) = \sum_{k \ge m + 1} a(k) $$ Now estimate the integral somehow.

share|improve this answer
add comment

To find an estimate for the Error, we first try to use the integral test: $$\int_{n+1}^\infty a_n dn \le R_n \le \int_n^\infty a_n dn$$ or the alternating series test: $$R_n \le |b_{n+1}|$$ If we cannot do this, we then find another series to compare it to, one that we can evaluate, which is more than the original series: $$R_n = \sum_{m=n+1}^\infty a_n \le \sum_{m = n+1}^\infty b_n$$ and then evaluate the second series.

share|improve this answer
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.