1

If $n$ is a positive integer, Prove that

$$\frac1{2^2}+\frac1{3^2}+\dotsb+\frac1{n^2}\lt\frac{2329}{3600}.$$

please don't refer to the famous $1+\frac1{2^2}+\frac1{3^2}+\dotsb=\frac{\pi^2}6$.

I am looking a method that doesn't use $\text{“}\pi\text{''}.$

Unfortunately, I know and tried only $\text{“}\pi\text{''}$ method.

MathLover
  • 429

6 Answers6

8

I like this kind of numerical challenges. Let us exploit creative telescoping.
For any $n\geq 2$ we have $$ \frac{1}{n^2}-\left[\frac{1}{n}-\frac{1}{n+1}\right]=\frac{1}{n^2(n+1)}\tag{1} $$ $$ \frac{1}{n^2(n+1)}-\left[\frac{1}{2n^2}-\frac{1}{2(n+1)^2}\right]=\frac{1}{2n^2(n+1)^2}\tag{2} $$ $$ \frac{1}{2n^2(n+1)^2}-\left[\frac{1}{6n^3}-\frac{1}{6(n+1)^3}\right]=-\frac{1}{6n^3(n+1)^3}\tag{3} $$ $$ \frac{1}{6n^3(n+1)^3}-\left[\frac{1}{30n^5}-\frac{1}{30(n+1)^5}\right]=\frac{5n^2+5n+1}{30n^5(n+1)^5}\tag{4}$$ $$ \frac{5n^2+5n+1}{30n^5(n+1)^5}< \frac{1}{42 n^7}-\frac{1}{42(n+1)^7}\tag{5} $$ hence by setting $g(n)=\frac{1}{n}+\frac{1}{2n^2}+\frac{1}{6n^3}-\frac{1}{30n^5}$ we have $$\begin{eqnarray*} \zeta(2)-1=\sum_{n\geq 2}\frac{1}{n^2} &=& \sum_{n\geq 2}\left[g(n)-g(n+1)\right]+\sum_{n\geq 2}\frac{5n^2+5n+1}{30n^5(n+1)^5}\\ &<& g(2)+\frac{1}{42\cdot 2^7}=\color{red}{\frac{5779}{8960}}<\frac{2322}{3600}.\tag{6}\end{eqnarray*} $$

The same technique proves Stirling's inequality and the "acceleration formula" $$ \sum_{n\geq 1}\frac{1}{n^2} = \sum_{n\geq 1}\frac{3}{n^2\binom{2n}{n}}\tag{7} $$ leading to the more accurate approximation $\zeta(2)-1\approx \frac{51077}{79200}$.


There also is a simple and accurate lower bound. By choosing $h(x)=\frac{6x-3}{6x^2-6x+2}$ we have $\frac{1}{x^2}\geq h(x)-h(x+1)$ for any $x\geq 2$, with the difference behaving like $\frac{1}{9x^6}$. It follows that $$ \zeta(2)-1\geq \color{red}{\frac{9}{14}} = h(2).\tag{8}$$ By selecting $k(x)=\frac{60x^2-60x+31}{60x^3-90x^2+66x-18}$ we get $\zeta(2)-1\leq \frac{151}{234}$, simpler but less accurate than $(6)$.

Jack D'Aurizio
  • 353,855
  • you are genius, really...ıs $\frac{2329}{3600}$ is absurd fraction? – MathLover Jul 14 '17 at 01:17
  • @Student: it is not more absurd than $\frac{5779}{8960}$, and $\frac{643}{997}$ is stranger and more accurate than both. – Jack D'Aurizio Jul 14 '17 at 01:20
  • Sorry, Other users criticize me, $\frac{2329}{3600}$ is very absurd. – MathLover Jul 14 '17 at 01:33
  • 2
    @Student: To be happy you have to learn hearing only the right criticisms, Master Yoda said. – Jack D'Aurizio Jul 14 '17 at 01:40
  • Using $\frac1{n^2}=\lim_{h\to0}\frac1h\left[\frac1n-\frac1{n+h}\right]$ I get $$\sum_{k=1}^\infty\frac1{k^2}=\lim_{h\to0}\frac1hH_h$$ Hopefully you can use this more creatively than I can. Good night! – Simply Beautiful Art Jul 14 '17 at 01:42
  • @SimplyBeautifulArt: by de l'Hopital rule that is the same as stating $\zeta(2)=\psi'(1)$, but I am not aware of slick methods for approximating $\psi'$ other than exploiting creative telescoping / the EML formula. Converting everything to an integral and exploiting Beuker-like techniques should not be more efficient, but maybe I am wrong about that, thanks for the suggestion and good night to you too. – Jack D'Aurizio Jul 14 '17 at 01:46
  • @JackD'Aurizio what if you were asked to show that $\zeta(2)<\dfrac{129}{200}$ – Raffaele Jul 14 '17 at 09:32
  • @Raffaele You mean $\zeta(2)-1<\frac{129}{200}$? If so, you can use my answer, changing the upper bound to the last sum to $123$ or higher, though that makes it rather brute force. – Simply Beautiful Art Jul 14 '17 at 10:52
  • @Raffaele: nothing to change since $\frac{5779}{8960}<\frac{129}{200}$. – Jack D'Aurizio Jul 14 '17 at 12:15
  • @Jack D'Aurizio dear Jack, I found a way, for this problem.But I have no computer and i know latex very bad..If I write with hand, can you help me for exchange to latex?? And my english knowledge olso bad..If could you please?.. – Mathematics is Life Jul 15 '17 at 15:05
  • @Jack D'Aurizio https://files.acrobat.com/a/preview/9e8dd36e-4e3b-489c-afd0-d427e690fd6e – Mathematics is Life Jul 15 '17 at 16:49
  • 2
    @MathLife: I took the liberty to summarize your approach. Things here tend to get appreciated if they are extremely short OR extremely long, I hope you are happy with the outcome. – Jack D'Aurizio Jul 15 '17 at 17:12
  • @Jack D'Aurizio Dear Jack, Your edit is really impressive.in a Single line..I have to admit, I could not understand you for your own solution. This is really hard..I will try again for understanding..(and thanks for +1) – Mathematics is Life Jul 15 '17 at 18:13
