I agree, I was going down the wrong path. If there are ~ 10^100 atoms in the universe, you could not create a memory that would hold 10^100 bits. If you could, you would have to create a memory module which with have at least 10^100 atoms. That would increase the number of atoms in the universe by 100%, which is not possible.
It would take a lot more than 10^100 bits of memory to hold all the primes less than 10^100. the current largest known prime (I think) is <: 2x^43112609 which is way bigger than 10^100 ----- Original Message Follows ----- From: Roger Hui <[email protected]> To: Programming forum <[email protected]> Subject: Re: [Jprogramming] table of primes to 1,000,000,000 or more Date: Sun, 12 Apr 2009 16:54:01 -0700 >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 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
