spencerdavis2000/GCD

Using Euclid's Algorithm a = bq + r to figure out the Greatest Common Divisor

Ruby