5

A viable approach is also to apply a "delayed" creative telescoping based on the identity $\frac{1}{n^2}<\frac{1}{n^2-1}=\frac{1}{2}\left(\frac{1}{n-1}-\frac{1}{n+1}\right)$. This approach leads to

$$ \zeta(2)-1<\left(\frac{1}{2^2}+\frac{1}{3^2}+\frac{1}{4^2}+\frac{1}{5^2}\right)+\frac{1}{2}\sum_{n>5}\left(\frac{1}{n-1}-\frac{1}{n+1}\right)=\frac{2329}{3600} $$ in a single line.

Jack D'Aurizio
  • 353,855
2

Let $\displaystyle S = \sum_{n=2}^\infty \frac 1 {n^2}.\,$ A simple integral test shows $S<\infty.$

Let $T$ be some number a little bit bigger than $S.$ Then \begin{align} & \frac 1 {2^2} + \cdots + \frac 1 {n^2} \\[10pt] < {} & \frac 1 {2^2} + \cdots + \frac 1 {n^2} + \int_n^\infty \frac{dx}{x^2} \\[10pt] = {} & \left(\frac 1 {2^2} + \cdots + \frac 1 {n^2} \right) + \frac 1 n \tag 1 \\[10pt] < {} & S + \frac 1 n \\[10pt] < {} & T \text{ if $n$ is big enough.} \end{align} This shows $\displaystyle \frac 1 {2^2} + \cdots + \frac 1 {n^2} < T$ if $n$ is big enough, but that sum is smaller if $n$ is smaller; therefore that inequality holds without any qualification on the size of $n.$

Thus we only need to know how big $T$ needs to be, or how small $T$ can be. I think maybe if you take $n=500$ then line $(1)$ might show that $T=2329/3600$ can serve.

This is computation-intensive. Maybe there's also an intelligent way to do it.

0

For any natural $n$, we have

$$S_1=\sum_{k=2}^\infty\frac1{k^2}>\sum_{k=2}^n\frac1{k^2}$$

Likewise, consider the following alternating sum:

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

And see that we have

$$S_1+S_2=\sum_{k=2}^\infty\frac{1+(-1)^k}{k^2}=\sum_{k=1}^\infty\frac2{(2k)^2}=\frac12+\frac12S_1$$

Thus, we have

$$S_1=1-2S_2$$

Furthermore, it is easy to see that

$$S_2>\sum_{k=2}^{23}\frac{(-1)^k}{k^2}$$

And thus,

$$S_1<1-2\sum_{k=2}^{23}\frac{(-1)^k}{k^2}<\frac{2329}{3600}$$

Not a terrible sum to evaluate there.

0

approximate by telescoping series. $\left(\sum_{k=2}^{20} \dfrac1{k^2}\right)+(\frac1{20}-\frac1{21})+(\frac1{21}-\frac1{22})+・・・(\frac1{n-1}-\frac1n)=.62976+\frac1{20}-\frac1n=.64616-\frac1n<0.6469\dot4=\frac{2329}{3600}$.

Also $16$ instead of 20 holds.

-3

The simplest approach is to approximate the sum by the integral. The crude way of doing it just uses the fact that $1/x^2$ is a decreasing function, so the integral from $k$ to $k+1$ is bigger than $1/(k+1)^2.$ to make it sharper, one notes that since $1/x^2$ is convex, the integral is actually bigger than $\frac12(1/n^2 + 1/(n+1)^2).$

Igor Rivin
  • 25,994
  • 1
  • 19
  • 40
  • Such crude approximation is not enough to reach the required accuracy. The difference between $\zeta(2)-1$ and $\frac{2339}{3600}$ is $\approx 5\cdot 10^{-3}$. – Jack D'Aurizio Jul 14 '17 at 01:18
  • This solution only works for about $n<10$. – Simply Beautiful Art Jul 14 '17 at 01:21
  • @JackD'Aurizio have you tried? The function $1/x^2$ is very close to linear for any $n>7.$ Maybe you actually have to integrate the quadratic exactly for the first few terms (the exact integral is $1/(n(n+1)^2).$) – Igor Rivin Jul 14 '17 at 01:22
  • @IgorRivin: exploiting convexity is the same as following my approach and stopping at $(2)$ or $(3)$. Not enough. – Jack D'Aurizio Jul 14 '17 at 01:23
  • 1
    Have you tried this approach? And btw, $1/x^2$ being convex implies the integral is less than the trapezoidal sum. Unless you offshift it... but this still isn't nearly enough. – Simply Beautiful Art Jul 14 '17 at 01:24
  • @SimplyBeautifulArt: I guess Igor intended to exploit the Hermite-Hadamard inequality that gives a lower- and an upper-bound at the same time, but that does not really work for large values of $n$. – Jack D'Aurizio Jul 14 '17 at 01:27