Timeline for Sparse sets of numbers with the Goldbach property
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2015 at 18:28 | comment | added | David E Speyer | See mathoverflow.net/questions/74594 | |
| Mar 10, 2015 at 18:24 | comment | added | Todd Trimble | I changed "spare" in the title to "sparse". Please roll back if this is not what you intended. | |
| Mar 10, 2015 at 18:23 | history | edited | Todd Trimble | CC BY-SA 3.0 |
corrected a misspelling
|
| Mar 10, 2015 at 17:35 | comment | added | Stanley Yao Xiao | Erdos showed that there are sets $S$ with density as low as $O(n^{1/2 + \epsilon})$ are actually additive bases; meaning every large positive integer lies in $2S$. For concrete sets, it should be accessible to prove that semi-primes of finite order (say, numbers with at most $k$ prime factors) have the Goldbach property, and they are not much denser than the primes themselves. | |
| Mar 10, 2015 at 17:30 | history | asked | Asterios Gkantzounis | CC BY-SA 3.0 |