gcd(n, m)

Returns the greatest common divisor of integers n and m.


See also lcm factors primes 


Example


gcd( 20, 12 )

4