GCD & LCM Calculator

Find the greatest common divisor and least common multiple of two or more whole numbers, with the Euclidean algorithm steps for the first pair.

Runs on your device

Result

Results appear here as you type.

What it does

Enter numbers separated by commas or spaces. The GCD uses the Euclidean algorithm, shown step by step so you can reproduce it in an exam.

How to use it

  1. Enter two or more whole numbers.
  2. Read the GCD and LCM.
  3. Review the Euclidean steps.

Example

gcd = 12, lcm = 252. Select Try an example above to see it.

When it helps

  • Simplifying fractions.
  • Scheduling repeating events.
  • Number theory practice.

Questions

What is the GCD of a number and 0?

The number itself; gcd(n, 0) = |n|.

How is LCM computed?

lcm(a, b) = |a × b| ÷ gcd(a, b), applied pairwise across the list.

More student & maths tools

See all 12

People also use

Browse all 200 tools