Java Utililty Methods lcm

if (x1 <= 0 || x2 <= 0) {
    throw new IllegalArgumentException("Cannot compute the least " + "common multiple of two "
            + "numbers if one, at least," + "is negative.");
int max, min;
if (x1 > x2) {
    max = x1;
    min = x2;
...

return (a * b) / gcd(a, b);

return a * (b / gcd(a, b));

return a * b / gcd(a, b);

return (u / gcd(u, v)) * v;

return x * y / gcd(x, y);

if (a.length == 1) {
    return a[0];
} else {
    long lcm = 1;
    for (int i = 0; i < a.length; i++) {
        if (i == 0) {
            lcm = lcm(a[i], a[i + 1]);
        } else {
...

long lowestCommonMultiple = A * B;
int curNum = 0;
int indexA = 1;
int indexB = 1;
int curA = 1;
int curB = 1;
while (curNum < (A * B)) {
    curA = A * indexA;
...

if (args == null || args.length < 2)
    throw new IllegalArgumentException("lcmPositive requires at least two arguments");
int result = args[0];
int n = args.length;
for (int i = 1; i < n; i++) {
    result = lcmPositive(result, args[i]);
return result;
...