Timeline for Question on the 52nd (known) Mersenne prime number
Current License: CC BY-SA 4.0
15 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 22 at 10:10 | comment | added | Wojowu | I believe there have been some changes in how exactly GIMPS operates in the past few years so the answer may be different from the one 6 years ago. I think rather than completely overwrite this question it would have been better to add a footnote in the question about the new data. | |
Oct 22 at 8:49 | history | edited | José Hdz. Stgo. | CC BY-SA 4.0 |
added 9 characters in body; edited title
|
Jan 17, 2019 at 18:00 | history | edited | José Hdz. Stgo. | CC BY-SA 4.0 |
deleted 6 characters in body
|
Mar 14, 2018 at 23:26 | comment | added | Jeppe Stig Nielsen | Note that they have not discovered the Mersenne primes "in order". The huge find $M_{43 \, 112 \, 609}$ was done in August 2008. When $M_{37 \, 156 \, 667}$ was found only fourteen days later (September 2008), it was not a record. Both primes were announced in mid September 2008. Then many months later (either in April 2009 or June 2009, depending on whether you define "discovered" as the time when a machine finished the calculation, or as the time when a person becomes aware of the result), $M_{42 \, 643 \, 801}$ was discovered and was also not a record at the time. | |
Jan 22, 2018 at 3:01 | review | Close votes | |||
Jan 22, 2018 at 9:31 | |||||
Jan 18, 2018 at 19:46 | vote | accept | José Hdz. Stgo. | ||
Jan 16, 2018 at 17:44 | answer | added | Aaron Meyerowitz | timeline score: 10 | |
Jan 16, 2018 at 14:49 | answer | added | Timothy Chow | timeline score: 18 | |
Jan 16, 2018 at 14:44 | review | Close votes | |||
Jan 16, 2018 at 16:33 | |||||
Jan 16, 2018 at 8:40 | comment | added | Jan Grabowski | You should have a look at how GIMPS works: mersenne.org/various/works.php In particular, the work (factoring or prime checking) a particular user gets is not entirely within their control, and as in any system of distributed work, it is not always efficient to work through a problem in strict linear order. | |
Jan 16, 2018 at 7:42 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
added 97 characters in body
|
Jan 16, 2018 at 7:30 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
added 97 characters in body
|
Jan 16, 2018 at 7:14 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
deleted 4 characters in body
|
Jan 16, 2018 at 7:08 | history | edited | José Hdz. Stgo. | CC BY-SA 3.0 |
deleted 4 characters in body
|
Jan 16, 2018 at 7:00 | history | asked | José Hdz. Stgo. | CC BY-SA 3.0 |