GCD (greatest common divisor)
—
LCM (least common multiple)
—
Numbers used
Negatives and zeros are handled via their absolute values.
Euclidean algorithm — running GCD
Prime factorizations
| Number | Prime factorization |
|---|
GCD = product of shared prime powers (lowest exponent)
LCM = product of all primes at highest exponent
Identity check (for exactly two numbers)
Enter two numbers to see GCD × LCM = |a × b|.