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 include the open source libraries primesieve and
primecount in Sage which would provide a much faster Primes iterator,
prime_range, prime_pi, and nth_prime, however so far these haven't made it in.
However, both of these libraries do have a command line interface, and
depending on the platform you are using there might be a precompiled binary.
See primesieve.org and github.com/kimwalisch/primecount. The primecount library
is much newer (about a year old), and a lot of performance improvements are
still being made to it, but currently its nth_prime functionality takes around
half a second for input around 10^10.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
