Template talk:Euclidean algorithm
The greatest common divisor (g.c.d.) of -10 and -4 is
( -10,-4 )
=(-4,-2)
=(-2,0)
=(0,Division by zero)
The great common divisor is -2.
The greatest common divisor (g.c.d.) of 1000 and 324 is
( 1000,324 )
=(324,28)
=(28,16)
=(16,12)
=(12,4)
=(4,0)
=(0,Division by zero)
The great common divisor is 4.
The greatest common divisor (g.c.d.) of -10000 and 4031 is
( -10000,4031 )
=(4031,-1938)
=(-1938,155)
=(155,-78)
=(-78,77)
=(77,-1)
=(-1,0)
=(0,Division by zero)
The great common divisor is -1.
Start a discussion about Template:Euclidean algorithm
Talk pages are where people discuss how to make content on Wikiversity the best that it can be. You can use this page to start a discussion with others about how to improve Template:Euclidean algorithm.
