For example it can calculate prime(10^14) on my iMac: time ./primecount -n 100000000000000 3475385758524527 real 0m8.239s user 0m8.187s sys 0m0.024s For prime(10^15) it takes a little longer: time ./primecount -n 1000000000000000 37124508045065437 real 0m35.892s user 0m35.707s sys 0m0.072s On Sun, May 26, 2019 at 10:04 AM Victor Miller <victorsmiller@gmail.com> wrote:
Kim Walisch seems to have the latest and greatest implementation of these ideas, even using parallelism: https://github.com/kimwalisch/primecount
On Sun, May 26, 2019 at 9:48 AM Victor Miller <victorsmiller@gmail.com> wrote:
After all these years I don’t understand why Mathematica and pari aren’t using my (and Oflyzko, Lagarias ...) combinatorial algorithm for this. We did this on 1983!
Victor
On Sun, May 26, 2019 at 06:57 Hans Havermann <gladhobo@bell.net> wrote:
SP: "The largest number I could test is Prime[1 000 000 000 ] in mma. If you need more values, you need to refer to sequence : A006988 and that's about it."
One of the links in A006988 is Andrew Booker's Nth Prime Page which will go up to 10^12. _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun