Timeline for Can a number be factored quickly, given the sum of its prime factors?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 7, 2011 at 4:10 | comment | added | S. Carnahan♦ | Suppose someone gives you an arbitrary integer $N$ together with the sum of its prime factors. In general, you won't have any "structural properties" you can use. This question is asking about worst-case performance, not how well we can factor the rare numbers that happen to be nontrivial perfect powers. | |
| Mar 7, 2011 at 2:06 | history | answered | Jose Arnaldo Bebita | CC BY-SA 2.5 |