Stefan Struiker wrote:
> Reto:
>
> First question: goto
>
> http://www.informatik.tu-muenchen.de/~kruppa/f98/
>
> for factor98.exe download and info.
Uh oh, a link to an almost forgotten web page of mine! The Fact98.exe file is
fine (now, I had to make it chmod a+r again), but the checkpoint files may be
out of date - check with Will Edington whether he has ones that are factored
further. There are not that many on my page, anyways, and the uploading
never worked particularly well..
Please note that Factor98 has no stage 2 - factoring to high bounds with
Prime95 will be about 20 times (rough guess) faster. Also, IMHO trying to
find a factor with extremely high P-1 bounds is rather inefficient, I think
it would almost always be better to spend the time on a few ECM curves.
> Anyone else for the other questions?
Hmmm... the size of residues are the same for ECM and P-1 for the same
exponent, and I *think* ECM needs to store only one residue per entry in the
multiples-of-stage-1-residue, in which case the memory requirement for ECM
and P-1 would be roughly the same for the same exponent and the same bounds,
but I'm not quite sure.
Ciao,
Alex.
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
