On 25 Feb 00, at 16:52, George Woltman wrote:
> However, it must be pointed out that at some point you are better off
> switching to ECM rather than expanding the P-1 bounds. I'm not sure what
> that point is.
And, at some point, ECM itself gives way to CFRAC, SNFS, ...
It's possible to find pathological examples of numbers which are
easily factored by any one method but practically impervious to the
others.
The resources needed must be taken into account. ECM on Mersenne
numbers with exponents well into the millions is going to be slow &
_very_ memory intensive. Let's get P-1 going first & "argue" about
implemeting ECM (for "trial factoring" of large exponents) later.
Regards
Brian Beesley
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
