Timeline for Is there a method to find the prime factorization of a number(integer) if the prime factorization of the previous number(integer) is known?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 8, 2016 at 13:23 | comment | added | Steven Landsburg | But it's still possible that a) there is an algorithm $A$ for computing the prime factorization of $n+1$ given the prime factorization of $n$, b) $A$ runs faster than any algorithm that does not take as given the prime factorization of $n$, and c) $A$ is too slow, in practice, to find the prime factors of $2^{1048576}+1$. [Or c') $A$ hasn't been discovered yet.] | |
| Sep 8, 2016 at 9:25 | review | Suggested edits | |||
| Sep 8, 2016 at 10:21 | |||||
| Sep 8, 2016 at 6:57 | review | Low quality posts | |||
| Sep 8, 2016 at 7:02 | |||||
| Sep 8, 2016 at 6:38 | history | answered | Robert Israel | CC BY-SA 3.0 |