# Computing $\lim_{n\to\infty}n\sum_{k=1}^n\left( \frac{1}{(2k-1)^2} - \frac{3}{4k^2}\right)$

What ways would you propose for the limit below? $$\lim_{n\to\infty}n\sum_{k=1}^n\left( \frac{1}{(2k-1)^2} - \frac{3}{4k^2}\right)$$

Sis.

-
Boy, I went to the wrong high school! –  icurays1 Feb 18 '13 at 14:48
My next question on the Riemann Hypothesis will be called "elementary school question". –  GEdgar Feb 18 '13 at 14:53
Where is this high school? –  Mhenni Benghorbal Feb 18 '13 at 14:58
@Chris'ssisterandpals: I see. –  Mhenni Benghorbal Feb 18 '13 at 15:02
I feel stupid now. I only got to this stuff at university level. –  Thomas Feb 19 '13 at 3:25

$$n\sum_{k=1}^n\frac{1}{(2k-1)^2}-\frac{3}{4k^2} =n(H_{2n}^{(2)}-H_{n}^{(2)})=\sum_{j=1}^n\frac{n}{(j+n)^2}\to\int_0^1\frac{dx}{(1+x)^2} =\frac{1}{2}$$

-
This is incorrect. The limit indeed converges, but not to the limit you stated. –  nbubis Feb 18 '13 at 14:58
Could you tell me where I made a mistake? –  Ishan Banerjee Feb 18 '13 at 15:01
@Chis's sister and pals Where do you get these questions? –  Ishan Banerjee Feb 18 '13 at 15:20
(+1) Nice solution. –  Mhenni Benghorbal Feb 18 '13 at 15:32
@IshanBanerjee: I have them from my brother. –  Chris's sis the artist Feb 18 '13 at 16:12

Here is a high school level answer: \begin{align} \sum_{k=1}^n\left(\frac1{(2k-1)^2}-\frac3{4k^2}\right) &=\sum_{k=1}^n\left(\frac1{(2k-1)^2}+\frac1{(2k)^2}-\frac1{k^2}\right)\\ &=\sum_{k=1}^{2n}\frac1{k^2}-\sum_{k=1}^n\frac1{k^2}\\ &=\sum_{k=n+1}^{2n}\frac1{k^2}\tag{1} \end{align} Using partial fractions and summing the telescoping series, we get $$\hspace{-1cm} \frac1{n+1}-\frac1{2n+2} =\sum_{k=n+1}^{2n}\frac1{k(k+1)} \le\sum_{k=n+1}^{2n}\frac1{k^2} \le\sum_{k=n+1}^{2n}\frac1{k(k-1)} =\frac1n-\frac1{2n}\tag{2}$$ Therefore, the Squeeze Theorem and $(2)$ yield $$\lim_{n\to\infty}n\sum_{k=n+1}^{2n}\frac1{k^2}=\frac12\tag{3}$$

-
Oh, this is a candidate for the penultimate high school year since you used no integral. Just awesome! (+1) Actually, excepting the limit part, it could also be a good problem for the middle school. –  Chris's sis the artist Feb 18 '13 at 17:08
@Chris'ssisterandpals: I don't usually post two answers to the same question, but the prerequisite level of these answers was so disparate, that I felt I should. –  robjohn Feb 18 '13 at 17:20
I have no problem with that. For me the answers are important! :-) –  Chris's sis the artist Feb 18 '13 at 17:22
Very nice!${}{}$ –  mrf Feb 19 '13 at 11:56
(+1) The easier, the better. –  Jack D'Aurizio Sep 13 '14 at 18:01

OK, it turns out that

$$\sum_{k=1}^n\left( \frac{1}{(2k-1)^2} - \frac{3}{4k^2}\right) = \sum_{k=1}^{n-1} \frac{1}{(k+n)^2}$$

This may be shown by observing that

$$\sum_{k=1}^n \frac{1}{(2k-1)^2} = \sum_{k=1}^{2 n-1} \frac{1}{k^2} - \frac{1}{2^2} \sum_{k=1}^n \frac{1}{k^2}$$

