Greatest Common Divisor r←x∨y

r is the result of the scalar application of the GCD function, gcd ( x , y ) \mathop{\text{gcd}}(x, y) .

It is defined using the Euclidean algorithm: