Timeline for Goldbach conjecture and the difference of two primes
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23 at 18:07 | answer | added | Sylvain JULIEN | timeline score: -1 | |
| Nov 13, 2023 at 14:29 | comment | added | Michael Lugo | Relevant OEIS sequence: oeis.org/A047160, "a(n) = smallest number m >= 0 such that n-m and n+m are both primes" - I was hoping for a pointer into the literature, but nothing there. | |
| Nov 13, 2023 at 10:04 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jul 16, 2023 at 12:12 | comment | added | Gerry Myerson | I think there has been more (computational) work on how to make $p-q$ as big as possible, than as small as possible. | |
| Jul 16, 2023 at 11:08 | comment | added | David E Speyer | If you look at the ternary Goldbach problem, it is known that every sufficiently large odd number can be written as $p_1+p_2+p_3$ with $p_i = n/3 + O(n^{11/20+\epsilon})$. arxiv.org/abs/1610.02017 | |
| Jul 16, 2023 at 10:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 16, 2023 at 9:15 | answer | added | TravorLZH | timeline score: 1 | |
| Jun 12, 2023 at 10:03 | comment | added | Wojowu | Almost certainly there are no actually proven results in this direction. But one can ask for heuristics, or about what is known for most numbers (since we know Goldbach holds for most even numbers, I imagine results of this sort might be available). | |
| Jun 12, 2023 at 9:38 | comment | added | Geoffrey Irving | As a first heuristic, if we start at $p = q = n$ and walk outwards, the expected time to hit primes would be $O(\log^2 n)$. So an upper bound is probably that plus another $\log \log n$ factor? | |
| Jun 12, 2023 at 8:37 | history | asked | P.-S. Park | CC BY-SA 4.0 |