Difference between revisions of "Least common multiple"
From Free Pascal wiki
Jump to navigationJump to search (Created page with " The least common multiple is the smallest positive integer that is divisible by both a and b. If numbers are 12 and 9 then least common multiple is 36. == Function LeastCo...") |
m (Clarify and simplify) |
||
| Line 1: | Line 1: | ||
| − | The least common multiple is the smallest positive integer that is divisible by both a and b. | + | 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 == | ||
<syntaxhighlight> | <syntaxhighlight> | ||
| − | + | function LeastCommonMultiple(a, b: Int64): Int64; | |
| − | function LeastCommonMultiple( a, b: | ||
| − | |||
| − | |||
begin | begin | ||
| − | + | result := b * (a div GreatestCommonDivisor(a, b)) | |
| − | |||
end; | end; | ||
| − | |||
</syntaxhighlight> | </syntaxhighlight> | ||
Revision as of 14:35, 10 March 2015
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 defined before this function
