On Tue, Jan 27, 2009 at 10:47 AM, Santanu Sarkar <sarkar.santanu....@gmail.com> wrote: > I want to collect all divisors less than 2^30 of a large positive integer N > using > Elliptic Curve Factorization Method. How this is possible using SAGE? >
The functionality is very well hidden (Robert Miller -- can you improve this?) and completely undocumented. There is an ecm command, that has docs but it is buggy. Fortunately, somebody else asked me the same question recently, and I figured out how to do it using the Cython interface to GMP-ECM. Here's an example: sage: import sage.libs.libecm sage: sage.libs.libecm.ecmfactor(next_prime(10^9)*next_prime(10^40),10^5) (True, 1000000007) sage: sage.libs.libecm.ecmfactor(next_prime(10^9)*next_prime(10^7)*next_prime(10^40),10^5) (True, 10000019070000133) sage: factor(10000019070000133) 10000019 * 1000000007 William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
