We introduce Euclid's algorithm and use it to find the greatest common divisor of two positive integers. We also use the algorithm to express the greatest common divisor as an integer (linear) combination of the two given positive integers.