Find the gcd using the euclidean algo
# Crosscompute
a_int = 1701
b_int = 3768
a, b = a_int, b_int
def gcd(a, b):
if a < b:
return gcd(b, a)
elif b == 0:
return a
else:
r = a % b
return gcd(b, r)
f = gcd(a, b)
print('gcd(%d,%d) = %d' % (a, b, f))