Availability:Arithmetic function (see is/2) 
gcd(+IntExpr1, 
+IntExpr2)Result is the greatest common divisor of IntExpr1 and
IntExpr2. The GCD is always a positive integer. If either 
expression evaluates to zero the GCD is the result of the other 
expression.