← All calculators / Math

Greatest common factor

Whole numbers only.

01 / Your inputsBrowser-only calculation
Greatest common factor
—
How it works

The formula

Euclidean remainder algorithm

Example inputs

First integer: 12 · Second integer: 18

Result: 6

What the Greatest common factor works out

The Greatest common factor turns the figures below into greatest common factor, using the formula Euclidean remainder algorithm. Whole numbers only.

What each field means

First integer
A number; the example uses 12.
Second integer
A number; the example uses 18.

A worked example

With the values this page opens on — First integer 12, Second integer 18 — the answer is 6. Reset restores exactly these numbers.

Reading the result

The result is labelled greatest common factor. It is recalculated on every keystroke from the unrounded values in the form, and the accompanying graph follows the same numbers.

Assumptions and limits

Whole numbers only. Result is nonnegative.

Your privacy

Nothing you type leaves your browser.

Related calculators

Common factors ↗ · Least common multiple ↗ · Slope ↗ · Binary ↗