For two integers x and y, this function equals xy divided by the LCM of x and y.
One method for finding this quantity is through an algorithm whose worst-case is when the inputs are Fibonacci numbers. Bezout's lemma states that this value is the smallest positive integer which can be written as a linear combination of this function's inputs. The value of this function over two variables can be found with the (*) Euclidean Algorithm, and two numbers are relatively prime if this function of them returns the value of one. For two integers x and y, this function equals xy divided by the LCM of x and y. For ten points, identify this function, which gives the largest integer that divides a collection of numbers.
One method for finding this quantity is through an algorithm whose worst-case is when the inputs are Fibonacci numbers.
greatest common divisor (or greatest common factor, also accept highest for greatest) &lt;MS&gt;