In integer arithmetic, the Greatest Common Divisor of two values A and B is the biggest number which can divide both A and B without remainder.

In the Grasshopper expression language the Greatest Common Divisor function is available as gcd(a,b).