Euclid's Greatest Common Divisor Algorithm

Length:
Width:

The Greatest Common Divisor is: