Write a recursive method GCD(n,m) that returns the greatest common divisor of two integers n and m according to the following definition:
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here