|Syntactic Confectionery Delight|
Re^4: Algorithm for cancelling common factors between two lists of multiplicandsby BrowserUk (Pope)
|on Aug 10, 2005 at 10:35 UTC||Need Help??|
tmoertel's haskell implementation of the cancelling code ( in 2.6 seconds):
Using Math::Pari (in 26 ms):
Using Math::BigInt (Yes. That 4 hrs 38 minutes!)
The whole point of the cancelling code is that you do not have to calculate the huge factorials in infinite precison (slow) math, because you reduce the factorials to products of sets of much smaller, prime factors and then cancel most of those.
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.