Least common multiple

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.

see also

• greatest common divisor
• mpz_lcm in GMP (GNU multiple precision)

From the Free Pascal wiki, page "Least common multiple", as it stood on 2022-08-06 after a change by Kai Burghardt, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's Licensing page. If you have concerns about this material, message the admin.