GCD & LCM Calculator

Find the greatest common divisor and least common multiple of two integers.

Number A

Number B

GCD

LCM

144

A × B

864

How it works

GCD is the largest integer that divides both numbers evenly (Euclidean algorithm).

LCM is the smallest positive integer divisible by both: LCM(a,b) = |a×b| / GCD(a,b).

Find percentages, percent of a number, and percent change.

Add, subtract, multiply, and divide fractions.

Simplify ratios and scale them proportionally.

Solve ax² + bx + c = 0 and show the discriminant.