Question: Algorithm Challenge "Smallest Common Multiple" Solution

[DanCouper]

Easiest way to figure out smallest common multiple is to figure out the greatest common divisor first (GCD).

Smallest Common Multiple solution -efficient enough?

So spoilers here; I am not very knowledgeable w/r/t maths, so had to look this up, but: lowest common multiple of a and b (make it a function like lcm(a, b)) is equal to a times b divided by the greatest common divisor of a and b. So this looks like (a * b) / gcd(a, b). GCD is very easy to calculate:function gcd(a, b) { while (b !== 0) { [a, b] = [b, a % b]; } return a; } (nb the [a, b] = [b, a] is an easy way to swap variables without using a temporary variable, I just used it to …