buillax. Tous les outils

Greatest Common Divisor

MATHEMATICS

Greatest Common Divisor

Find the greatest common divisor of two integers.

UNDERSTAND YOUR RESULT

How it works

Find the greatest common divisor of two integers.

THE CALCULATIONEuclidean remainder algorithm

Using this calculator

Enter first integer, second integer. Euclidean remainder algorithm.

What to keep in mind

Calculations use finite real numbers. Intermediate values are unrounded; very large or undefined results are rejected.

Frequently asked questions

Are my entries saved?

No. Calculator inputs remain in the current page and are cleared when you reload or leave. The tools do not upload your entries.

Why are results rounded?

The display is rounded for readability. Calculations use unrounded intermediate values. An estimate should not be interpreted as an exact measurement.