 The analogous equation for the left divisors would be

With either choice, the process is repeated as above until the greatest common right or left divisor is identified.As in the Euclidean domain, the "size" of the remainder must be strictly smaller than , and there must be only a finite number of possible sizes for , so that the algorithm is guaranteed to terminate.Most of the results for the GCD carry over to noncommutative numbers.