Least common multiple

From Free Pascal wiki
Revision as of 14:35, 10 March 2015 by Eny (talk | contribs) (Clarify and simplify)
Jump to navigationJump to search

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;
Light bulb  Note: Function GreatestCommonDivisor must be defined before this function


See also