Paul Rubin wrote: > [EMAIL PROTECTED] (Alex Martelli) writes: > > For numbers of this size, won't gmpy use FFT-based multiplication? > That's potentially orders of magnitude faster than ordinary n**2 > multiplication.
But Python is no slouch with its use of Karatsuba multiplication. (in other words, Python is not N**2 for large numbers). --Scott David Daniels [EMAIL PROTECTED] -- http://mail.python.org/mailman/listinfo/python-list
