Least common multiple

From Free Pascal wiki
Jump to: navigation, search

English (en) suomi (fi) français (fr)

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;
  result := b * (a div GreatestCommonDivisor(a, b))

Note: Function GreatestCommonDivisor must be defined before this function

See also