> 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?
William pointed out the Cython interface to GMP-ECM. However this does not
completely answer your question, since it will only find *some* f
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?
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this
Hi,
Does the Factorization class not have a
routine to return just a list of the factors?
Basically, something like the value function
but instead of multiplying them, puts
each term into a list?
I ask because the output of a squarefree_decomposition
is a factorization and I'd like to use those
