Timeline for Is there a known primitive recursive upper bound on the nth "Zhang prime"
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2014 at 3:30 | comment | added | NAME_IN_CAPS | In its most bland form, I think Zhang's original result was ineffective, in that it relied on bounds on Siegel zeros via Bombieri-Vinogradov. However, it is well known how to modify the large sieve in such a way to effectively skirt around a possible exceptional modulus -- see for instance Section 12 of "Primes in tuples II" by Goldston, Pintz, and Yildirim. | |
| Dec 13, 2014 at 3:13 | vote | accept | Jason Rute | ||
| Dec 13, 2014 at 3:09 | answer | added | Jeremy Rouse | timeline score: 14 | |
| Dec 13, 2014 at 2:24 | history | asked | Jason Rute | CC BY-SA 3.0 |