MathNumber theory

Euclid's algorithm

Theory

Order of the steps

Report a typo

Put steps of the Euclid's algorithm for computing gcd⁡(141,51)\gcd(141, 51) in the correct order.

Put the items in the correct order
141=51⋅2+39141 = 51 \cdot 2 + 39
12=3⋅4+012 = 3 \cdot 4 + 0
51=39⋅1+1251 = 39 \cdot 1 + 12
39=12⋅3+339 = 12 \cdot 3 + 3

Create a free account to access the full topic