On Mar 21, 11 21:54, dsimcha wrote:
(3) BigInts cannot overflow. In particular, gcd algorithms for arbitrary precision types are quite different to gcd for built-ins.Ok, I don't know much about how BigInts work under the hood. I used a fairly simple implementation of Euler's algorithm here. Is there something much more efficient for BigInts?
http://en.wikipedia.org/wiki/Lehmer%27s_GCD_algorithm
