gcd

Greatest common divisor.

Syntax

v = gcd(number1, number2, ...)

Description

Returns the largest non-negative integer that divides every argument exactly. Arguments must be non-negative integers (or are truncated to such).

Examples

gcd(24, 36)        % 12
gcd(7, 1, 2, 5)    % 1

See also

• lcm — Least common multiple.
• mod — Modulo operation (positive result).