Hi,
At 04:24 PM 4/21/00 -0400, [EMAIL PROTECTED] wrote:
>I'm in agreement with Brian Beesley on this issue:
>especially now that there's the capability to do P-1, I
>think sieving to > 64 bits will prove to be a waste of
>time, since we should be able to find nearly all the
>factors > 64 bits that sieving would turn up more
>cheaply using P-1.
I examined this for exponent 15,000,971 assuming 32MB
of available memory. If prime95 only factors to 2^64, then
the P-1 bounds chosen will be B1=180000 and B2=800000.
These bounds will find only 28% of 65-bit factors.
Therefore, while an adjustment to the factoring limits makes
theoretical sense, the effect would be rather minimal.
Regards,
George
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
