Re: What if Riemann's prime-counting formula was not the best?
- --- In firstname.lastname@example.org,
Chroma <chromatella@...> wrote:
>> R(x)=round(1+suminf(k=1,log(x)^k/(zeta(k+1)*k*k!)));No. The Gram formula is still very convenient at this size.
> For large values of x, this algorithm is inconvenient,
> eg for x = 10^250 requires over 1868 terms
Pari-GP, gives the exact value of R(10^250) in 0.1 seconds:
print(" took "gettime" milliseconds");
took 98 milliseconds
Perhaps you are paying for inferior software?
If so, the general rule is: the less you pay,
the better the deal.
Pari-GP is totally free and hence rather hard to beat :-)