I should add that my program sometimes fails for inputs >= 2^63. This is because of the way it performs the modular multiplication. If anyone has a better way to do this, please let me know.
--Trevor "Mathematics is like checkers in being suitable for the young, not too difficult, amusing, and without peril to the state." --Plato On Mon, 5 Jan 2004, Jim Meyering wrote: > > Are there any plans to implement faster algorithms in factor? For 64-bit > > integers Pollard's rho method would be a good choice. I have an > > implementation that is hundreds of times faster than factor for > > large inputs. Is anyone interested in this? > > Sounds interesting to me. > > _______________________________________________ Bug-coreutils mailing list [EMAIL PROTECTED] http://mail.gnu.org/mailman/listinfo/bug-coreutils
