Timeline for Finding the greatest (smallest) factor of a number smaller (greater) than another number
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2015 at 3:11 | answer | added | Michael | timeline score: 0 | |
| Jan 23, 2015 at 22:08 | history | edited | GH from MO | CC BY-SA 3.0 |
edited tags; edited title
|
| Dec 23, 2011 at 3:34 | answer | added | msg555 | timeline score: 2 | |
| Oct 28, 2011 at 4:22 | comment | added | Noam D. Elkies | This can be hard even if $n$ is squarefree with known but numerous prime factors, because it reduces to a knapsack problem (given items of size $c_i$, find $s$ large enough to approximate $\exp sc_i$ sufficiently well by primes $p_i$, and take $n = \prod_i \phantom. p_i$, etc.). | |
| Oct 27, 2011 at 22:25 | answer | added | psd | timeline score: 0 | |
| Oct 27, 2011 at 22:19 | history | asked | user18839 | CC BY-SA 3.0 |