Skip to main content
DevBench
Back to MathAll tools
🔢

GCD & LCM

MathOffline-ready

GCD & LCM Calculator finds the Greatest Common Divisor and Least Common Multiple for any two integers using the Euclidean algorithm. Shows the prime factorisation of each number and step-by-step working. Useful for fraction simplification, scheduling problems, and number theory exercises. Runs entirely in your browser.

Related: Quadratic SolverPercentage CalculatorPythagorean Theorem

Your files and inputs stay in your browser — nothing is uploaded or stored.

Positive whole number

Positive whole number

Greatest Common Divisor

GCD(a, b)6
48 = 6 × 8
18 = 6 × 3

Least Common Multiple

LCM(a, b)144
Formula: a × b / GCD48 × 18 / 6

GCD and LCM calculator

The Greatest Common Divisor (GCD, also called HCF) is the largest integer that divides both numbers without remainder. The Least Common Multiple (LCM) is the smallest integer divisible by both numbers. Computed using the Euclidean algorithm. Used for simplifying fractions, scheduling problems, and number theory.