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
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| May 1, 2016 at 10:14 | history | edited | Tony Huynh | CC BY-SA 3.0 |
Improved the title of the question.
|
| Jun 2, 2014 at 23:50 | comment | added | Lucia | Since this question now has 4 close votes, I wish to say that I agree with Greg Martin that the question seems perfectly fine for MO. I don't know how many exceptional $I$ there are up to $x$, and it seems not easy. Naturally there may be many opinions on the interest of the question, but perhaps that applies to many problems on MO. | |
| Jun 2, 2014 at 20:13 | answer | added | Tony Huynh | timeline score: 16 | |
| Jun 2, 2014 at 19:15 | comment | added | Charles | @GregMartin: In that case I'll answer it. | |
| Jun 2, 2014 at 19:14 | answer | added | Charles | timeline score: 2 | |
| Jun 2, 2014 at 18:57 | comment | added | user51538 | This questions is not too basic for mathoverflow. How can it be so when I can barely even understand the question? | |
| Jun 2, 2014 at 18:37 | comment | added | Greg Martin | I disagree - I think this is unlikely to be resolved except through research-level methods, yet it is quite possible that it can be resolved, at least partially. So I think the question fits the parameters for mathoverflow. | |
| Jun 2, 2014 at 18:36 | review | Close votes | |||
| Jun 3, 2014 at 8:41 | |||||
| Jun 2, 2014 at 18:31 | comment | added | Charles | This question is too basic for mathoverflow. You may find oeis.org/A036763 useful, though. | |
| Jun 2, 2014 at 18:07 | history | asked | Shivam Patel | CC BY-SA 3.0 |