View Problem

### Greatest Common Divisor

Find the largest positive integer that divides two given numbers without a remainder. For example, the GCD of 8 and 12 is 4.

There are 17 other solutions in additional languages (clojure, cpp, csharp, erlang ...)

There are 17 other solutions in additional languages (clojure, cpp, csharp, erlang ...)