Timeline for Number of divisors of an integer of form 4n+1 and 4n+3
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 18, 2014 at 14:05 | history | suggested | lennon310 | CC BY-SA 3.0 |
math formatting
|
| Oct 18, 2014 at 13:58 | review | Suggested edits | |||
| S Oct 18, 2014 at 14:05 | |||||
| Mar 22, 2011 at 11:55 | vote | accept | pranay | ||
| Mar 18, 2011 at 19:36 | history | reopened |
Douglas Zare Peter Shor Emerton Dan Petersen Yemon Choi |
||
| Mar 18, 2011 at 19:18 | comment | added | Douglas Zare | The question on meta is an approach to showing that the answer is "no." It is not equivalent, since it is possible that determining $(D_1(n),D_3(n))$ takes as long as factoring, but that the information doesn't help much in factoring $n$. If you feel this whole question is trivial, please elaborate, perhaps as an answer. | |
| Mar 18, 2011 at 17:13 | comment | added | user6976 | I do not see a connection between the list of divisors and the number of representations as a sum of two squares. The question on meta "if we have an oracle telling the number of divisors of two kinds, can we factor faster" is interesting but did not appear in the new edition of the question. Still I am not against reopening it since somebody thinks it is a non-trivial question. | |
| Mar 18, 2011 at 16:37 | comment | added | Peter Shor | See also mathoverflow.net/questions/57981/… | |
| Mar 18, 2011 at 16:29 | history | edited | Douglas Zare | CC BY-SA 2.5 |
rewrote question incorporating part of Joe Silverman's answer
|
| Mar 18, 2011 at 15:57 | comment | added | Douglas Zare | I agree that it could be written to be slightly clearer. I do not understand the votes to close as "too localized;" did people misread the question? This appears far from trivial. I am voting to reopen. | |
| Mar 18, 2011 at 0:30 | history | closed |
Andrés E. Caicedo Will Jagy David Hansen Aaron Meyerowitz user6976 |
too localized | |
| Mar 17, 2011 at 23:50 | comment | added | Michael Lugo | Douglas: I have not voted to close, but I find it a bit difficult to tell exactly what the asker is asking. | |
| Mar 17, 2011 at 23:38 | answer | added | Joe Silverman | timeline score: 12 | |
| Mar 17, 2011 at 13:20 | comment | added | Douglas Zare | I don't understand the votes to close. Am I missing something? | |
| Mar 17, 2011 at 2:08 | comment | added | user9072 | Often the answer to this kind of question is 'no, it is not much easier than factorin' see for example here mathoverflow.net/questions/3820/… . This is of course not exactly what you are asking for, but perhaps sufficiently related to be useful. | |
| Mar 17, 2011 at 1:58 | answer | added | Gerhard Paseman | timeline score: 3 | |
| Mar 17, 2011 at 1:10 | history | asked | pranay | CC BY-SA 2.5 |