[ Arithmetic | Reference Manual | Alphabetic Index ]
# gcd(+Number1, +Number2, -Result)

Unifies Results with the Greatest Common Divisor of Number1 and Number2
*Number1*
- Integer.
*Number2*
- Integer.
*Result*
- Output: integer.

## Description

This predicate is used by the ECLiPSe compiler to expand evaluable
arithmetic expressions. So the call to gcd(Number1, Number2, Result) is
equivalent to
Result is gcd(Number1, Number2)

which should be preferred for portability.
The Greatest Common Divisor operation is only defined on integer arguments.

In coroutining mode, if Number1 or Number2 are uninstantiated, the call
is delayed until these variables are instantiated.

### Modes and Determinism

### Exceptions

*(4) instantiation fault *
- Number1 or Number2 is not instantiated (non-coroutining mode only).
*(5) type error *
- Number1 or Number2 is a number but not an integer.
*(24) number expected *
- Number1 or Number2 is not of a numeric type.

## Examples

Success:
Result is gcd(9, 15). % gives Result = 3
Result is gcd(-9, 15). % gives Result = 3
Result is gcd(2358352782,97895234896224). % gives Result = 6
Error:
Result is gcd(1.0, 2). % type error

## See Also

gcd / 5, lcm / 3, is / 2