The expression m % n yields the remainder of m upon (integer) division by n. Define the greatest common divisor (GCD) of two integers x and y by: gcd(x, y) = y ged(x, y)=gcd(y,x) gcd(x, y) = ged(y,x%y) if (y Sx and sy==0) if (x