A simple tool to calculate the gcd (greatest common divisor) and lcm (least common multiple) of a list of numbers. It uses Euclid’s algorithm so it runs quickly (O(log(n)) time complexity) without needing to check every factor.
GCD:
0
LCM:
1