At 10:19 AM 11/14/01 -0500, you wrote: >There has been an unverified prime reported! It passes the 32-bit security >code that comes on every results.txt line. This is not overly difficult >to forge >though. The user reporting the prime has completed 3 other LL tests and >seems to have signed up with a valid looking email address. > >I'll start a verification run on this Mersenne number of over 3,500,000 >digits.
FYI, folks, this would make "p", the exponent/assignment, greater than 11,626,750. It will take a Pentium 4 of 1.8 Ghz about 5.5 days to double-check this result. Of course, if it isn't a P4, or isn't that fast, it won't be this fast. (i.e. if the testing machine was WinIntel, the double-check will likely be run on Linux using mprime, or some other not-identical system). Don't expect an answer this week, or even next (unless George can fill us in on the iron being used for the double-check). Patience is a virtue. Some infonuggets: There are only 2,718 people who have tested exactly 3 or 4 LL tests, though, so that narrows it down a *bit*. It wasn't erroneously listed in the cleared list this time (like it was for M37), but a REALLY enterprising person (with access to the assigned exponents list for November TWELFTH) could probably narrow it down to a handful of candidates... ;-) Does this "general area" of somewhat greater than 11.6MM tend to fit the "Mersenne Island" conjecture? It seems to me that it would... unless George is being intentionally secretive about the size (i.e. > 3,500,000 digits COULD be 6,000,000 digits -- I'm assuming it is of the close order of that range, though). _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
