gcd(a, b)

Greatest common divisor of two integers.

aNumber 1 for the algorithm.
bNumber 2 for the algorithm.
return valueThe greatest common divisor of a and b.

It's based on Euclid's algorithm.

The arguments should be integers.

The algorithm can have more arguments, and the greatest common divisor of all specified numbers will be returned.

gcd(16, 8*3)