# An interesting series involving the prime counting function

An open problem in analytic number theory is to determine whether or not the following infinite series converges:

$\sum_{n=2}^{\infty} \frac {(-1)^{\pi(n)}}{n log n}$

Here, $\pi(n)$ is the prime counting function so the problem reduces to understanding the parity of this function. I suspect that the sum converges after some numerical calculations but I don't know what type of theorem needs to be established to prove convergence. I posted the problem on Terry Tao's blog and he tells me that some kind of equidistribution theorem is needed but I don't have any idea how to even formulate it. Does any one have any ideas?

-
Why is this problem interesting? That seems like a fairly arbitrary expression to me, why should we care if it converges? Maybe you could link to where this problem originates, to give us a better feel for why this is interesting. –  Jacques Carette Nov 4 '11 at 11:58
I suspect that convergence is tantamount to finitely many small gaps between primes, which would have an effect on a number of other conjectures. Is that part of the motivation for investigating this? Have you considered the relationship of this sum to those and other conjectures in number theory? Gerhard "Ask Me About System Design" Paseman, 2011.11.04 –  Gerhard Paseman Nov 4 '11 at 12:35
Any references? –  Igor Rivin Nov 4 '11 at 13:27