Of course our results will match in those rare cases in which the FET sum happens to contain only one term.
Care to try and explain that?
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: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |