Timeline for How many integers are of the form $n/d(n)$, where $d(n)$ is the number of divisors of $n$?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2014 at 23:28 | comment | added | Lucia | @Charles: I think your argument is unclear and possibly flawed -- at least I haven't understood it. Could you write it carefully -- it has several typos, and the second part of it seems unclear to me. | |
| Jun 2, 2014 at 23:14 | comment | added | Charles | @Lucia: A slightly weaker claim would be that their density is 0. | |
| Jun 2, 2014 at 23:02 | comment | added | Lucia | The argument claims that the exceptions have density 1; I don't think that is true. | |
| Jun 2, 2014 at 23:01 | comment | added | Emil Jeřábek | And the second inequality needs to read the other way round, that is, $x<n^{1-0.7/\log\log n}$. | |
| Jun 2, 2014 at 22:55 | comment | added | Emil Jeřábek | All the $+$ should be $-$. | |
| Jun 2, 2014 at 19:44 | comment | added | Lucia | I'm not sure I understand your argument. What exactly are you claiming about the set of numbers of the form $n/d(n)$? | |
| Jun 2, 2014 at 19:38 | comment | added | The Masked Avenger | Hmm. n/ something bigger than 1 is bigger than x if x is bigger than n times something else bigger than 1. One of us is doing something wrong. | |
| Jun 2, 2014 at 19:14 | history | answered | Charles | CC BY-SA 3.0 |