What would you like to understand?

The Euclidean algorithm computes the greatest common divisor by repeatedly applying the division algorithm. Starting with two natural numbers $a$ and $b$, you divide the larger by the smaller to get a quotient and a remainder.

Conditions: The inputs $a$ and $b$ are natural numbers.; The division algorithm is applied repeatedly.; The process stops when a remainder equals 0.

The Euclidean algorithm computes the greatest common divisor by repeatedly applying the division algorithm. Starting with two natural numbers $a$ and $b$, you divide the larger by the smaller to get a quotient and a remainder.

Conditions: The inputs $a$ and $b$ are natural numbers.; The division algorithm is applied repeatedly.; The process stops when a remainder equals 0.