Paul Rubin <[email protected]> writes: > ... d = gcd(abs(x-y), n) ... > print pollard(2778562183799360736577L) > finds the factor 25781083 almost instantly. >
Whoops, you need this too:
def gcd(x,y):
while True:
x,y = y,x%y
if y==0: return x
--
https://mail.python.org/mailman/listinfo/python-list
