Pascal classical algorithm - finding the least common multiple of two numbers

From , 5 Years ago, written in Delphi (Object Pascal), viewed 123 times.

function lcm(a, b: Integer): Integer;
begin
  if a < b then
    Swap(a, b);
  lcm := a;
  while lcm mod b > 0 do
    Inc(lcm, a);
end;

Reply to "Pascal classical algorithm - finding the least common multiple of two numbers"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters