Gabor Toth's [Glimpses of Algebra and Geometry](http://rads.stackoverflow.com/amzn/click/0387982132) 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.



Is there a "finitary" solution to the Basel problem?
I think that the 14th and last proof in [Robin Chapman's collection](http://secamlocal.ex.ac.uk/people/staff/rjchapma/etc/zeta2.pdf) 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. 


