a. p:2x^27 produces a single prime number, not a vector of primes. b. There are approximately n%^.n primes less than n. For n=.2^2203, n%^.n is roughly 1e660. There is no computer big enough to hold that many numbers. (The number of particles in the universe is less than 1e100.)
----- Original Message ----- From: [email protected] Date: Sunday, April 12, 2009 16:03 Subject: [Jprogramming] table of primes to 1,000,000,000 or more To: Programming forum <[email protected]> > I am using j64-602 > > p: 2x^27 > > produces a vector of primes ok, but Very Slowly. > > Does anybody know where I can find a comma delimited file of > prime numbers. > > As a starting point, maybe all primes up to <: 2x^2203 which > is > the 16th Mersenne prime and is 664 decimal digits long. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
