Sign up ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Gabor Toth's Glimpses of Algebra and Geometry contains the following beautiful proof (perhaps I should say "interpretation") of the formula $\displaystyle \frac{\pi}{4} = 1 - \frac{1}{3} + \frac{1}{5} \mp ...$, which I don't think I've ever seen before. Given a non-negative integer $r$, let $N(r)$ be the number of ordered pairs $(a, b) \in \mathbb{Z}^2$ such that $a^2 + b^2 \le r^2$, i.e. the number of lattice points in the ball of radius $r$. Then if $r_2(n)$ is the number of ordered pairs $(a, b) \in \mathbb{Z}^2$ such that $a^2 + b^2 = n$, it follows that $N(r^2) = 1 + r_2(1) + ... + r_2(r^2)$.

On the other hand, once one has characterized the primes which are a sums of squares, it's not hard to show that $r_2(n) = 4(d_1(n) - d_3(n))$ where $d_i(n)$ is the number of divisors of $n$ congruent to $i \bmod 4$. So we want to count the number of divisors of numbers less than or equal to $r^2$ congruent to $i \bmod 4$ for $i = 1, 3$ and take the difference. This gives

$\displaystyle \frac{N(r^2) - 1}{4} = \left\lfloor r^2 \right\rfloor - \left\lfloor \frac{r^2}{3} \right\rfloor + \left\lfloor \frac{r^2}{5} \right\rfloor \mp ...$

and now the desired result follows by dividing by $r^2$ and taking the limit.

Question: Does a similar proof exist of the formula $\displaystyle \frac{\pi^2}{6} = 1 + \frac{1}{2^2} + \frac{1}{3^2} + ...$?

By "similar" I mean one first establishes a finitary result with a clear number-theoretic or combinatorial meaning and then takes a limit.

share|cite|improve this question

1 Answer 1

up vote 17 down vote accepted

I think that the 14th and last proof in Robin Chapman's collection is just that. It relies on the formula for the number of representations of an integer as a sum of four squares, which is kind of overkill, but anyway.

share|cite|improve this answer
What a fantastic proof, nonetheless! – Harrison Brown Dec 21 '09 at 22:11

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.