Proving Summation: $\sum_{n=1}^{\infty}n^{-2}=\frac{\pi^2}{6}

  • Thread starter Thread starter Mentallic
  • Start date Start date
  • Tags Tags
    Proof Summation
Mentallic
Homework Helper
Messages
3,802
Reaction score
95
\sum_{n=1}^{\infty}n^{-2}=\frac{\pi^2}{6}

I'd like to know how to prove this summation. And if possible, what is the significance of having \pi in the answer?
 
Mathematics news on Phys.org
If you're familar with Fourier series then one nice method is to consider the expansion of a "saw-tooth" wave as follows.

Let y(x) = \pi x : -0.5 \leq x \leq 0.5

Now make it periodic as per y(x) = y(x-k) : -0.5+k \leq x \leq 0.5+k, for all integer k.

It's fairly easy to show that the Fourier series expansion is,

y = \sin(2 \pi x) - \frac{1}{2} \sin(4 \pi x) \, ... \, + \frac{(-1)^{k+1}}{k} \sin(2k \pi x) + \, ...

Consider the mean squared value of y, calculated two different ways. Firstly calculate directly from y(x),

MS(y) = \int_{x=-0.5}^{+0.5} (\pi x)^2 dx = \frac {\pi^2}{12}

Now repeating the calculation but this time using the Fourier series (and making use of the fact that the terms are orthagonal) we get,

MS(y) =0.5 ( 1 + 1/4 + 1/9 + ... 1/k^2 + ... )

Equating these two expressions for the mean squared value gives the required sum.
 
Last edited:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top