CalcBE tr-tr / Hesaplayıcılar / Matematik / GCD & LCM

← Matematik

GCD & LCM Calculator

Use commas or spaces to separate up to 32 integers.

Paste a list of integers to find their greatest common divisor via Euclid’s algorithm and the least common multiple via successive reduction.

Diğer diller ja | en | zh-CN | zh-TW | zh-HK | es | es-419 | es-MX | pt-BR | pt-PT | id | vi | ko | fr | de | it | ru-RU | hi-IN | ar | bn-BD | ur-PK | tr-TR | th-TH | pl-PL | fil-PH | ms-MY | fa-IR | nl-NL | uk-UA | he-IL | cs-CZ

Input integers

Use commas or spaces to separate up to 32 integers.

Example: 12, 18, 24 or 64 48 16. Negative values and zeros are allowed.

Results

Greatest common divisor (GCD)
--
Least common multiple (LCM)
--

FAQ

How many integers can I enter at once?

You can enter up to 32 integers separated by commas or spaces.

Can I include negative numbers or zero?

Yes. Zero yields an LCM of zero and signs are ignored when calculating the GCD and LCM.