That's impressive. The first time Gourdon tried to compute pi(10^23) it took 6 days. If you're interested in the analytic method, here are slides of Davd Platt: https://people.maths.bris.ac.uk/~madjp/junior%20talk.pdf On Mon, May 27, 2019 at 12:09 PM Tomas Rokicki <rokicki@gmail.com> wrote:
That primecount code by Kim Walisch is nice. pi(10^23) in only 6 hours. Deserves a star.
-tom
On Sun, May 26, 2019 at 7: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
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- -- http://cube20.org/ -- http://golly.sf.net/ -- _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun