gcd(+Number1, +Number2, -Result)

-Result is gcd(+Number1, +Number2)

Number1

Integer.

Number2

Integer.

Result

Output: integer.

Description

The Greatest Common Divisor operation is only defined on integer arguments.

This predicate can be used as a function in arithmetic expressions. In coroutining mode, if Number1 or Number2 are uninstantiated, the call is delayed until these variables are instantiated.

Modes and Determinism

• gcd(+, +, -) is det

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