最大公约数计算器
求最大公约数
公式
GCD via Euclidean algorithm
Repeatedly divide larger by smaller, take remainder until 0.
示例
GCD(48, 36)
= 12
常见问题
关于 最大公约数计算器
Find the greatest common divisor of two numbers.
求最大公约数
Repeatedly divide larger by smaller, take remainder until 0.
= 12
Find the greatest common divisor of two numbers.