🚀 go-pugleaf

Craig Schulenberg wrote in message <3504a441.0@news.ghgcorp.com>...
>XIAO Gang wrote in message >Hmm... My online factorisor page (which uses
>PARI as backend engine)
>>seems MUCH more efficient than your programs!
>>
>><URL:http://wims.unice.fr/~wims/wims.cgi?cmd=new&module=tool/algebra/factor
>.en>
>>
>>I tried some examples in FACTOR1 who requires up to 1 day to factor by
>>your program; my web page (i.e. PARI) gives me exactly the same answer
>>in seconds!
>>
>Please remember that FACTOR1 uses trial division.  It is intended as a
>complete factorization program only for general, "hard" numbers up to 10**16
>or so.  Past that point it should be viewed just as a "front-end" which will
>pull out all smaller factors (say up to 10**8 or so) and produce an output
>file that is ready for input to Pollard rho, ECM, Williams p-1, Pollard p-1,
>SQUFOF (continued fraction), etc.  The Pollard rho is available now,
>Williams p+1 and Pollard p-1 should be available by the end of March, and
>the remainder by end of April.
>FACTOR1, however, will easily handle very large numbers (e.g., 10**88+1)
>which have penultimate factors less than 10**8-10**9.

Have you taken a look at the MIRACL package by Michael Scott?
http://simpr1.compapp.dcu.ie/~mike/miracl.html
It has these methods and works very well.
-- 
Hypertext C-FAQ: http://www.eskimo.com/~scs/C-faq/top.html
C-FAQ ftp: ftp://rtfm.mit.edu, C-FAQ Book: ISBN 0-201-84519-9
Try "C Programming: A Modern Approach" ISBN 0-393-96945-2
Want Software?  Algorithms?  Pubs? http://www.infoseek.com