GCD, LCM and Mod
gcd(A, B, C, ...)—Returns the greatest common divisor, which is the largest integer that evenly divides all the values in A, B, C, ...
lcm(A, B, C, ...)—Returns the least common multiple, which is 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). The result has the same sign as x.
A, B, C, ... are real, dimensionless integers or arrays whose elements are real, dimensionless integers.
x and y are real scalars, and y ≠ 0.
Was this helpful?