![]() |
M(57,885,161)
Some unanswered questions:
What machine found it? How far had it been TFed? Who did the last bitlevel? I ask the last question because this task is relatively unrewarding factor-finding-wise, but valuable to the LL test. To encourage TFing to the optimum level, I think it appropriate that the person who did it should be rewarded with a token acknowledgement when a prime is discovered. Perhaps P-1 deserves similar. D |
[QUOTE=davieddy;335883]How far had it been TFed?
Who did the last bitlevel?[/QUOTE] [url]http://www.mersenne.ca/exponent/57885161[/url] It had been TFd to 73 bits, the last bit level by Jerry Hallett. It had stage 1-only P-1 run at B1=710000 by an unknown machine (might've been the one that tested it as prime, but as it had previously been reserved and subsequently unreserved/expired by two separate anonymous assignees, one of them might have done it). I think Cooper had mentioned the machine's ID that found the prime in some interview... Edit: Here's an [URL="http://www.ucmo.edu/news/prime.cooper.2013.cfm"]article with a pic[/URL] of Cooper with the computer; it calls it "Computer #22 in a computer lab in Wood 210 on the UCM campus" |
THX Mini
[URL="http://www.youtube.com/watch?v=ukOs3am7CtE"]King Curtis[/URL] Expect to see this appear in "useless posts" shortly. (Reason: lack of imagination on the part of the mod concerned) D |
[QUOTE=davieddy;335883]Who did the last bitlevel?
[...] To encourage TFing to the optimum level, I think it appropriate that the person who did it should be rewarded with a token acknowledgement when a prime is discovered.[/QUOTE] Perhaps the real kudos should go to anyone who now trial factors M57885161 to further bit levels, discovers a factor, and thereby proves that the axioms on which mathematics has been based are inconsistent. Then GIMPS really will go down in history as discovering something important.:devil: |
| All times are UTC. The time now is 22:27. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.