gcd()

Finds the largest integer which evenly divides the two specified integers.

This function is valid in v2.1.0 to v2.14.0. This function has been downloaded 44 times.

Parameters

{number} int1
The first of two integers for which the greatest common denominator should be found.
{number} int2
The second of two integers for which the greatest common denominator should be found.

Returns

{number}
Returns the largest integer which evenly divides int1 and int2.