Re^4: Algorithm for cancelling common factors between two lists of multiplicands

in reply to Re^3: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands

These are the results I have currently for the inputs [989 9400 43300 2400]:

tmoertel's haskell implementation of the cancelling code ( in 2.6 seconds):

[11:20:43.54] C:\ghc\ghc-6.4\code>FET < ex1.dat
+8.070604647867604097576877675243109941729476950993498765160880e-7030
[11:20:46.34] C:\ghc\ghc-6.4\code>
[download]

Using Math::Pari (in 26 ms):

P:\test>MP-FET.pl
8.070604647867604097576877668E-7030
  1 trial  of _default ( 24.817ms total), 24.817ms/trial
[download]

Using Math::BigInt (Yes. That 4 hrs 38 minutes!)

P:\test>MBF-FET.pl
8.070604647867604097576877675243109941729e-7030
  1 trial  of _default ( 16,699s total), 16,699s/trial
[download]

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.

In Section Seekers of Perl Wisdom