Prime counting function can be expressed as follows:
π(x)=R(x)−∑ρR(xρ)
where R(x) is Riemann's R-function and ρ-s are zeros of Riemann zeta function. I am able to evaluate R(x) for any x. I can also evaluate the sum over trivial zeros of zeta function, which converges rapidly. The problem I have is evaluating the sum over the non-trivial zeros. It seems to diverge. I always read somewhere that including more non-trivial zeros you get more accurate approximation of π(x). But for me the best approximate is not using any zeros π(x)∼R(x).
When I use no zeros π(x)∼R(x) I get blue line (see image).
When I use first pair of nontrivial zeros π(x)∼R(x)−(R(xρ1)+R(xρ−1)) I get yellow line.
When I use first two pairs of nontrivial zeros π(x)∼R(x)−(R(xρ1)+R(xρ−1)+R(xρ2)+R(xρ−2)) I get green line (same image).
(Red line is π(x))
With more zeros it gets worse and worse, but the apposite should be true. What am I doing wrong?
No comments:
Post a Comment