Andrew Ohana wrote:
Actually you should only need the RH to prove that this method is reasonably
fast. I don't think sage has Li^{-1} implemented, which is really what you need
in order to implement this (Li ~ pi, so Li^{-1} ~ pi^{-1} = nth_prime function).
There has been some effort to includ
On Wednesday, April 2, 2014 1:20:23 PM UTC-7, Szabolcs Horvát wrote:
>
> Hello,
>
> I'm quite new to Sage. Does it have any functionality that will easily
> compute the Nth prime and it's fast enough that it will work for N of the
> order 10^9 or 10^10 reasonable quickly (say, under 10 seconds)?
