Timeline for Known additive bases with irregular counting function
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2011 at 4:53 | answer | added | Anthony Quas | timeline score: 7 | |
| Feb 14, 2011 at 0:59 | comment | added | user9072 | @Aaron Meyerowitz: note that the number of elements one is allowed to sum is fixed (it is specified by h). Though analog question could be asked for distinct summands too, both make sense (and are studied); in fact there is a recent question of the OP sort-of comparing the two notions, see mathoverflow.net/questions/54493/… | |
| Feb 14, 2011 at 0:52 | comment | added | Anthony Quas | How about numbers whose first decimal digit is a 1? (a basis of order 6) Then the counting function varies between $n/9$ and $5n/9$ | |
| Feb 14, 2011 at 0:36 | comment | added | Aaron Meyerowitz | Are you sure that you want to allow repeats? Then if you have 1 in the set or $a,b$ with $\gcd(a,b)=1$ then you already have an additive basis so you can do whatever you wish after that. | |
| Feb 14, 2011 at 0:22 | answer | added | dankane | timeline score: 4 | |
| Feb 14, 2011 at 0:22 | history | edited | Stanley Yao Xiao | CC BY-SA 2.5 |
edited body
|
| Feb 14, 2011 at 0:07 | history | asked | Stanley Yao Xiao | CC BY-SA 2.5 |