Timeline for What is the growth rate for divisibility of integers
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2012 at 6:44 | comment | added | Dimitris Koukoulopoulos | Also, the "normal order" of $\Omega(n)$ is $\log\log n$. This means that for every fixed $\epsilon>0$ the density $\\#\\{ n\le N:|\Omega(n)-\log\log n|\le\epsilon\log\log n\\}/N$ tends to 1 as $N\to\infty$. So, `with probability 1' $\Omega(n)$ lies in $[(1−\epsilon)\log\log n,(1+\epsilon)\log\log n]$. | |
| Jan 11, 2012 at 22:27 | comment | added | Will Jagy | @Charles, thanks for the value of $B_2$ | |
| Jan 11, 2012 at 19:51 | comment | added | Charles | $B_2=1.0346538\ldots,$ see oeis.org/A083342. | |
| Jan 1, 2012 at 18:49 | vote | accept | David Spivak | ||
| Jan 1, 2012 at 0:57 | history | edited | Will Jagy | CC BY-SA 3.0 |
added 7 characters in body
|
| Jan 1, 2012 at 0:49 | history | answered | Will Jagy | CC BY-SA 3.0 |