Least common multiple
English · Français · Suomi · Русский
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_lcmin 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.
Edited on wiki.freepascal.org by 5 people, 2015–2022
From the official wiki's backup of 26 May 2024: who edited this page there, and when. Edits made there after that date were not recorded, and the earlier versions are not shown here; the main page says why.
| When | Who | What changed |
|---|---|---|
| Djzepi | Created page | |
| Eny | Clarify and simplify (minor) | |
| Djzepi | ||
| FTurtle | ||
| E-ric | (minor) | |
| Kai Burghardt | add Category:Mathematics | |
| Kai Burghardt | resolve Category: Category:Pages using deprecated enclose attributes (minor) |
Talk about this page
Nobody has opened a bench for this page yet. Sign in to open one.