Timeline for What results would follow from or imply "randomness" of the primes?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| May 20, 2011 at 23:45 | answer | added | Simon Lyons | timeline score: 2 | |
| May 20, 2011 at 23:17 | comment | added | Kimball | In "practical" terms, this is presumably tied up with the question: is integer factorization hard? I.e., the security of RSA. | |
| May 20, 2011 at 21:36 | answer | added | Frank Thorne | timeline score: 7 | |
| May 20, 2011 at 21:36 | answer | added | Timothy Chow | timeline score: 9 | |
| May 20, 2011 at 21:24 | comment | added | Stanley Yao Xiao | I haven't investigated this to form an answer, but I do believe the Goldbach conjecture would follow if the primes were 'random'. | |
| May 20, 2011 at 21:08 | answer | added | Felipe Voloch | timeline score: 6 | |
| May 20, 2011 at 20:36 | comment | added | user9072 | Many conjectures in Analytic Number Theory follow or are based on suitable 'random distribution assumptions,' for a certain type of Analytic Number Theory most likely even most; I am worried this will be a long list. If I may make a suggestion: asking for a high-level explanation illustrated by selected examples, might make a better question. | |
| May 20, 2011 at 20:18 | history | edited | Steve Huntsman | CC BY-SA 3.0 |
added 31 characters in body; added 2 characters in body
|
| May 20, 2011 at 19:51 | history | asked | Steve Huntsman | CC BY-SA 3.0 |