How to use this tool
Enter two positive whole numbers up to one billion. Euclid’s algorithm finds their greatest common divisor. The least common multiple is the first number divided by that divisor, then multiplied by the second number. Zero, fractions and negative inputs are excluded to keep the meaning of the two results unambiguous.
Try these values
For 12 and 18, the greatest common divisor is 6 and the least common multiple is 36.
Common questions
What does GCD help with?
It reduces fractions or ratios by identifying a shared factor.
What does LCM help with?
It finds a common denominator or a shared interval for whole-number cycles.
Something doesn’t add up? Report an issue · Methods & corrections