 For the case "n" = 2, an extension of the Euclidean algorithm can find any integer relation that exists between any two real numbers "x"1 and "x"2.The algorithm generates successive terms of the continued fraction expansion of "x"1/"x"2; if there is an integer relation between the numbers, then their ratio is rational and the algorithm eventually terminates.Integer relation algorithms have numerous applications.