My previous announcement contained errors. Here it is again.
You can download 'MFAC' from
http://www.ltkz.demon.co.uk/ar2/mfac225.zip
and e-mail me for a range.
MFAC searches for divisors of double-Mersenne numbers M_M_e = 2^(2^e-1)
- 1 for not-too-large exponents e. MFAC runs on any PC from a 486
upwards and on any system that supports MSDOS. You can even run it
entirely from a bootable diskette. Memory usage is small and the files
require less than a megabyte of disk space. The program is easily
stopped and restarted.
I have volunteered to coordinate a search for factors of M_M_61.
Let d be a divisor of M_M_61. Then we know that
d = N*(2^61 - 1) + 1.
The parameters I intend to send out will set up MFAC to look
for divisors of M_M_61 with N's in ranges of 204,204,000,000
To give some idea about timing, an AMD K6/2/400 will do a
range in about 4 days.
I intend to out ranges from N = 10^14 approx. to avoid clashing with
work currently in progress by Sturle Sunde.
--
Tony
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
