Timeline for Elementary Proof of Basis of Order k
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 4, 2012 at 5:23 | vote | accept | user26147 | ||
| Sep 3, 2012 at 10:53 | history | edited | js21 | CC BY-SA 3.0 |
edited body
|
| Sep 3, 2012 at 6:41 | history | edited | js21 | CC BY-SA 3.0 |
added 907 characters in body; deleted 1 characters in body
|
| Sep 3, 2012 at 3:02 | comment | added | Stanley Yao Xiao | One can obtain that as a lower bound fairly easily; but it is certainly not true as an upper bound. For instance the set of integers is an additive basis of any order, but is much denser than that. | |
| Sep 2, 2012 at 18:56 | comment | added | user26147 | @js: out of curiosity, what is the simple counting argument for X^{1/k + o(1)} ? | |
| Sep 2, 2012 at 13:43 | history | edited | js21 | CC BY-SA 3.0 |
added 19 characters in body
|
| Sep 2, 2012 at 10:20 | history | answered | js21 | CC BY-SA 3.0 |