Timeline for What is the crucial difference the Maynard/Tao approach and Goldston-Pintz-Yildirim that extends to prime k-tuples with $k>2$
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2013 at 8:32 | vote | accept | Anurag Sahay | ||
| Nov 23, 2013 at 22:12 | comment | added | user5810 | "$g_n \: = \: p_{n+1}-p_n \;\;$ satisfies $\: g_n = o(\log p_n) \:$" $\;$ is significantly stronger than the lim_inf condition. $\hspace{.48 in}$ | |
| Nov 23, 2013 at 20:51 | answer | added | Eric Naslund | timeline score: 40 | |
| Nov 23, 2013 at 19:12 | vote | accept | Anurag Sahay | ||
| Nov 24, 2013 at 8:32 | |||||
| Nov 23, 2013 at 18:09 | comment | added | Stanley Yao Xiao | Just FYI, this type of question is of the most suitable type for MO, so no worries! | |
| Nov 23, 2013 at 17:57 | answer | added | Stanley Yao Xiao | timeline score: 4 | |
| Nov 23, 2013 at 17:50 | history | edited | Anurag Sahay | CC BY-SA 3.0 |
changed n to p_n in the gpy result
|
| Nov 23, 2013 at 17:47 | review | First posts | |||
| Nov 23, 2013 at 17:49 | |||||
| Nov 23, 2013 at 17:29 | history | asked | Anurag Sahay | CC BY-SA 3.0 |