Number Theory Level 13: GCD (<= 200) - Learn

First Euclid step

Replace the larger number with its remainder.

First Euclid stepFirst Euclid step completed

Repeat with remainder

Continue with the new pair.

First Euclid stepFirst Euclid step completed

Repeat with remainderRepeat with remainder completed

Reach exact division

Stop when the remainder is zero.

First Euclid stepFirst Euclid step completed

Repeat with remainderRepeat with remainder completed

Reach exact divisionReach exact division completed

Read GCD

The last nonzero divisor is the GCD.

Number Theory Level 13: GCD (<= 200). Euclidean algorithm.