Find the greatest common divisor (HCF) and least common multiple of any two integers using the Euclidean algorithm.
More free utilities you might find useful
Quick answers to common questions
The Greatest Common Divisor (also called Highest Common Factor) is the largest positive integer that divides both numbers without remainder.
The Least Common Multiple is the smallest positive integer that is divisible by both numbers.
For two numbers a and b: GCD(a,b) × LCM(a,b) = |a × b|.
The calculator uses absolute values, so GCD and LCM are always computed on positive integers.
Your data is processed entirely in your browser. Nothing is sent to any server.