In mathematics, the greatest common divisor (gcd) of two or more integers, when at least one of them is not zero, is the largest positive integer that divides the numbers without a remainder.
Required Ruby Version
>= 0
Authors
James Moriarty
Versions
-
0.0.1
-
source
- 0.0.1 source January 10, 2015 (6.5 KB)
-