[sage-devel] Re: Fwd: bug in isprime()

2007-09-08 Thread John Cremona
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

[sage-devel] Re: Fwd: bug in isprime()

2007-09-07 Thread Bill Hart
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