Returns the greatest common divisor (gcd) of two integers using Euclid's algorithm.
int greatestCommonDivisor(int a, int b) => a.gcd(b);