Algorithms

Question 1

Euclid’s Theorem for GCD

Answer 1

Greatest_common_divisor#Euclid’s_algorithm
const gcd = (a, b) => (b === 0) ? a : gcd(b, a % b);

Question 2

Least Common Multiple using Greatest Common Divisor

Answer 2

Least_common_multiple#Using_the_greatest_common_divisor
// const lcm = (a, b) => a * b / gcd(a, b);

Question 3

Using LCM with Multiple Numbers (reduce function)

Answer 3

// // LCM of multiple numbers

// return range.reduce((multiple, curr) => lcm(multiple, curr));