An example should illustrate the process. Find the common factor of 38 and 14.
Dividing 38 by 14 gives a remainder of 10. Repeat with the smaller two numbers.
14 divide by 10 gives a remainder of 4.
10 divided by 4 gives a remainder of 2.
4 divided by 2 gives a remainder of 0.
The last non-zero number is the greatest common factor. In this case, 2.
It is: 9
Applying Euclid's algorithm, the greatest common factor of 44 and 47 is the same as the greatest common factor of 44 and 3 - where 3 is the remainder of the division of 47 by 44.
The same as the greatest common factor of 52 and 26 (where 26 is the remainder of the division of 78 / 52).
The same as the greatest common factor for 77 and 7, where 7 is the remainder of the division of 161 by 77.
The same as the greatest common factor of 20 and 7 (where 7 is the remainder of the division of 207 by 20).
The greatest common factor of 170 and 210 is 10
It is: 9
Applying Euclid's algorithm, the greatest common factor of 44 and 47 is the same as the greatest common factor of 44 and 3 - where 3 is the remainder of the division of 47 by 44.
The same as the greatest common factor of 72 and 24 (24 is the remainder of the division of 96 / 72).
The same as the greatest common factor of 52 and 26 (where 26 is the remainder of the division of 78 / 52).
Same as the greatest common factor of 19 and 18 - where 18 is the remainder of the division of 94 by 19.
The same as the greatest common factor of 35 and 28 (where 28 is the remainder of the division of 63 by 35).
The same as the greatest common factor for 77 and 7, where 7 is the remainder of the division of 161 by 77.
The same as the greatest common factor of 20 and 7 (where 7 is the remainder of the division of 207 by 20).
No.
That's the same as the greatest common factor of 28 and 10 (where 10 is the remainder of the division of 738 / 28).
Same as the greatest common factor of 50 and 20 - where 20 is the remainder of the division of 70 by 50.