Timeline for Thin subbases for the primes?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2011 at 7:55 | comment | added | Gerhard Paseman | Thomas, not quite. As in bounds on Warings problem, there are finitely many numbers that require (something like) 9 cubes, while the rest are at most asum of 8 cubes. Vinogradov did not show that EVERY odd integer is tne sum of 3 primes, he showed all but finitely many are. O. Ramare was part of the team that arrived at the value 6. Gerhard "Ask Me About System Design" Paseman, 2011.02.28 | |
| Mar 1, 2011 at 6:33 | answer | added | Mark Lewko | timeline score: 2 | |
| Mar 1, 2011 at 6:09 | comment | added | Thomas Bloom | Doesn't Vinogradov's theorem give that the primes are a basis of order 4? | |
| Mar 1, 2011 at 5:37 | history | edited | Stanley Yao Xiao |
edited tags
|
|
| Mar 1, 2011 at 5:16 | history | asked | Stanley Yao Xiao | CC BY-SA 2.5 |