Timeline for Linear equation with primes
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2010 at 5:12 | history | edited | Charles |
edited tags
|
|
| Jan 3, 2010 at 23:00 | vote | accept | Manuel Silva | ||
| Dec 31, 2009 at 7:28 | answer | added | Terry Tao | timeline score: 15 | |
| Dec 31, 2009 at 7:13 | comment | added | David Lehavi | @Gjergji: here is the link to the preprint: arxiv.org/pdf/math/0606088v2 | |
| Dec 31, 2009 at 4:36 | comment | added | Gjergji Zaimi | Well, there is the work of Tao and Green about linear equations in primes, but it does not contain these cases terrytao.wordpress.com/2008/11/18/… | |
| Dec 31, 2009 at 4:26 | history | edited | Charles Siegel |
edited tags
|
|
| Dec 31, 2009 at 4:17 | comment | added | Ben Weiss | Ah, very true, I'll head back and delete those comments. If $k$ is fixed, then this is a notoriously difficult problem. | |
| Dec 31, 2009 at 4:07 | comment | added | fedja | Come on, guys, varying $k$ is just the Dirichlet's theorem about primes in arithmetic progressions! Of course, neither I, nor Manuel meant that. | |
| Dec 31, 2009 at 3:49 | comment | added | fedja | $k=2$, $n=1$ is another well-known open problem (Sophie Germain primes) and so are all other cases except the ones when trivial considerations modulo some number garantee that there may be only finitely many solutions. I will be genuinely surprised if a technique is invented that will allow to solve some but not all nontrivial questions in this series. | |
| Dec 31, 2009 at 3:49 | comment | added | Qiaochu Yuan | Do you have any reason to expect that this is easier than the twin prime conjecture? | |
| Dec 31, 2009 at 3:33 | history | asked | Manuel Silva | CC BY-SA 2.5 |