Timeline for Does the algorithm of the Greeks produce all prime numbers?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2018 at 21:32 | history | edited | user44191 | CC BY-SA 4.0 |
edited body
|
| Dec 3, 2018 at 21:32 | comment | added | Henry | The OEIS A000945 b-file gives $p_{50}=31$ | |
| Dec 3, 2018 at 19:10 | comment | added | user44191 | @YaakovBaruch I don't have an answer for you, but I do see multiple references to a heuristic argument by Daniel Shanks in the Bulletin of the Institute of Combinatorics and its Applications (specifically, in 1991). Unfortunately, I can't find the argument itself. | |
| Dec 3, 2018 at 15:36 | vote | accept | Zidane | ||
| Dec 3, 2018 at 14:07 | comment | added | Yaakov Baruch | Any idea what the euristic expected asymptotic growth of the least missed prime $p_n$ at step $n$ would be? (Sorry for this sentence's violence to the English language.) | |
| Dec 3, 2018 at 1:56 | history | edited | LSpice | CC BY-SA 4.0 |
PDF -> abs; name of arXiv paper; inlined links
|
| Dec 2, 2018 at 22:26 | history | answered | user44191 | CC BY-SA 4.0 |