Least common multiple

From Free Pascal wiki
Jump to: navigation, search

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

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

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-icon.png

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

see also