Factoring this number is trivial (it's prime). Storing all the primes up to this number will not be possible, ever.
----- Original Message ----- From: [email protected] Date: Thursday, May 7, 2009 12:42 Subject: Re: [Jprogramming] table of primes to 1,000,000,000 or more To: Programming forum <[email protected]> > > Currently the biggest mersenne prime is: > > <: 2^43112609 which is a 12,978,189 decimal digits long. > > Factoring this number is not done in a few moments. > > Also storing all the primes up to this number is "NOT > POSSIBLE" now. > > In the future, I hope it will be possible. > > ----- Original Message Follows ----- > From: Zsbán Ambrus <[email protected]> > To: Programming forum <[email protected]> > Subject: Re: [Jprogramming] table of primes to 1,000,000,000 > or more > Date: Fri, 24 Apr 2009 18:40:24 +0200 > > >The point is, an average home computer can easily test the > >primality of any one really huge number in a few moments ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
