> >Now, I think that it might be a nifty (tm) idea if GIMPS/primenet
> >were to start looking for factors of double Mersenne numbers. If I
> >understand correctly, much of the code is already written (changes to
> >the P-1 code, and the normal factoring code), and I'm sure that such things
> >could interest mathematicians more than finding the next Mersenne prime.
>
> The only feasible approach for M_M_61 and above is trial-division. I
I was speaking about using part of the P-1 code to speed up trial
factoring for the larger exponents (though, of course an FFT multiply is
included in the LL code, but I don't think they are the same one (P-1
has to n*m, whereas LL has to by n*n))
> recently blew the dust off by my program MFAC and gave it a run. For
> M_M_61 it processes divisors N*M_61 + 1 on an AMD/400 at about 2.2
> billion N's per hour. (6 billion/hour for M_M_31.) If people are
> interested, and unless someone else can do better, after a bit of
> tidying up I can make this program available.
Q: Is this program in ANSI C? It would probably be a good idea to
do so if not, as this would attract UNIX users...
-Lucas
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
