GCD, LCM and Mod

gcd(A, B, C, ...) Returns the greatest common divisor: the largest integer that evenly divides all the values in A, B, C...

lcm(A, B, C, ...) Returns the least common multiple: the smallest positive integer that is a multiple of all the values A, B, C, ...

mod(x, y) Returns the remainder on dividing x by y (x modulo y). Result has the same sign as x.

Arguments:

• A, B, C, ... are each real, positive, dimensionless integers or an array whose elements are real, positive, dimensionless integers.
• x and y are real scalars, and y ≠ 0.

Notes:

• The modulo function is useful in programs.
• For symbolic evaluation, the arguments to mod must be integers, and mod always returns a positive number.

QuickSheet