Least common multiple
From Free Pascal wiki
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(a, b: Int64): Int64; begin result := b * (a div GreatestCommonDivisor(a, b)) end;