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

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

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.