I'm looking for program(s) capable of trial-factoring
prime exponent Mersenne numbers (using 2kp+1) meeting
the following requirements:
1) Capable of trial-factoring any exponent > 1
(at least to some considerably large number,
say 1 trillion?)
As I recall, Brian [Beesley] mentioned something once
about having a program that could test an exponent
of an arbitrary size... Brian??
2) Capable of testing a factor of any size.
(even over the 2^76 limit of Prime95).
I just know somebody is going to have to mention the
time involved in testing factors of such a large size.
Let me just say, I realize *exactly* how much time
would be required...
3) Capable of trial-factoring a range of k's.
(example: from k=1000 to k=2500)
It would be best if all three of the requirements
could be fulfilled by a single program...
Can anybody be of some help???
Eric Hahn
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
