Thankyou hv.
That'll work. I don't suppose you know of a good factoring algorithm?
I'd like to avoid Math::Pari (if possible) for this.
In reply to Re^2: 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: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |