lcm()

Finds the smallest integer that is evenly divisible by 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 that will be evenly divisible by the returned least common multiple.
{number} int2
The second of two integers that will be evenly divisible by the returned least common multiple.

Returns

{number}
The smallest integer that is evenly divisible by int1 and int2.

Required Function

This function requires the following function which is included automatically:

  • gcd()
    Finds the largest integer which evenly divides the two specified integers.