Timeline for Sets of integers "a little less dense" than the set of prime numbers
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25 at 21:20 | answer | added | Christian Elsholtz | timeline score: 4 | |
| Feb 18 at 0:11 | comment | added | Steven Stadnicki | Such a set 'should' have density proportional to $1/\left(\log(x)\log\log(x)\right)$, to give some sense of what sorts of things to look for. | |
| Feb 17 at 22:36 | comment | added | Stefan Kohl♦ | @GerryMyerson Of course it shouldn't be $o(\log(\log(\log(N))))$. I made this explicit now in the question. | |
| Feb 17 at 22:33 | history | edited | Stefan Kohl♦ | CC BY-SA 4.0 |
Exclude trivialities.
|
| Feb 17 at 22:24 | comment | added | Gerry Myerson | big-oh just means "less than a constant times", so the empty set qualifies. But presumably you also want some lower bound on $S_A(N)$. | |
| Feb 17 at 20:28 | comment | added | so-called friend Don | One candidate might be the "Golomb primes" as studied by Erdos in On a problem of G. Golomb, J. Austral. Math. Soc. 2 (1961/1962), 1--8. See renyi.hu/~p_erdos/1961-10.pdf The asymptotic of the main theorem implies that the reciprocal sum of Golomb primes to $N$ is $\sim \log \log \log N$ | |
| Feb 17 at 20:02 | history | asked | Stefan Kohl♦ | CC BY-SA 4.0 |