> >Who needs to? I have code which tries any number up to 2^95 as a
> factor of a Mersenne number with an exponent up to approx. 600
> million, using less than 1 KByte of code space and 32 bytes of data
> storage. It executes in a time proportional to the logarithm of the
> exponent - for an exponent around 35 million, it takes approximately
> 2000 CPU clocks i.e. 4 microseconds per test on a 500 MHz CPU.
This is a bit misleading, more accuratly, it runs in time proportional
to lg(p)*lg^2(n), where p is the exponent, and n is the potential factor.
Just call me "Mr. Pedantic". :)
-Lucas Wiman
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
