Timeline for 3-term arithmetic progressions of terms as frequent as primes
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 8, 2015 at 22:45 | vote | accept | Włodzimierz Holsztyński | ||
| Dec 8, 2015 at 10:32 | history | edited | Fedor Petrov | CC BY-SA 3.0 |
added 124 characters in body
|
| Dec 8, 2015 at 9:54 | comment | added | Włodzimierz Holsztyński | Fedor, thank you for your answer (and for interpreting my question in the intended way rather than according to my accidental mishandling it). I am not a number theory specialist (or anything :) ), and I never saw a similar result. Thus I feel good about my question. | |
| Dec 8, 2015 at 9:48 | comment | added | Włodzimierz Holsztyński | @quid "The terms there are not consecutive, though." Sorry, my brain doesn't function properly (only too often). I've already fixed my mis-formulation. | |
| Dec 8, 2015 at 9:21 | comment | added | user9072 | The terms there are not consecutive, though. (Yet then I think this condition might better be dropped from the question.) Moreover, Bloom has an improvement on the result of Sanders but the general shape rests as you state (he saves $(\log \log n)^2$) see arxiv.org/abs/1405.5800v2 | |
| Dec 8, 2015 at 9:11 | history | answered | Fedor Petrov | CC BY-SA 3.0 |