Greatest common divisor, or GCD, of two numbers is the highest number by which both numbers are divisible. Using the following mathematical fact, gcd(a, b) = gcd(b, a%b) gcd(a, 0) = a Define a recursive function that when passed two integers, returns their their greatest common divisor.