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

The function finds the greatest common divisor between two numbers. The main loop continues to run until y is 0. We do this because the only time we'll ever get 0 is when the greatest common divisor is found. The function then returns x, which contains the greatest common divisor.