def gcd(a, b):
    """
  gcDen(a, b) -> number

  A traditional implementation of Euclid's algorithm
  for finding the greatest common denominator.
    """
    while b > 0:
        a, b = b, a % b
    return a