Нахождение наибольшего общего делителя и наименьшего общего кратного
GCD (Greatest Common Divisor)
6
LCM (Least Common Multiple)
72
Calculation Steps
GCD using Euclidean algorithm:
LCM formula:
LCM(a, b) = (a × b) / GCD(a, b)
Prime Factorization
Quick GCD/LCM of Two Numbers
Нахождение наибольшего общего делителя и наименьшего общего кратного
Use this free online математические инструменты tool to work faster without installing extra software. The interface is built for quick input, clear output, and straightforward results on desktop and mobile devices.
This tool runs in your browser whenever possible, which keeps your inputs private and reduces unnecessary round-trips to the server.