JavaScript (Greatest common divisor, least common multiple)

var a = 5;

var B = 15;

var min = Math.min (A, b);

var Max =math.max (A, b);

For loop greatest common divisor---(least common multiple = a * b/greatest common divisor)

for (var i = min; i > 0; i--) {

If (a% i = = 0 && b% i = = 0) {

Console.log (i);

Break

}

}

For loop seeking least common multiple

for (var i = max; I <= A * B (or True or not); i++) {

if (i% A = = 0 && I% B = 0) {

Console.log (i);

Break
}

}

Seeking greatest common divisor by the method of dividing

While (a% b! = 0) {

var C = a% B;

A = b;

b = C;

}

Console.log (b);

JavaScript (Greatest common divisor, least common multiple)