You are viewing a single comment's thread. Return to all comments →
There is no need for this to be hard:
gcd' n m = if n == m then n else gcd (mod m n) n
Seems like cookies are disabled on this browser, please enable them to open this website
Computing the GCD
You are viewing a single comment's thread. Return to all comments →
There is no need for this to be hard: