Template talk:Euclidean algorithm/running

The greatest common divisor (g.c.d.) of 22 and 100 is =(100,22) =(22,12) =(12,10) =(10,2) =(2,0) =(0,Division by zero)
 * ( 22,100 )

The greatest common divisor (g.c.d.) of 3 and 5 is ( 3,5 ) =(5,3) =(3,2) =(2,1) =(1,0) =(0,Division by zero) The great common divisor is 1.