CalcBE tr-tr / Hesaplayıcılar / Matematik / GCD & LCM Hesap Makinesi (with Steps)

← Matematik

GCD & LCM Calculator (with Steps) — Extended Euclid & Ladder Method

Follow gcd and lcm with ladder (division) steps and Euclidean a = q·b + r logs, then dive into extended Euclid back substitution with teacher-ready notes.

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
Mode

Enter integers separated by commas or spaces (up to 64). Negative numbers and zeros are allowed.

Results

Toggle discussion points you want to highlight in class.

FAQ

What does the Euclidean log show?

Every reduction is written as a = q·b + r, so you can follow each gcd and lcm update and see how zeros are handled.

How do ladder steps differ from the Euclidean steps?

The ladder (repeated division) view shows the prime pulled out on the left and the divided numbers on the right, while the Euclidean steps list each a = q·b + r division. Both describe the same gcd reductions.

Related tools