Szathmáry László honlapja @ DEIK

Notes:

GCD (greatest common divisor) in Hungarian: "legnagyobb közös osztó" (LNKO)
LCM (least common multiple) in Hungarian: "legkisebb közös többszörös" (LKKT)

(1) GCD and LCM

import std.stdio;
import std.numeric;

void main()
{
writeln(gcd(30, 45)); // 15

writeln(lcm(3, 4)); // 12
}

As you can see, these functions can be called with 2 arguments only. But what if we want to calculate the GCD or LCM of more values?

(2) multiple arguments

#!/usr/bin/env rdmd

import std.stdio;
import std.numeric;

int myLcm(const int[] numbers) pure
{
assert(numbers.length >= 2);
int result = lcm(numbers[0], numbers[1]);
for (int i = 2; i < numbers.length; ++i)
{
result = lcm(result, numbers[i]);
}
return result;
}

int myGcd(const int[] numbers) pure
{
assert(numbers.length >= 2);
int result = gcd(numbers[0], numbers[1]);
for (int i = 2; i < numbers.length; ++i)
{
result = gcd(result, numbers[i]);
}
return result;
}

void main()
{
writeln(myLcm([4, 5, 5, 2])); // 20

writeln(myGcd([30, 45, 120])); // 15
}