GCD & LCMmedium
0:00.0

In the Euclidean algorithm, the sequence of remainders is strictly decreasing: r0>r1>r2>0r_0 > r_1 > r_2 > \ldots \geq 0. Which property ensures the algorithm terminates?