关于本计算器
Greatest common divisor via Euclid plus least common multiple of two integers.
最大公约数与最小公倍数。
Greatest common divisor via Euclid plus least common multiple of two integers.
Defined as n; GCD(0, 0) is undefined.
|a·b| ÷ GCD(a, b).
Absolute values are used — signs do not matter.