Skip to main content

GCD & LCM Finder

Find the Greatest Common Divisor and Least Common Multiple of two numbers instantly.
Local-first

GCD

6

LCM

36

How this tool works

What it accepts, how to use it, and where your input is processed.

These two metrics are the building blocks of number theory. GCD is the largest positive integer that divides each of the integers, while LCM is the smallest positive integer that is divisible by both.

Applications:

  • Simplifying Fractions: Divide both numerator and denominator by their GCD.
  • Scheduling: Use LCM to find when two independent periodic events will coincide.
  • Data Alignment: Essential for byte-alignment calculations in systems programming.
Need an extra feature or found an edge case?Send Feedback

Related tools

Open after you finish the primary task.

Show