 Leopold Kronecker has shown that this version requires the least number of steps of any version of Euclid's algorithm.More generally, it has been proven that, for every input numbers "a" and "b", the number of steps is minimal if and only if is chosen in order that formula_3 where formula_4 is the golden ratio.The Euclidean algorithm is one of the oldest algorithms in common use.