Greatest common divisor
Find the greatest common divisor of two integers.
How do I use this calculator?
Enter values using the stated units. The result updates as you type. To compare two situations, keep the same units and change only the relevant inputs.
The formula
Euclidean algorithm: repeat the division remainder step until it reaches zero.
A practical example
Here is the calculation with the values shown on opening. You can restore them with the reset button.
| First integer | 24 |
|---|---|
| Second integer | 36 |
| Greatest common divisor | 12 |
The result corresponds to these inputs and the stated formula. Displayed decimals are rounded to at most six places; calculations retain the available precision until display.
Frequently asked questions
How can I check the result?
Use the formula “Euclidean algorithm: repeat the division remainder step until it reaches zero.” with your own values. First check the units and stated conditions, then compare your result with the tool.
Are my data saved?
The entered values are used only for the calculation in your browser. The application does not send them to a calculation service or retain them after reload. See the privacy policy for hosting operations.
Why does the calculator show an error?
An empty field, division by zero or a value incompatible with the formula may prevent calculation. The message explains the correction needed. You may use a dot or comma for decimals.
Cite this resource on your website
Vous utilisez cet outil ou cet article dans une publication ? Vous pouvez ajouter une référence descriptive vers cette page.
Texte : Greatest common divisor · https://eseogen.com/calculatrices/pgcd/?mp_lang=en