Thanks for the extra explanations, Bill.
I wrote an extra item in pari's online FAQ, and an additional note in
the manual, while Karim has put into the pari cvs already. But (at
least as far as mwrank is concerned) we still need a proof=true
version of factorint().
John
On 9/8/07, Bill Hart [EMAIL PROTECTED] wrote:
factor is a general factoring function for integers, polynomials and
various other types. It also takes an optional parameter to tell it
how many primes to use in the factorisation. So for example if you
want to know all prime factors of an integer up to 1000 you'd use
factor(n, 1000).
factorint only factors integers and takes an optional parameter to
tell it which factorisation algorithms to use. For example you may
know that your integer is an RSA modulus and only divisible by two
large primes. As such running a trial factoring routine, an elliptic
curve factorisation or a SQUFOF test is not going to find a factor.
Similarly you may have a very large integer which has no hope of being
factored by the quadratic sieve and your only hope of finding a factor
is if it is relatively small, in which case you'd want to use the
elliptic curve method without giving up. factorint allows you to do
that.
Bill.
--
John Cremona
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~--~~~~--~~--~--~---
