Least common multiple
Built-in:
say Math.lcm(1001, 221)
Using GCD:
func gcd(a, b) {
while (a) { (a, b) = (b % a, a) }
return b
}
func lcm(a, b) {
(a && b) ? (a / gcd(a, b) * b) : 0
}
say lcm(1001, 221)
Output:
17017
Built-in:
say Math.lcm(1001, 221)
Using GCD:
func gcd(a, b) {
while (a) { (a, b) = (b % a, a) }
return b
}
func lcm(a, b) {
(a && b) ? (a / gcd(a, b) * b) : 0
}
say lcm(1001, 221)
17017