Without actually trying it, Math::Big::Factors says:
For very small numbers the computation of the wheel of order 7 may actually take longer than the factorization, but anything that has more than 10 digits will usually benefit from order 7.
As I'm limiting myself to 2**32, it probably won't help?
In reply to Re^4: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |