roger lindley claims to have something original, but seems to be reluctant to divulge details. OK, so be it. Instead of endlessly arguing with him, let's invite him to put up or shut up.
So, roger, here's a challenge: Using the Lucas-Lehmer algorithm, I'm doing an investigation of the primality of 2^p - 1, where p = 31798511. Expected running time on my 3 MHz machine is somewhat over a month. Turn your Fortran program loose on the same problem, roger, and let us know your total running time and memory requirement. -- Bob Margulies [EMAIL PROTECTED] www.palosverdes.com/sbcms _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
