Timeline for On conjectures about the arithmetic function that counts the number of Sophie Germain primes
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 31, 2023 at 22:27 | comment | added | Gerry Myerson | Sophie Germain primes are tabulated, with many references and links, at oeis.org/A005384 | |
Jun 20, 2023 at 22:49 | comment | added | mick | You might be interested in this strange phenomenon that appears for small numbers and maybe persists ? math.stackexchange.com/questions/3790597/… | |
Aug 20, 2022 at 16:24 | vote | accept | user142929 | ||
Aug 16, 2022 at 23:28 | history | became hot network question | |||
Aug 16, 2022 at 16:42 | answer | added | Will Sawin | timeline score: 6 | |
Aug 16, 2022 at 15:41 | comment | added | user142929 | To be honest, I wrote it, but now I can't remember why from the small computational evidence I got, Conjecture 2 seemed false to me. If you say the opposite sure that you're right professor @WillSawin Feel free to expand your comment as an answer, sure that it is excellent. | |
Aug 16, 2022 at 15:37 | comment | added | Will Sawin | Why do you think Conjecture 2 is false? My work with Shusterman should imply some similar statement over function fields. Or, more clearly, should imply an asymptotic for the number of such primes with power savings error term, and then one can easily convert an asymptotic into an upper bound like that. | |
Aug 16, 2022 at 15:32 | comment | added | user142929 | Two years ago I've edited the post on MathOverflow with identifier 363012 and title On a conjecture about the arithmetic function that counts the number of twin primes I add this comment if you can to read or contibute to it. | |
Aug 16, 2022 at 15:28 | history | asked | user142929 | CC BY-SA 4.0 |