Re^8: Algorithm for cancelling common factors between two lists of multiplicands (192.5 ms)

[tmoertel]

tmoertel's haskell implementation amazes me on the precision! I wonder if that is specific to Haskell or the way it was coded

The reason the implementation has such precision is not because it is written in Haskell – although that does make coding more convenient – but because it computes the answer exactly as a ratio of bigints and then extracts decimal digits until the desired precision has been obtained. If you want more or fewer than sixity digits, for example, just change 60 to the desired number in the sciformat 60 call in the code in Re^13: Algorithm for cancelling common factors between two lists of multiplicands.

Cheers,
Tom