The greatest common divisor is the largest possible positive integer that can divide both input integers with no remainder. The greatest common divisor has a few solving methods that allow it to be computed by hand, the most popular method is known as Euclid's Algorithm. Below we will dive into Euclid's Algorithm!