Timeline for Can the following quantitative version of Chen's theorem be obtained?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 6, 2014 at 9:07 | history | edited | Stanley Yao Xiao | CC BY-SA 3.0 |
added 93 characters in body
|
| Apr 5, 2014 at 23:06 | comment | added | Stanley Yao Xiao | Yes I noticed that in the proof of Chen's theorem in Nathanson's book, one can take the smaller factor to be as small as $N^{1/3}$, so I modified the question. | |
| Apr 5, 2014 at 23:05 | history | edited | Stanley Yao Xiao | CC BY-SA 3.0 |
added 587 characters in body
|
| Apr 5, 2014 at 22:45 | comment | added | The Masked Avenger | It seems likely that all the representations will have q_2 be less than N^1/2. I suspect that f can be something like log_k N for any fixed iterate k of log and still have an increasing number of representations for N big enough. | |
| Apr 5, 2014 at 22:23 | history | asked | Stanley Yao Xiao | CC BY-SA 3.0 |