Re: factor is too fast

[Mike Frysinger]

On Tuesday 21 April 2009 08:19:23 Philip Rowlands wrote:
> On Tue, 21 Apr 2009, Toralf F?rster wrote:
> > For a long time I used the command "factor" to test my system WRT the cpu
> > ondemand governor of the linux kernel, eg for issues like this :
> > http://bugzilla.kernel.org/show_bug.cgi?id=12385
> >
> > However switching from coreutils-6.10 to 7.1 (stable Gentoo Linux) now
> > the factor command is too fast: it takes only 0.003 sec instead of 5.5
> > sec for the same prime number.
>
> That's probably due to this entry from NEWS:
>
> * Noteworthy changes in release 7.0 (2008-10-05) [beta]
>
>    If the GNU MP library is available at configure time, factor and
>    expr support arbitrarily large numbers.  Pollard's rho algorithm is
>    used to factor large numbers.

if GMP is too fast, then you could try building coreutils with USE=gmp.  if 
coreutils itself got a new algo, then i guess save the old binary ...
-mike

signature.asc
Description: This is a digitally signed message part.