while y: x, y = y, x % y return x

The code gets the greatest common denominator of two integers. It uses a while loop to get the remainder of (x,y) until y is 0. If y is 0, then x is the greatest common denominator.