GCD and LCM

GCD is Euclid’s algorithm on the absolute values. LCM is |a| / GCD × |b|. Both inputs must be integers. 0 and 0 is refused.

First integer

Second integer

GCD

LCM

GCD(12, 18) is 6 and LCM is 36. Fractions are not this page.

Recent on this tool

This list is the copy in this browser. Click a result to reopen those fields. The server copy sits behind the site owner's PIN.

No results yet. Use a calculator — the first reading appears here.

An educational estimate. Not medical, tax or credit advice.

Factorial, permutations and combinations for whole n and r.

What is x percent of y, what percent is a of b, and the percentage change from A to B.

How much a figure moved, as a percent of the starting value.

Sine, cosine and tangent of an angle in degrees, plus the radian.

Fill two sides of a right triangle; the third and the area come out.

Real roots of a quadratic, or a linear fallback if a is zero.