1
$\begingroup$

I can approximate the sum of $\frac 1 {n^2}$ using its integral. But what about $(-1)^n\frac 1 {n^2}$? Is it possible to approximate this using integrals?

I want to know if there are other ways than using two terms in the series to get a positive series ie: $\frac 1 {n^2}-\frac 1 {(n+1)^2}$

I could use cos/sin like this:

$$\sum _{n=1}^{\infty } \frac{(-1)^n}{n^2}\sim\sum _{n=1}^m \frac{(-1)^n}{n^2}+\frac{\pi}{2} \int_{m+\frac12}^{\infty } \frac{\cos (\pi x)}{x^2} \, dx\sim\sum _{n=1}^m \frac{(-1)^n}{n^2}-\frac{\sin \left(\pi \left(m+\frac{1}{2}\right)\right)}{2 \left(m+\frac{1}{2}\right)^2}$$

as $m\rightarrow \infty$

but oftentimes it is impractical to find the antiderivatives of such functions.

$\endgroup$
  • $\begingroup$ First, your $\cos(\pi x)$ will not work as expected. In the integral test, it's not enough that the value of the function is correct at integer points, the areas are what are important and $\cos(\pi x)$ will not have the proper areas. $\endgroup$ – Michael Burr Jul 4 '15 at 20:56
  • $\begingroup$ I am pretty sure it will work for reasonably smooth sequences. $\endgroup$ – grdgfgr Jul 4 '15 at 20:59
  • $\begingroup$ It might work in this case because the errors should form an alternating series, but the estimates are not empty. $\endgroup$ – Michael Burr Jul 4 '15 at 21:01
  • $\begingroup$ "estimates are not empty"? I'm not convinced that using cos/sin would give bad approximations. $\endgroup$ – grdgfgr Jul 4 '15 at 21:04
  • $\begingroup$ You must do work to check that the errors satisfy the conditions of the alternating series test and it's not always trivial to do such things. $\endgroup$ – Michael Burr Jul 4 '15 at 21:05
0
$\begingroup$

If you want to work with $\frac{(-1)^n}{n^2}$, lets consider the partial sums: $$ S_n=\sum_{k=0}^m\frac{1}{(2k)^2}-\sum_{k=0}^m\frac{1}{(2k+1)^2}. $$ For the sequel, we will consider $S_m-S_n$ for $m>n$. In particular, those sums would be $$ S_m-S_n=\sum_{k=n+1}^m\frac{1}{(2k)^2}-\sum_{k=n+1}^m\frac{1}{(2k+1)^2}. $$

From the integral test, we know that $$ \int_{n+1}^{m+1}\frac{1}{(2x)^2}dx\leq\sum_{k=n+1}^m\frac{1}{(2n)^2}\leq\int_{n}^m\frac{1}{(2x)^2}dx $$ and $$ \int_{n+1}^{m+1}\frac{1}{(2x+1)^2}dx\leq\sum_{k=n+1}^m\frac{1}{(2n+1)^2}\leq\int_{n}^m\frac{1}{(2x+1)^2}dx $$ Then the difference is bounded by: $$ \int_{2n+1}^{2n}\frac{1}{x^2}dx-\int_{2m+1}^{2m+2}\frac{1}{x^2}dx=\int_{n+1}^{m+1}\frac{1}{(2x)^2}dx-\int_{n}^m\frac{1}{(2x+1)^2}dx\leq\sum_{k=n+1}^m\frac{1}{(2n)^2}-\sum_{k=n+1}^m\frac{1}{(2n+1)^2} \leq\int_{n}^m\frac{1}{(2x)^2}dx-\int_{n+1}^{m+1}\frac{1}{(2x+1)^2}dx=\int_{2n}^{2n+3}\frac{1}{x^2}dx-\int_{2m}^{2m+3}\frac{1}{x^2}dx. $$ Assuming that I did the calculations correctly, this gives that the even partial sums (there are the same number of positive and negative terms) are Cauchy. A similar calculation will work for odd partial sums.

I know that the original statement was about approximations, but you can use the same ideas by letting $m\rightarrow\infty$ to get approximations.

$\endgroup$
  • $\begingroup$ so what is the approximation? $\endgroup$ – grdgfgr Jul 4 '15 at 22:20
  • $\begingroup$ Perform a partial sum and the bounding intervals in terms of $n$ give bounds on the error of the partial sum. $\endgroup$ – Michael Burr Jul 4 '15 at 22:23
  • $\begingroup$ Well I did say "I want to know if there are other ways than using two terms in the series to get a positive series ie: $\frac 1 {n^2}-\frac 1 {(n+1)^2}$" which is basically what you have done. I have plotted the error terms for m, and they are basically equal. i.imgur.com/f3yfufS.png $\endgroup$ – grdgfgr Jul 4 '15 at 22:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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