← Matematyka i statystyka

NWD i NWW

Wprowadź potrzebne dane i od razu zobacz czytelny wynik w przeglądarce.

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

Inne języki 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 | he-IL | cs-CZ

Wprowadz liczby calkowite

Use commas or spaces to separate up to 32 integers.

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

Wyniki

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

Najczestsze pytania

How many integers Czy moge enter at once?

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

Czy moge include negative numbers or zero?

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