Very cool. I did the best I could with relatively simple code for prime
stuff in Base, but this looks far more comprehensive. It would be
interesting to see comparisons to the simple stuff in base and the
sophisticated tools in other systems like Mathematica.
On Sun, Dec 21, 2014 at 7:13 PM,
For generating primes, the Julia interface to libprimesieve is 100 times
faster than the current Julia code, for every number of primes that I
tried. (not bad for your code considering Kim Walisch has poured his soul
into this for several years!) It also generates the nth prime, primes in an
Here are some packages for people to look at. In particular,
I don't want to duplicate effort.
PrimeSieve: This is an interface to the (probably) fastest
opensource prime number sieve, and the (probably) most extensive
tables of the prime pi function (but only about 4 megabytes). It
also