# Least common multiple

English (en) suomi (fi) français (fr) русский (ru)

The least common multiple of two integers $a$ and $b$ is the smallest positive integer that is divisible by both $a$ and $b$.

For example: for 12 and 9 then least common multiple is 36.

## function leastCommonMultiple

function leastCommonMultiple(a, b: Int64): Int64;
begin
result := b * (a div greatestCommonDivisor(a, b));
end;

Note: function greatestCommonDivisor must be at least declared before this function.