GCD and LCM Integer Functions
Greatest common divisor and least common multiple
GCD(n, m) LCM(n, m) mGCD(x) mLCM(x)
n, m |
integer scalars. |
x |
a vector of integers. |
Computation based on the Euclidean algorithm without using the extended version.
mGCD (the multiple GCD) computes the greatest common divisor for
all numbers in the integer vector x together.
A numeric (integer) value.
The following relation is always true:
n * m = GCD(n, m) * LCM(n, m)
GCD(12, 10) GCD(46368, 75025) # Fibonacci numbers are relatively prime to each other LCM(12, 10) LCM(46368, 75025) # = 46368 * 75025 mGCD(c(2, 3, 5, 7) * 11) mGCD(c(2*3, 3*5, 5*7)) mLCM(c(2, 3, 5, 7) * 11) mLCM(c(2*3, 3*5, 5*7))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.