in connection with lcm, the gcd (greatest common divisor) determines the largest number that can divide into both inputs I used Eulers algorithm with Euclidan Divison for determining this. assumes non-zero inputs
in connection with lcm, the gcd (greatest common divisor) determines the largest number that can divide into both inputs I used Eulers algorithm with Euclidan Divison for determining this. assumes non-zero inputs