The desired limit may then be rewritten as

$$\lim_{n \rightarrow \infty} \frac{1}{n} \sum_{k=1}^{n-1} \frac{1}{(1 + (k/n))^2}$$

which you may recognize as a Riemann sum, equal to

$$\int_0^1 dx \: \frac{1}{(1+x)^2} = \frac{1}{2}$$

-
nice work and well shown. (+1) –  Chris's sis the artist Feb 18 '13 at 15:18
This is the way I wanted to go, but I went with the Euler-Maclaurin Sum Formula as an alternative :-) (+1) –  robjohn Feb 18 '13 at 16:46
Nice to see it done different ways. –  Ron Gordon Feb 18 '13 at 16:56
I have added yet another way :-) –  robjohn Feb 18 '13 at 17:15
You're an animal, @robjohn! –  Ron Gordon Feb 18 '13 at 20:09

Using the Euler-Maclaurin Sum Formula, \begin{align} \sum_{k=1}^n\left(\frac1{(2k-1)^2}-\frac3{4k^2}\right) &=\sum_{k=1}^n\left(\frac1{(2k-1)^2}+\frac1{(2k)^2}-\frac1{k^2}\right)\\ &=\sum_{k=1}^{2n}\frac1{k^2}-\sum_{k=1}^n\frac1{k^2}\\ &=\left(C-\frac1{2n}+O\left(\frac1{n^2}\right)\right)-\left(C-\frac1n+O\left(\frac1{n^2}\right)\right)\\ &=\frac1{2n}+O\left(\frac1{n^2}\right) \end{align} Therefore, \begin{align} \lim_{n\to\infty}n\sum_{k=1}^n\left(\frac1{(2k-1)^2}-\frac3{4k^2}\right) &=\lim_{n\to\infty}n\left(\frac1{2n}+O\left(\frac1{n^2}\right)\right)\\ &=\frac12 \end{align}

-
Another good shot with Euler-Maclaurin Sum Formula. Thanks John! (+1) –  Chris's sis the artist Feb 18 '13 at 16:51
@Chris'ssisterandpals: I am writing up a high school level answer now. –  robjohn Feb 18 '13 at 16:52


Note that $\ds{\sum_{k = 1}^{\infty}\fermi\pars{k} = 0}$ because $$\sum_{k = 1}^{\infty}\fermi\pars{k} =\sum_{k = 1}^{\infty}{1 \over \pars{2k - 1}^{2}} -\sum_{k = 1}^{\infty}{3 \over 4k^{2}} =\bracks{\sum_{k = 1}^{\infty}{1 \over k^{2}} -\sum_{k = 1}^{\infty}{1 \over \pars{2k}^{2}}} -\sum_{k = 1}^{\infty}{3 \over 4k^{2}}$$

With Stolz-Cesàro Theorem: \begin{align}&\color{#66f}{\large\lim_{n\ \to\ \infty}\bracks{% n\sum_{k = 1}^{n} \fermi\pars{k}}}=\lim_{n\ \to\ \infty}{\sum_{k = 1}^{n}% \fermi\pars{k} \over 1/n} =\lim_{n\ \to\ \infty}{% \sum_{k = 1}^{n + 1}\fermi\pars{k} - \sum_{k = 1}^{n}\fermi\pars{k} \over 1/\pars{n + 1} - 1/n} \\[3mm]&=\lim_{n\ \to\ \infty}\bracks{-n\pars{n + 1}\fermi\pars{n + 1}} =\lim_{n\ \to\ \infty}\braces{n\pars{n + 1} \bracks{{3 \over 4\pars{n + 1}^{2}} - {1 \over 4\pars{n + 1}^{2}}}} \\[3mm]&=\half\,\lim_{n\ \to\ \infty}{n \over n + 1}=\color{#66f}{\Large\half} \end{align}

-
Good job there! (+1) –  Chris's sis the artist Sep 13 '14 at 6:30
@Chris'ssis Thanks. You are always posting interesting questions. –  Felix Marin Sep 13 '14 at 6:40