I don't suppose you know of a good factoring algorithm?
From the future: these days, Math::Prime::Util (along with Math::Prime::Util::GMP for larger inputs) is excellent.
In reply to Re^3: Algorithm for cancelling common factors between two lists of multiplicands
by hv
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |